Jonathan Conroy

According to our database, Jonathan Conroy authored at least 5 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Optimal Euclidean Tree Covers.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

CoRR, 2024

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

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

CoRR, 2023

Covering Planar Metrics (and Beyond): O(1) Trees Suffice.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2021

Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection.

Jonathan Conroy, Christopher Thierauf, Parker Rule, Evan A. Krause, Hugo Alves Akitaya, Andrei Gonczi, Matias Korman, Matthias Scheutz

Proceedings of the IEEE International Conference on Robotics and Automation, 2021