Daniel Vaz

According to our database, Daniel Vaz authored at least 16 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.

Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz

ACM Trans. Algorithms, January, 2024

Parameterized Spanning Tree Congestion.

Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz

CoRR, 2024

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs.

Syamantak Das, Nikhil Kumar, Daniel Vaz

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2022

On Approximating Degree-Bounded Network Design Problems.

Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian

Algorithmica, 2022

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods.

Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

Vertex Sparsification for Edge Connectivity.

Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Approximation algorithms for network design and cut problems in bounded-treewidth.

Daniel Vaz

PhD thesis, 2020

2019

Mimicking Networks Parameterized by Connectivity.

Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz

CoRR, 2019

2018

Dynamics in matching and coalition formation games with structural constraints.

Martin Hoefer, Daniel Vaz, Lisa Wagner

Artif. Intell., 2018

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs.

Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz

Proceedings of the Approximation, 2018

2017

Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs.

Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set.

Parinya Chalermsook, Daniel Vaz

Electron. Notes Discret. Math., 2016

New Integrality Gap Results for the Firefighters Problem on Trees.

Parinya Chalermsook, Daniel Vaz

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015

Representation of the non-dominated set in biobjective discrete optimization.

Daniel Vaz, Luís Paquete, Carlos M. Fonseca, Kathrin Klamroth, Michael Stiglmayr

Comput. Oper. Res., 2015

Hedonic Coalition Formation in Networks.

Martin Hoefer, Daniel Vaz, Lisa Wagner

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013

A note on the ϵ-indicator subset selection.

Daniel Vaz, Luís Paquete, Aníbal Ponte

Theor. Comput. Sci., 2013