research
∙
05/31/2021
A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut
The (non-uniform) sparsest cut problem is the following graph-partitioni...
share
research
∙
09/10/2020
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs
Understanding the structure of minor-free metrics, namely shortest path ...
research
∙
09/01/2020
On the computational tractability of a geographic clustering problem arising in redistricting
Redistricting is the problem of dividing a state into a number k of regi...
research
∙
07/05/2020
New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut
The Sparsest Cut is a fundamental optimization problem that has been ext...
research
∙
01/21/2019
