6 citations · 6 across the 5 of their papers we have counts for
3 papers · 1 filter
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs
Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein +1
Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction sin…
On the computational tractability of a geographic clustering problem arising in redistricting
Vincent Cohen-Addad, Philip N. Klein, Dániel Marx
Redistricting is the problem of dividing a state into a number of regions, called districts. Voters in each district elect a representative. The primary criteria are: each dist…
New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut
Amir Abboud, Vincent Cohen-Addad, Philip N. Klein
The Sparsest Cut is a fundamental optimization problem that has been extensively studied. For planar inputs the problem is in and can be solved in time if all…