Publications

You can also find my articles on my Google Scholar profile.

Conference Papers

2027

• SODA 2027 Improved Euclidean Shallow-Light Trees
  Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
  PDF · Details

2026

• SoCG 2026 Tree-Like Shortcuttings of Trees
  H Le, S Solomon, L Milenkovic and C Than
  Invited to the SoCG 2026 special issue of Discrete & Computational Geometry.
  PDF · Details
• SoCG 2026 Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
  A La, H Le, S Solomon, C Than, Vinayak, S Yang and T Zhang
  Invited to the SoCG 2026 special issue of Discrete & Computational Geometry.
  PDF · Details
• SoCG 2026 Approximating Euclidean Shallow-Light Trees
  H Le, S Solomon, C Than, C Tóth and T Zhang
  PDF · Details
• SODA 2026 Approximate Light Spanners in Planar Graphs
  H Le, S Solomon, C Than, C Toth, T Zhang
  PDF · Details

2025

• STOC 2025 Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs
  HC Chang, J Conroy, H Le, S Solomon, C Than
  PDF · Details

2024

• FSTTCS 2024 Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model
  Christian Konrad, Andrew McGregor, Rik Sengupta and Cuong Than
  PDF · Details
• FOCS 2024 Towards Instance-Optimal Euclidean Spanners
  Hung Le, Shay Solomon, Cuong Than, Csaba D. Toth, Tianyi Zhang
  PDF · Details
• SODA 2024 Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more
  HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than
  PDF · Details
• SoCG 2024 Optimal Euclidean Tree Covers
  Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
  Journal version: Discrete & Computational Geometry, 75(2):625–659.
  PDF · Details

2023

• FOCS 2023 Covering Planar Metrics (and Beyond): O(1) Trees Suffice
  HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than
  PDF · Details
• FOCS 2023 Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier
  H Le, S Solomon, C Than
  PDF · Details

2022

• SODA 2022 Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
  H Le, C Than
  Journal version: ACM Transactions on Algorithms (TALG).
  PDF · Details

2020

• AAMAS 2020 Schelling Models with Localized Social Influence: A Game-Theoretic Framework
  H Chan, M Irfan and C Than
  PDF · Details

2018

• ACDT 2018 An O (n√ n log log n) average case algorithm for the maximum induced matching problem in permutation graphs
  C Than, T Do
  PDF · Details

Journal Papers

• DCG Optimal Euclidean Tree Covers
  Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
  Discrete & Computational Geometry, 75(2):625–659. Conference version: SoCG 2024.
  PDF · Details
• TALG Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
  H Le, C Than
  ACM Transactions on Algorithms (TALG). Conference version: SODA 2022.
  PDF · Details
• IOI J. Latest Algorithms on Particular Graph Classes
  T Do, T Pham, C Than
  Olympiads in Informatics (IOI Journal)
  PDF · Details

Preprints

• arXiv 2026 Three Trees Suffice for a Constant Stretch in Minor-Free Graphs
  Hung Le, Huy Pham, Cuong Than, Tuan Tran
  PDF · Details
• arXiv 2023 Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions
  Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenković, Shay Solomon, Cuong Than
  PDF · Details