Jonathan Conroy

most citedShortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2024

Embedding Planar Graphs into Graphs of Treewidth $O (lo g^{3} n)$

Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy +3

Cohen-Addad, Le, Pilipczuk, and Pilipczuk [CLPP23] recently constructed a stochastic embedding with expected $1 + ε$ distortion of $n$ -vertex planar graphs (with polynomial…

cs.DS2023★ 1 cited

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…

Embedding Planar Graphs into Graphs of Treewidth O(log3n)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More

Embedding Planar Graphs into Graphs of Treewidth $O (lo g^{3} n)$