A note on the ϵ-indicator subset selection. - Daniel Vaz 001; Luís Paquete; Aníbal Ponte (Theor. Comput. Sci., 2013)

Hedonic Coalition Formation in Networks. - Martin Hoefer 001; Daniel Vaz 001; Lisa Wagner (AAAI, 2015)

Representation of the non-dominated set in biobjective discrete optimization. - Daniel Vaz 001; Luís Paquete; Carlos M. Fonseca; Kathrin Klamroth; Michael Stiglmayr (Comput. Oper. Res., 2015)

New Integrality Gap Results for the Firefighters Problem on Trees. - Parinya Chalermsook; Daniel Vaz 001 (WAOA, 2016)

A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. - Parinya Chalermsook; Daniel Vaz 001 (Electron. Notes Discret. Math., 2016)

Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. - Parinya Chalermsook; Syamantak Das; Bundit Laekhanukit; Daniel Vaz 001 (SODA, 2017)

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. - Parinya Chalermsook; Syamantak Das; Guy Even; Bundit Laekhanukit; Daniel Vaz 001 (APPROX-RANDOM, 2018)

Dynamics in matching and coalition formation games with structural constraints. - Martin Hoefer 001; Daniel Vaz 001; Lisa Wagner (Artif. Intell., 2018)

Mimicking Networks Parameterized by Connectivity. - Parinya Chalermsook; Syamantak Das; Bundit Laekhanukit; Daniel Vaz 001 (CoRR, 2019)

Approximation algorithms for network design and cut problems in bounded-treewidth. - Daniel Vaz 001 (2020)

Vertex Sparsification for Edge Connectivity. - Parinya Chalermsook; Syamantak Das; Yunbum Kook; Bundit Laekhanukit; Yang P. Liu; Richard Peng; Mark Sellke; Daniel Vaz 001 (SODA, 2021)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. - Antonios Antoniadis 001; Sándor Kisfaludi-Bak; Bundit Laekhanukit; Daniel Vaz 001 (SWAT, 2022)

On Approximating Degree-Bounded Network Design Problems. - Xiangyu Guo; Guy Kortsarz; Bundit Laekhanukit; Shi Li 001; Daniel Vaz 001; Jiayi Xian (Algorithmica, 2022)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. - Syamantak Das; Nikhil Kumar 001; Daniel Vaz 001 (MFCS, 2024)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. - Parinya Chalermsook; Matthias Kaul; Matthias Mnich; Joachim Spoerhase; Sumedha Uniyal; Daniel Vaz 001 (ACM Trans. Algorithms, 2024)

Broadcasting Under Structural Restrictions. - Yudai Egami; Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)

Parameterized Spanning Tree Congestion. - Michael Lampis; Valia Mitsou; Edouard Nemery; Yota Otachi; Manolis Vasilakis; Daniel Vaz 001 (MFCS, 2025)