Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
(2024)
with
Syamantak Das and
Nikhil Kumar
MFCS 2024
Daniel Vaz
I am an assistant professor (enseignant-chercheur) at ESIEE Paris and a member of the research lab LIGM at Université Gustave Eiffel.
Before, I was a postdoc in Paris (LAMSADE, DI-ENS & IRIF) and Munich (OR-TUM).
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, and I am also interested in related areas, such as online algorithms, hardness of approximation and complexity theory.