Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection. - Jonathan Conroy; Christopher Thierauf; Parker Rule; Evan A. Krause; Hugo A. Akitaya; Andrei Gonczi; Matias Korman; Matthias Scheutz (ICRA, 2021)

Hop-spanners for geometric intersection graphs. - Jonathan B. Conroy; Csaba D. Tóth (J. Comput. Geom., 2022)

Covering Planar Metrics (and Beyond): O(1) Trees Suffice. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (FOCS, 2023)

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (CoRR, 2023)

Optimal Euclidean Tree Covers. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SoCG, 2024)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SODA, 2024)

Embedding Planar Graphs into Graphs of Treewidth O(log3 n). - Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2024)

Embedding Planar Graphs into Graphs of Treewidth O (log3 n ). - Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2025)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Shay Solomon; Cuong Than (STOC, 2025)

How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs. - Jonathan Conroy; Arnold Filtser (STOC, 2025)