Jonathan Conroy
Orcid: 0009-0006-8487-9682
According to our database1,
Jonathan Conroy
authored at least 10 papers
between 2021 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2025
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
Embedding Planar Graphs into Graphs of Treewidth <i>O</i> (log<sup>3</sup> <i>n</i> ).
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions.
CoRR, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
2021
Proceedings of the IEEE International Conference on Robotics and Automation, 2021