Optimal Dynamic Program for r-Domination Problems over Tree Decompositions. - Glencora Borradaile; Hung Le 001 (IPEC, 2016)

Minor-Free Graphs Have Light Spanners. - Glencora Borradaile; Hung Le 001; Christian Wulff-Nilsen (FOCS, 2017)

Embedded-width: A variant of treewidth for plane graphs. - Glencora Borradaile; Jeff Erickson 001; Hung Le 001; Robbie Weber (CoRR, 2017)

Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs. - Glencora Borradaile; Hung Le 001 (CoRR, 2017)

Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph. - Glencora Borradaile; Hung Le 001; Melissa Sherman-Bennett (Graphs Comb., 2017)

Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs. - Glencora Borradaile; Hung Le 001; Baigong Zheng (CoRR, 2018)

A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph. - Hung Le 001 (Graphs Comb., 2018)

A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs. - Hung Le 001; Baigong Zheng (COCOON, 2019)

Truly Optimal Euclidean Spanners. - Hung Le 001; Shay Solomon (FOCS, 2019)

Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs. - Glencora Borradaile; Hung Le 001; Baigong Zheng (SEA², 2019)

Greedy spanners are optimal in doubling metrics. - Glencora Borradaile; Hung Le 001; Christian Wulff-Nilsen (SODA, 2019)

Light Euclidean Spanners with Steiner Points. - Hung Le 001; Shay Solomon (ESA, 2020)

On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. - Vincent Cohen-Addad; Arnold Filtser; Philip N. Klein; Hung Le 001 (FOCS, 2020)

A PTAS for subset TSP in minor-free graphs. - Hung Le 001 (SODA, 2020)

A Unified and Fine-Grained Approach for Light Spanners. - Hung Le 001; Shay Solomon (CoRR, 2020)

Local search is a PTAS for feedback vertex set in minor-free graphs. - Hung Le 001; Baigong Zheng (Theor. Comput. Sci., 2020)

Optimal Approximate Distance Oracle for Planar Graphs. - Hung Le 001; Christian Wulff-Nilsen (FOCS, 2021)

Clan embeddings into trees, and low treewidth graphs. - Arnold Filtser; Hung Le 001 (STOC, 2021)

Reliable Spanners: Locality-Sensitive Orderings Strike Back. - Arnold Filtser; Hung Le 001 (CoRR, 2021)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions. - Hung Le 001; Shay Solomon (CoRR, 2021)

A Unified Framework of Light Spanners II: Fine-Grained Optimality. - Hung Le 001; Shay Solomon (CoRR, 2021)

Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. - Hung Le 001; Lazar Milenkovic; Shay Solomon (SoCG, 2022)

Low Treewidth Embeddings of Planar and Minor-Free Metrics. - Arnold Filtser; Hung Le 001 (FOCS, 2022)

Dynamic Matching Algorithms Under Vertex Updates. - Hung Le 001; Lazar Milenkovic; Shay Solomon; Virginia Vassilevska Williams (ITCS, 2022)

Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. - Omri Kahalon; Hung Le 001; Lazar Milenkovic; Shay Solomon (PODC, 2022)

Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. - Hung Le 001; Shay Solomon (SODA, 2022)

Locality-sensitive orderings and applications to reliable spanners. - Arnold Filtser; Hung Le 001 (STOC, 2022)

Tuning the Tail Latency of Distributed Queries Using Replication. - Nathan Ng 002; Hung Le 001; Marco Serafini (CoRR, 2022)

Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. - Hung Le 001; Lazar Milenkovic; Shay Solomon (SoCG, 2023)

Covering Planar Metrics (and Beyond): O(1) Trees Suffice. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (FOCS, 2023)

Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. - Vincent Cohen-Addad; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (FOCS, 2023)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. - Hung Le 001; Shay Solomon; Cuong Than (FOCS, 2023)

Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency. - Hung Le 001 (SODA, 2023)

A Unified Framework for Light Spanners. - Hung Le 001; Shay Solomon (STOC, 2023)

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (CoRR, 2023)

Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs. - Hsien-Chih Chang; Jie Gao 001; Hung Le 001 (SoCG, 2024)

Optimal Euclidean Tree Covers. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SoCG, 2024)

Towards Instance-Optimal Euclidean Spanners. - Hung Le 001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 008 (FOCS, 2024)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SODA, 2024)

VC Set Systems in Minor-free (Di)Graphs and Applications. - Hung Le 001; Christian Wulff-Nilsen (SODA, 2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs. - Arnold Filtser; Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Hung Le 001; Nadym Mallek; Ziena Zeif (CoRR, 2024)

New weighted additive spanners. - An La; Hung Le 001 (CoRR, 2024)

Embedding Planar Graphs into Graphs of Treewidth O(log3 n). - Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2024)

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. - Hung Le 001; Cuong Than (ACM Trans. Algorithms, 2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. - Sujoy Bhore; Balázs Keszegh; Andrey Kupavskii; Hung Le 001; Alexandre Louvet; Dömötör Pálvölgyi; Csaba D. Tóth (SODA, 2025)

Embedding Planar Graphs into Graphs of Treewidth O (log3 n ). - Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2025)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Shay Solomon; Cuong Than (STOC, 2025)

Dynamic Locality Sensitive Orderings in Doubling Metrics. - An La; Hung Le 001 (STOC, 2025)

Approximate Light Spanners in Planar Graphs. - Hung Le 001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 008 (CoRR, 2025)

Covering the Euclidean Plane by a Pair of Trees. - Hung Le 001; Lazar Milenkovic; Shay Solomon; Tianyi Zhang 008 (CoRR, 2025)

A Tight Lower Bound for Doubling Spanners. - An La; Hung Le 001; Shay Solomon; Cuong Than; Vinayak; Shuang Yang; Tianyi Zhang 008 (CoRR, 2025)