( en | de | ru )

 

Disambiguation of "Vaz, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.

, , , , , and . ACM Trans. Algorithms, 20 (1): 6:1-6:20 (January 2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Margarita Vázquez Navarro

Life cycle of contrails from a time series of geostationary satellite images. Uni München, (2009)

Beatriz Vaz

Sharmila Vaz

Jorge Mario Vázquez Márquez

Anna Vazaki

 

Other publications of authors with the same name

Mimicking Networks Parameterized by Connectivity., , , and . CoRR, (2019)A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set., and . Electron. Notes Discret. Math., (2016)On the Approximability of the Traveling Salesman Problem with Line Neighborhoods., , , and . CoRR, (2020)Representation of the non-dominated set in biobjective discrete optimization., , , , and . Comput. Oper. Res., (2015)On Approximating Degree-Bounded Network Design Problems., , , , , and . Algorithmica, 84 (5): 1252-1278 (2022)Survivable Network Design for Group Connectivity in Low-Treewidth Graphs., , , , and . APPROX-RANDOM, volume 116 of LIPIcs, page 8:1-8:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Approximation algorithms for network design and cut problems in bounded-treewidth.. Saarland University, Germany, (2020)Vertex Sparsification for Edge Connectivity., , , , , , , and . CoRR, (2020)Vertex Sparsification for Edge Connectivity., , , , , , , and . SODA, page 1206-1225. SIAM, (2021)On Approximating Degree-Bounded Network Design Problems., , , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 39:1-39:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)