Jonathan Conroy

activity

20212026

most citedCovering Planar Metrics (and Beyond): O(1) Trees Suffice

2 citations · 4 across the 11 of their papers we have counts for

collaborators

Showing 2024Show 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.CG2024

Optimal Euclidean Tree Covers

Hsien-Chih Chang, Jonathan Conroy, Hung Le +3

A $(1 + ε) -stretch tree cover$ of a metric space is a collection of trees, where every pair of points has a $(1 + ε)$ -stretch path in one of the trees. The…

Embedding Planar Graphs into Graphs of Treewidth O(log3n)

Optimal Euclidean Tree Covers

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