Daniel Vaz

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 18

Top Topics

Bounded Treewidth

Coalition Formation

Top Venues

Publications

Syamantak Das, Nikhil Kumar, Daniel Vaz
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. CoRR (2024)
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20 (1) (2024)
Syamantak Das, Nikhil Kumar, Daniel Vaz
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. MFCS (2024)
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian
On Approximating Degree-Bounded Network Design Problems. Algorithmica 84 (5) (2022)
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT (2022)
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR (2021)
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. SODA (2021)
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian
On Approximating Degree-Bounded Network Design Problems. APPROX-RANDOM (2020)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. CoRR (2020)
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR (2020)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz
Mimicking Networks Parameterized by Connectivity. CoRR (2019)
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR (2018)
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM (2018)
Martin Hoefer, Daniel Vaz, Lisa Wagner
Dynamics in matching and coalition formation games with structural constraints. Artif. Intell. 262 (2018)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA (2017)
Parinya Chalermsook, Daniel Vaz
New Integrality Gap Results for the Firefighters Problem on Trees. WAOA (2016)
Parinya Chalermsook, Daniel Vaz
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. Electron. Notes Discret. Math. 55 (2016)
Parinya Chalermsook, Daniel Vaz
New Integrality Gap Results for the Firefighters Problem on Trees. CoRR (2016)
Daniel Vaz, Luís Paquete, Carlos M. Fonseca, Kathrin Klamroth, Michael Stiglmayr
Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. 63 (2015)
Martin Hoefer, Daniel Vaz, Lisa Wagner
Hedonic Coalition Formation in Networks. AAAI (2015)
Daniel Vaz, Luís Paquete, Aníbal Ponte
A note on the ϵ-indicator subset selection. Theor. Comput. Sci. 499 (2013)