Hop-spanners for geometric intersection graphs

Συγγραφείς: Jonathan Conroy, Csaba Tóth

Πηγή: Journal of Computational Geometry, Vol 14, Iss 2 (2023)

Θεματικοί όροι: Computer software, QA76.75-76.765, Analysis, QA299.6-433

Περιγραφή αρχείου: electronic resource

Relation: https://jocg.org/index.php/jocg/article/view/4475; https://doaj.org/toc/1920-180X

Σύνδεσμος πρόσβασης: https://doaj.org/article/d19979e1e79047ab8a3e581b34aa2ff3

Optimal Euclidean Tree Covers

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Lazar Milenkovic, Shay Solomon, Cuong Than

Συνεισφορές: Hsien-Chih Chang and Jonathan Conroy and Hung Le and Lazar Milenković and Shay Solomon and Cuong Than

Πηγή: Discrete & Computational Geometry. 75:625-659

Θεματικοί όροι: spanner, Computational Geometry (cs.CG), FOS: Computer and information sciences, Tree cover, quadtree, routing, bounded-degree, Computer Science - Computational Geometry, Steiner point, net-tree

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2403.17754
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.37

Distance Approximating Minors for Planar and Minor-Free Graphs

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy

Πηγή: 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS). :734-754

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Computational Geometry, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2509.17226

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

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Shay Solomon, Cuong Than

Πηγή: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :2257-2268

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2503.22669

How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs

Συγγραφείς: Jonathan Conroy, Arnold Filtser

Πηγή: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :2281-2292

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2504.00278

DAG Covers: The Steiner Point Effect

Συγγραφείς: Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin Oh, Nicole Wein, Da Wei Zheng

Πηγή: CoRR.

Θεματικοί όροι: FOS: Computer and information sciences, Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2604.04186
https://arxiv.org/abs/2604.04186

Dynamic Light Spanners in Doubling Metrics

Συγγραφείς: Sujoy Bhore, Jonathan Conroy, Arnold Filtser

Πηγή: CoRR.

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Data Structures and Algorithms, Computational Geometry, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2603.23490
https://arxiv.org/abs/2603.23490

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

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Lazar Milenkovic, Shay Solomon, Cuong Than

Πηγή: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2306.06215

Embedding Planar Graphs into Graphs of Treewidth O (log3 n )

Συγγραφείς: Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le 0001, Marcin Pilipczuk, Michal Pilipczuk

Πηγή: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611978322
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2411.00216

O(1)-Distortion Planar Emulators for String Graphs

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy, Zihan Tan, Da Wei Zheng

Πηγή: CoRR.

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Combinatorics, Metric Geometry, FOS: Mathematics, Computational Geometry, Data Structures and Algorithms (cs.DS), Metric Geometry (math.MG), Combinatorics (math.CO)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2510.21700

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

Πηγή: 2021 IEEE International Conference on Robotics and Automation (ICRA). :7795-7801

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Robotics, 0209 industrial biotechnology, 02 engineering and technology, Robotics (cs.RO)

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/2104.02913
http://arxiv.org/abs/2104.02913
https://arxiv.org/abs/2104.02913

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

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Lazar Milenkovic, Shay Solomon, Cuong Than

Πηγή: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2308.00555

Optimal Euclidean Tree Covers

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, Cuong Than

Πηγή: Proceedings of the 40th International Symposium on Computational Geometry (SoCG 2024)

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

Συγγραφείς: Hsien-Chih Chang, Jonathan Conroy, Hung Le 0001, Lazar Milenkovic, Shay Solomon, Cuong Than

Πηγή: CoRR.

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS)

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2306.06235

Clustering in Varying Metrics

Additional Titles: We introduce the aggregated clustering problem, where one is given T instances of a center-based clustering task over the same n points, but under different metrics. The goal is to open k centers to minimize an aggregate of the clustering costs - e.g., the average or maximum - where the cost is measured via k-center/median/means objectives. More generally, we minimize a norm Ψ over the T cost values. We show that for T ≥ 3, the problem is inapproximable to any finite factor in polynomial time. For T = 2, we give constant-factor approximations. We also show W[2]-hardness when parameterized by k, but obtain f(k,T)poly(n)-time 3-approximations when parameterized by both k and T. When the metrics have structure, we obtain efficient parameterized approximation schemes (EPAS). If all T metrics have bounded ε-scatter dimension, we achieve a (1+ε)-approximation in f(k,T,ε)poly(n) time. If the metrics are induced by edge weights on a common graph G of bounded treewidth tw, and Ψ is the sum function, we get an EPAS in f(T,ε,tw)poly(n,k) time. Conversely, unless (randomized) ETH is false, any finite factor approximation is impossible if parametrized by only T, even when the treewidth is tw = Ω(polylog n).

Συγγραφείς: Deeparnab Chakrabarty and Jonathan Conroy and Ankita Sarkar, Chakrabarty, Deeparnab, Conroy, Jonathan, Sarkar, Ankita

Όροι ευρετηρίου: Clustering, approximation algorithms, LP rounding, parameterized and exact algorithms, dynamic programming, fixed parameter tractability, hardness of approximation, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

Σύνδεσμος: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.19
Is Part Of LIPIcs, Volume 360, 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025)

The effects of prior knowledge on hearing impaired students' ability to answer text-explicit, text-implicit, and script-implicit comprehension questions /

Συγγραφείς: Smith, Jonathan Conroy

Πηγή: http://rave.ohiolink.edu/etdc/view?acc_num=osu1755792154180749.

Relation: http://rave.ohiolink.edu/etdc/view?acc_num=osu1755792154180749

Διαθεσιμότητα: http://rave.ohiolink.edu/etdc/view?acc_num=osu1755792154180749

DAG Covers for Structured Graphs: The Steiner Point Effect

Συγγραφείς: Bhore, Sujoy, Chang, Hsien-Chih, Conroy, Jonathan, Filtser, Arnold, Oh, Eunjin, Wein, Nicole, Zheng, Da Wei

Συνεισφορές: Sujoy Bhore and Hsien-Chih Chang and Jonathan Conroy and Arnold Filtser and Eunjin Oh and Nicole Wein and Da Wei Zheng

Θεματικοί όροι: Directed graphs, DAG (directed acyclic graphs), distortion, metric embeddings, planar graph, treewidth

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 388, 34th Annual European Symposium on Algorithms (ESA 2026); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.94

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.ESA.2026.94
https://nbn-resolving.org/urn:nbn:de:0030-drops-272306
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.94

Dynamic Light Spanners in Doubling Metrics

Συγγραφείς: Bhore, Sujoy, Conroy, Jonathan, Filtser, Arnold

Συνεισφορές: Sujoy Bhore and Jonathan Conroy and Arnold Filtser

Θεματικοί όροι: Dynamic data structures, spanners, light-weight, Euclidean metrics, doubling metrics

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 367, 42nd International Symposium on Computational Geometry (SoCG 2026); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.13

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.SoCG.2026.13
https://nbn-resolving.org/urn:nbn:de:0030-drops-258193
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.13

Clustering in Varying Metrics

Συγγραφείς: Chakrabarty, Deeparnab, Conroy, Jonathan, Sarkar, Ankita

Συνεισφορές: Deeparnab Chakrabarty and Jonathan Conroy and Ankita Sarkar

Θεματικοί όροι: Clustering, approximation algorithms, LP rounding, parameterized and exact algorithms, dynamic programming, fixed parameter tractability, hardness of approximation

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 360, 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.19

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.FSTTCS.2025.19
https://nbn-resolving.org/urn:nbn:de:0030-drops-251007
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.19