24 citations · 67 across the 14 of their papers we have counts for
4 papers · 1 filter
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy
Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy +2
Let be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if is self-overlapping by geometrically constructing a combinatorial word fro…
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
Hsien-Chih Chang, Jonathan Conroy, Hung Le +3
The notion of shortcut partition, introduced recently by Chang, Conroy, Le, Milenković, Solomon, and Than [CCLMST23], is a new type of graph partition into low-diameter clusters. R…
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions
Hsien-Chih Chang, Jonathan Conroy, Hung Le +3
Recently the authors [CCLMST23] introduced the notion of shortcut partition of planar graphs and obtained several results from the partition, including a tree cover with tre…
Covering Planar Metrics (and Beyond): O(1) Trees Suffice
Hsien-Chih Chang, Jonathan Conroy, Hung Le +3
While research on the geometry of planar graphs has been active in the past decades, many properties of planar metrics remain mysterious. This paper studies a fundamental aspect of…