Hung Le - RankMe

91 papers A* 31A 2B 1Misc 1Journal 55Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Polynomial Coreset for Furthest Neighbor in Planar Metrics. CoRR Kacper Kluk, Hung Le, Wojciech Nadara, Marcin Pilipczuk, Hector Tierno, Vinayak
2026	A*	`conf`	Approximate Light Spanners in Planar Graphs. SODA Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2026	J	`jnl`	Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher. CoRR Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2026	A*	`conf`	Covering the Euclidean Plane by a Pair of Trees. SODA Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang
2026	J	`jnl`	Optimal Euclidean Tree Covers. Discret. Comput. Geom. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2025	J	`jnl`	A Tight Lower Bound for Doubling Spanners. CoRR An La, Hung Le, Shay Solomon, Cuong Than, Vinayak, Shuang Yang, Tianyi Zhang
2025	J	`jnl`	A Unified Framework of Light Spanners I: Fast (Yet Optimal) Constructions. SIAM J. Comput. Hung Le, Shay Solomon
2025	J	`jnl`	Approximate Light Spanners in Planar Graphs. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2025	J	`jnl`	Approximating Euclidean Shallow-Light Trees. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2025	J	`jnl`	Covering the Euclidean Plane by a Pair of Trees. CoRR Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang
2025	A*	`conf`	Dynamic Locality Sensitive Orderings in Doubling Metrics. STOC An La, Hung Le
2025	A*	`conf`	Embedding Planar Graphs into Graphs of Treewidth SODA Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk
2025	A*	`conf`	Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. STOC Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than
2025	J	`jnl`	Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than
2025	J	`jnl`	Metric Sketching and Dynamic Algorithms for Geometric and Topological Graphs (Dagstuhl Seminar 25212). Dagstuhl Reports Sujoy Bhore, Jie Gao, Hung Le, Csaba D. Tóth, Lazar Milenkovic
2025	J	`jnl`	Optimal Padded Decomposition For Bounded Treewidth Graphs. TheoretiCS Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif
2025	A*	`conf`	Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. SODA Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
2025	J	`jnl`	Tree-Like Shortcuttings of Trees. CoRR Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2025	J	`jnl`	Truly Optimal Euclidean Spanners. SIAM J. Comput. Hung Le, Shay Solomon
2025	A*	`conf`	Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. FOCS Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2025	J	`jnl`	Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension. CoRR Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
2024	J	`jnl`	Computing Diameter+2 in Truly Subquadratic Time for Unit-Disk Graphs. CoRR Hsien-Chih Chang, Jie Gao, Hung Le
2024	A*	`conf`	Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs. SoCG Hsien-Chih Chang, Jie Gao, Hung Le
2024	J	`jnl`	Dynamic Locality Sensitive Orderings in Doubling Metrics. CoRR An La, Hung Le
2024	J	`jnl`	Embedding Planar Graphs into Graphs of Treewidth O(log CoRR Hsien-Chih Chang, Vincent Cohen-Addad, Jonathan Conroy, Hung Le, Marcin Pilipczuk, Michal Pilipczuk
2024	J	`jnl`	Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. ACM Trans. Algorithms Hung Le, Cuong Than
2024	J	`jnl`	New weighted additive spanners. CoRR An La, Hung Le
2024	A*	`conf`	Optimal Euclidean Tree Covers. SoCG Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	J	`jnl`	Optimal Euclidean Tree Covers. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	J	`jnl`	Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif
2024	A*	`conf`	Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. SODA Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	J	`jnl`	Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
2024	A*	`conf`	Towards Instance-Optimal Euclidean Spanners. FOCS Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2024	J	`jnl`	Towards Instance-Optimal Euclidean Spanners. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2024	A*	`conf`	VC Set Systems in Minor-free (Di)Graphs and Applications. SODA Hung Le, Christian Wulff-Nilsen
2023	A*	`conf`	A Unified Framework for Light Spanners. STOC Hung Le, Shay Solomon
2023	A*	`conf`	Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency. SODA Hung Le
2023	A*	`conf`	Covering Planar Metrics (and Beyond): O(1) Trees Suffice. FOCS Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	J	`jnl`	Covering Planar Metrics (and Beyond): O(1) Trees Suffice. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	A*	`conf`	Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. FOCS Hung Le, Shay Solomon, Cuong Than
2023	J	`jnl`	Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier. CoRR Hung Le, Shay Solomon, Cuong Than
2023	A*	`conf`	Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. FOCS Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk
2023	J	`jnl`	Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. CoRR Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk
2023	J	`jnl`	Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	J	`jnl`	Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	A*	`conf`	Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. SoCG Hung Le, Lazar Milenkovic, Shay Solomon
2023	J	`jnl`	VC Set Systems in Minor-free (Di)Graphs and Applications. CoRR Hung Le, Christian Wulff-Nilsen
2022	J	`jnl`	Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency. CoRR Hung Le
2022	A*	`conf`	Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. PODC Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon
2022	A	`conf`	Dynamic Matching Algorithms Under Vertex Updates. ITCS Hung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams
2022	A*	`conf`	Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. SODA Hung Le, Cuong Than
2022	A*	`conf`	Locality-sensitive orderings and applications to reliable spanners. STOC Arnold Filtser, Hung Le
2022	A*	`conf`	Low Treewidth Embeddings of Planar and Minor-Free Metrics. FOCS Arnold Filtser, Hung Le
2022	J	`jnl`	Low Treewidth Embeddings of Planar and Minor-Free Metrics. CoRR Arnold Filtser, Hung Le
2022	A*	`conf`	Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. SODA Hung Le, Shay Solomon
2022	A*	`conf`	Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. SoCG Hung Le, Lazar Milenkovic, Shay Solomon
2022	J	`jnl`	Tuning the Tail Latency of Distributed Queries Using Replication. CoRR Nathan Ng, Hung Le, Marco Serafini
2021	J	`jnl`	A Unified Framework of Light Spanners II: Fine-Grained Optimality. CoRR Hung Le, Shay Solomon
2021	J	`jnl`	Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. CoRR Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon
2021	J	`jnl`	Clan Embeddings into Trees, and Low Treewidth Graphs. CoRR Arnold Filtser, Hung Le
2021	A*	`conf`	Clan embeddings into trees, and low treewidth graphs. STOC Arnold Filtser, Hung Le
2021	J	`jnl`	Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. CoRR Hung Le, Cuong Than
2021	J	`jnl`	Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. CoRR Hung Le, Shay Solomon
2021	A*	`conf`	Optimal Approximate Distance Oracle for Planar Graphs. FOCS Hung Le, Christian Wulff-Nilsen
2021	J	`jnl`	Optimal Approximate Distance Oracle for Planar Graphs. CoRR Hung Le, Christian Wulff-Nilsen
2021	J	`jnl`	Reliable Spanners: Locality-Sensitive Orderings Strike Back. CoRR Arnold Filtser, Hung Le
2021	J	`jnl`	Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. CoRR Hung Le, Lazar Milenkovic, Shay Solomon
2021	J	`jnl`	Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions. CoRR Hung Le, Shay Solomon
2020	A*	`conf`	A PTAS for subset TSP in minor-free graphs. SODA Hung Le
2020	J	`jnl`	A Unified and Fine-Grained Approach for Light Spanners. CoRR Hung Le, Shay Solomon
2020	A	`conf`	Light Euclidean Spanners with Steiner Points. ESA Hung Le, Shay Solomon
2020	J	`jnl`	Light Euclidean Spanners with Steiner Points. CoRR Hung Le, Shay Solomon
2020	J	`jnl`	Local search is a PTAS for feedback vertex set in minor-free graphs. Theor. Comput. Sci. Hung Le, Baigong Zheng
2020	A*	`conf`	On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. FOCS Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le
2020	J	`jnl`	On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. CoRR Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le
2019	Misc	`conf`	A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs. COCOON Hung Le, Baigong Zheng
2019	—	`conf`	Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs. SEA² Glencora Borradaile, Hung Le, Baigong Zheng
2019	A*	`conf`	Greedy spanners are optimal in doubling metrics. SODA Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
2019	A*	`conf`	Truly Optimal Euclidean Spanners. FOCS Hung Le, Shay Solomon
2019	J	`jnl`	Truly Optimal Euclidean Spanners. CoRR Hung Le, Shay Solomon
2018	J	`jnl`	A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph. Graphs Comb. Hung Le
2018	J	`jnl`	Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs. CoRR Glencora Borradaile, Hung Le, Baigong Zheng
2018	J	`jnl`	Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs. CoRR Hung Le, Baigong Zheng
2017	J	`jnl`	Embedded-width: A variant of treewidth for plane graphs. CoRR Glencora Borradaile, Jeff Erickson, Hung Le, Robbie Weber
2017	J	`jnl`	Greedy spanners are optimal in doubling metrics. CoRR Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
2017	J	`jnl`	Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph. Graphs Comb. Glencora Borradaile, Hung Le, Melissa Sherman-Bennett
2017	J	`jnl`	Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs. CoRR Glencora Borradaile, Hung Le
2017	A*	`conf`	Minor-Free Graphs Have Light Spanners. FOCS Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
2017	J	`jnl`	Minor-free graphs have light spanners. CoRR Glencora Borradaile, Hung Le, Christian Wulff-Nilsen
2016	B	`conf`	Optimal Dynamic Program for r-Domination Problems over Tree Decompositions. IPEC Glencora Borradaile, Hung Le
2015	J	`jnl`	Optimal dynamic program for r-domination problems over tree decompositions. CoRR Glencora Borradaile, Hung Le