Daniel Vaz

Daniel Vaz



I am currently a postdoc at the research lab LAMSADE at Université Paris Dauphine–PSL. Previously, I was a postdoc at DI-ENS and IRIF in 2022-2023, and at the OR Group of TU Munich, in 2019-2022 . I completed my PhD at the Max Planck Institut for Informatics, in Saarbrücken, under the supervision of Parinya Chalermsook and Kurt Mehlhorn.

My research centers around approximation algorithms and parameterized complexity for network design and graph problems. I am also interested in related areas of theoretical computer science, such as online algorithms, hardness of approximation and complexity theory.

  • Approximation Algorithms
  • Graph Theory
  • Parameterized Complexity
  • Combinatorial Optimization
  • PhD in Theoretical Computer Science, 2020

    Max Planck Institut for Informatics

  • MSc in Informatics Engineering, 2013

    University of Coimbra

  • BSc in Informatics Engineering, 2011

    University of Coimbra

Recent Publications

Full list here or on dblp

(2023). Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. ACM Transactions on Algorithms.

Preprint Cite DOI arXiv

(2022). On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT 2022.

PDF Cite DOI arXiv

(2022). On Approximating Degree-Bounded Network Design Problems. Algorithmica.

Preprint Cite DOI

(2021). Vertex Sparsification for Edge Connectivity. SODA 2021.

Preprint PDF Cite DOI arXiv

(2020). On Approximating Degree-Bounded Network Design Problems. APPROX/RANDOM 2020.

PDF Cite DOI arXiv


Full details here

Lectures and Student Seminars

Organization and Teaching Assistant

Tutorial Classes


  • (first-name).ramos-(last-name) (at) dauphine.psl.eu
    Université Paris Dauphine - PSL
    Place du Maréchal de Lattre de Tassigny
    75016 Paris, France
  • By appointment