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 2025Show all

3 papers · 1 filter

cs.DS2025

Cutting Planarians: Planar Emulators for String Graphs

Hsien-Chih Chang, Jonathan Conroy, Zihan Tan +1

In this paper we construct distance sketches for intersection graphs of arbitrary path-connected regions in the plane (known as the string graphs) in the constant and $1+\varepsilo…

cs.DS2025

Distance Approximating Minors for Planar and Minor-Free Graphs

Hsien-Chih Chang, Jonathan Conroy

Given an edge-weighted graph $G$ and a subset of vertices $T$ called terminals, an $α$ -distance-approximating minor ( $α$ -DAM) of $G$ is a graph minor $H$ of $G$ that contains all t…

cs.DS2025

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs

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

A $(1 + ε)$ -stretch tree cover of an edge-weighted $n$ -vertex graph $G$ is a collection of trees, where every pair of vertices has a $(1 + ε)$ -stretch path in one o…