Daniel Vaz
Daniel Vaz
Operations Research Group @ TU Munich
Verified email at tum.de - Homepage
Cited by
Cited by
Representation of the non-dominated set in biobjective discrete optimization
D Vaz, L Paquete, CM Fonseca, K Klamroth, M Stiglmayr
Computers & Operations Research 63, 172-186, 2015
Hedonic coalition formation in networks
M Hoefer, D Vaz, L Wagner
Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015
Dynamics in matching and coalition formation games with structural constraints
M Hoefer, D Vaz, L Wagner
Artificial Intelligence 262, 222-247, 2018
A note on the ϵ-indicator subset selection
D Vaz, L Paquete, A Ponte
Theoretical Computer Science 499, 113-116, 2013
Beyond metric embedding: Approximating group steiner trees on bounded treewidth graphs
P Chalermsook, S Das, B Laekhanukit, D Vaz
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
New integrality gap results for the firefighters problem on trees
P Chalermsook, D Vaz
International Workshop on Approximation and Online Algorithms, 65-77, 2016
Survivable network design for group connectivity in low-treewidth graphs
P Chalermsook, S Das, G Even, B Laekhanukit, D Vaz
arXiv preprint arXiv:1802.10403, 2018
A note on fractional coloring and the integrality gap of LP for maximum weight independent set
P Chalermsook, D Vaz
Electronic Notes in Discrete Mathematics 55, 113-116, 2016
Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
P Chalermsook, M Kaul, M Mnich, J Spoerhase, S Uniyal, D Vaz
arXiv preprint arXiv:2111.06299, 2021
Mimicking networks parameterized by connectivity
P Chalermsook, S Das, B Laekhanukit, D Vaz
arXiv preprint arXiv:1910.10665, 2019
Efficient paths by local search
L Paquete, JL Santos, DJ Vaz
Agra, Agostinho and Doostmohammadi, Mahdi (2011) A Polyhedral Study of Mixed …, 2011
Vertex sparsification for edge connectivity
P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ...
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
A Antoniadis, S Kisfaludi-Bak, B Laekhanukit, D Vaz
arXiv preprint arXiv:2008.12075, 2020
Approximation algorithms for network design and cut problems in bounded-treewidth
D Vaz
Saarländische Universitäts-und Landesbibliothek, 2020
On Approximating Degree-Bounded Network Design Problems
X Guo, G Kortsarz, B Laekhanukit, S Li, D Vaz, J Xian
arXiv preprint arXiv:1907.11404, 2019
The system can't perform the operation now. Try again later.
Articles 1–15