research
∙
07/31/2023
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
The notion of shortcut partition, introduced recently by Chang, Conroy, ...
share
research
∙
06/09/2023
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions
Recently the authors [CCLMST23] introduced the notion of shortcut partit...
research
∙
06/09/2023
Covering Planar Metrics (and Beyond): O(1) Trees Suffice
While research on the geometry of planar graphs has been active in the p...
research
∙
12/16/2021
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound
In STOC'95 [ADMSS'95] Arya et al. showed that any set of n points in ℝ^d...
research
∙
07/29/2021
