Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter

Publication
Submitted
Daniel Vaz
Daniel Vaz
Postdoc

My research centers around approximation algorithms for network design and other graph problems.