Scholar
Daniel Vaz
Google Scholar ID: wnXvPkAAAAAJ
LIGM-ADA and ESIEE Paris
Citations & Impact
Citations
126
H-index
6
i10-index
3
Publications
20
Co-authors
0
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- Published several papers, including 'Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs' (2024), 'Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter' (2024), 'On the Approximability of the Traveling Salesman Problem with Line Neighborhoods' (2022), and more.
Research Experience
- Currently an assistant professor (enseignant-chercheur) at ESIEE Paris and a member of the LIGM research lab at Université Gustave Eiffel. Previously, he was a postdoc in Paris (LAMSADE, DI-ENS & IRIF) and Munich (OR-TUM).
Education
- PhD in Theoretical Computer Science from Saarland University and MPI Informatics in 2020, supervised by Parinya Chalermsook and Kurt Mehlhorn; MSc in Informatics Engineering from the University of Coimbra in 2013; BSc in Informatics Engineering from the University of Coimbra in 2011.
Background
- Research interests include approximation algorithms and parameterized complexity for network design and graph problems, as well as related areas such as online algorithms, hardness of approximation, and complexity theory.
Miscellany
- Contact: (first-name).ramosvaz@esiee.fr, Phone: 01 45 92 6061, Office: ESIEE, Bureau 5307, Address: 27 avenue André-Marie Ampère, 77420 Champs-sur-Marne, 2 boulevard Blaise Pascal, Cité Descartes, BP 99, 93162 Noisy-le-Grand Cedex
Co-authors