default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Conroy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c10]Hsien-Chih Chang, Jonathan Conroy:
Distance Approximating Minors for Planar and Minor-Free Graphs. FOCS 2025: 734-754- [c9]Deeparnab Chakrabarty, Jonathan Conroy, Ankita Sarkar:
Clustering in Varying Metrics. FSTTCS 2025: 19:1-19:21 - [c8]Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy
, Hung Le, Marcin Pilipczuk, Michal Pilipczuk:
Embedding Planar Graphs into Graphs of Treewidth O (log3 n ). SODA 2025: 88-123 - [c7]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than:
Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. STOC 2025: 2257-2268 - [c6]Jonathan Conroy, Arnold Filtser:
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs. STOC 2025: 2281-2292 - [i12]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than:
Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. CoRR abs/2503.22669 (2025) - [i11]Jonathan Conroy, Arnold Filtser:
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs. CoRR abs/2504.00278 (2025) - [i10]Hsien-Chih Chang, Jonathan Conroy:
Distance Approximating Minors for Planar and Minor-Free Graphs. CoRR abs/2509.17226 (2025) - [i9]Deeparnab Chakrabarty, Jonathan Conroy, Ankita Sarkar:
Clustering in Varying Metrics. CoRR abs/2510.07860 (2025) - [i8]Hsien-Chih Chang, Jonathan Conroy, Zihan Tan, Da Wei Zheng:
O(1)-Distortion Planar Emulators for String Graphs. CoRR abs/2510.21700 (2025) - 2024
- [c5]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. SoCG 2024: 37:1-37:15 - [c4]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. SODA 2024: 5300-5331 - [i7]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. CoRR abs/2403.17754 (2024) - [i6]Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk:
Embedding Planar Graphs into Graphs of Treewidth O(log3 n). CoRR abs/2411.00216 (2024) - 2023
- [c3]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. FOCS 2023: 2231-2261 - [i5]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. CoRR abs/2306.06215 (2023) - [i4]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. CoRR abs/2306.06235 (2023) - [i3]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. CoRR abs/2308.00555 (2023) - 2022
- [j1]Jonathan B. Conroy, Csaba D. Tóth:
Hop-spanners for geometric intersection graphs. J. Comput. Geom. 14(2): 26-64 (2022) - [c2]Jonathan B. Conroy, Csaba D. Tóth:
Hop-Spanners for Geometric Intersection Graphs. SoCG 2022: 30:1-30:17 - 2021
- [c1]Jonathan Conroy, Christopher Thierauf, Parker Rule, Evan A. Krause, Hugo A. Akitaya, Andrei Gonczi, Matias Korman, Matthias Scheutz:
Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection. ICRA 2021: 7795-7801 - [i2]Jonathan Conroy, Christopher Thierauf, Parker Rule, Evan A. Krause, Hugo A. Akitaya, Andrei Gonczi, Matias Korman, Matthias Scheutz:
Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection. CoRR abs/2104.02913 (2021) - [i1]Jonathan B. Conroy, Csaba D. Tóth:
Hop-Spanners for Geometric Intersection Graphs. CoRR abs/2112.07158 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-18 23:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
