Publications

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
On Approximating Degree-Bounded Network Design Problems
Vertex Sparsification for Edge Connectivity
On Approximating Degree-Bounded Network Design Problems
Mimicking Networks Parameterized by Connectivity
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
Representation of the non-dominated set in biobjective discrete optimization
Hedonic Coalition Formation in Networks
A note on the epsilon-indicator subset selection