default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHung Le 0001
Person information
- affiliation: University of Massachusetts Amherst, MA, USA
Other persons with the same name
- Hung Le — disambiguation page
- Hung Le 0002
![[0000-0002-3126-184X]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-3126-184X")
(aka: Thai Hung Le 0002, Hung Thai Le 0002) — Deakin University, Applied Artificial Intelligence Institute, Geelong, Australia (and 1 more) - Hung Le 0003 — Amazon (and 3 more)
Other persons with a similar name
- Le Xuan Hung (aka: Hung Le Xuan, Xuan Hung Le)
- Duc-Hung Le
- Hung Q. Le
- Hung T. Le
- Kim-Hung Le (aka: Kim Hung Le)
- Phi Hung Le
- Hung Van Le 0001 (aka: Van Hung Le 0001, Le Van Hung 0001) — Hanoi University of Mining and Geology, Faculty of Information Technology, Vietnam (and 1 more)
- Van-Hung Le 0002 — Tan Trao University, Faculty of Basic Science, Tuyen Quang, Vietnam (and 1 more)
- Hung Nguyen-Le
- Le-Hung Vu
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c31]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- [c30]Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth:
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. SODA 2025: 4292-4326 - 2024
- [j4]Hung Le, Cuong Than:
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. ACM Trans. Algorithms 20(3): 23 (2024) - [c29]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. SoCG 2024: 37:1-37:15 - [c28]Hsien-Chih Chang, Jie Gao, Hung Le:
Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs. SoCG 2024: 38:1-38:14 - [c27]Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. FOCS 2024: 1579-1609 - [c26]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 - [c25]Hung Le, Christian Wulff-Nilsen:
VC Set Systems in Minor-free (Di)Graphs and Applications. SODA 2024: 5332-5360 - [i37]Hsien-Chih Chang, Jie Gao, Hung Le:
Computing Diameter+2 in Truly Subquadratic Time for Unit-Disk Graphs. CoRR abs/2401.12881 (2024) - [i36]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. CoRR abs/2403.17754 (2024) - [i35]Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth:
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR abs/2404.05045 (2024) - [i34]Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif:
Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR abs/2407.12230 (2024) - [i33]An La, Hung Le:
Dynamic Locality Sensitive Orderings in Doubling Metrics. CoRR abs/2408.14617 (2024) - [i32]An La, Hung Le:
New weighted additive spanners. CoRR abs/2408.14638 (2024) - [i31]Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. CoRR abs/2409.08227 (2024) - [i30]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
- [c24]Hung Le, Lazar Milenkovic, Shay Solomon:
Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. SoCG 2023: 47:1-47:17 - [c23]Hung Le, Shay Solomon, Cuong Than:
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. FOCS 2023: 77-97 - [c22]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 - [c21]Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk:
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. FOCS 2023: 2262-2277 - [c20]Hung Le:
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency. SODA 2023: 1877-1904 - [c19]Hung Le, Shay Solomon:
A Unified Framework for Light Spanners. STOC 2023: 295-308 - [i29]Hung Le, Christian Wulff-Nilsen:
VC Set Systems in Minor-free (Di)Graphs and Applications. CoRR abs/2304.01790 (2023) - [i28]Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk:
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. CoRR abs/2304.07268 (2023) - [i27]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) - [i26]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) - [i25]Hung Le, Shay Solomon, Cuong Than:
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier. CoRR abs/2306.11226 (2023) - [i24]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
- [c18]Hung Le, Lazar Milenkovic, Shay Solomon:
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. SoCG 2022: 54:1-54:15 - [c17]Arnold Filtser, Hung Le:
Low Treewidth Embeddings of Planar and Minor-Free Metrics. FOCS 2022: 1081-1092 - [c16]Hung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams:
Dynamic Matching Algorithms Under Vertex Updates. ITCS 2022: 96:1-96:24 - [c15]Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon:
Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. PODC 2022: 151-162 - [c14]Hung Le, Cuong Than:
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. SODA 2022: 3287-3310 - [c13]Hung Le, Shay Solomon:
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. SODA 2022: 3332-3361 - [c12]Arnold Filtser, Hung Le:
Locality-sensitive orderings and applications to reliable spanners. STOC 2022: 1066-1079 - [i23]Arnold Filtser, Hung Le:
Low Treewidth Embeddings of Planar and Minor-Free Metrics. CoRR abs/2203.15627 (2022) - [i22]Hung Le:
Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency. CoRR abs/2207.05659 (2022) - [i21]Nathan Ng, Hung Le, Marco Serafini:
Tuning the Tail Latency of Distributed Queries Using Replication. CoRR abs/2212.10387 (2022) - 2021
- [c11]Hung Le, Christian Wulff-Nilsen:
Optimal Approximate Distance Oracle for Planar Graphs. FOCS 2021: 363-374 - [c10]Arnold Filtser, Hung Le:
Clan embeddings into trees, and low treewidth graphs. STOC 2021: 342-355 - [i20]Arnold Filtser, Hung Le:
Clan Embeddings into Trees, and Low Treewidth Graphs. CoRR abs/2101.01146 (2021) - [i19]Arnold Filtser, Hung Le:
Reliable Spanners: Locality-Sensitive Orderings Strike Back. CoRR abs/2101.07428 (2021) - [i18]Hung Le, Shay Solomon:
Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions. CoRR abs/2106.15596 (2021) - [i17]Hung Le, Cuong Than:
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. CoRR abs/2107.06490 (2021) - [i16]Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon:
Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. CoRR abs/2107.14221 (2021) - [i15]Hung Le, Shay Solomon:
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. CoRR abs/2108.00102 (2021) - [i14]Hung Le, Christian Wulff-Nilsen:
Optimal Approximate Distance Oracle for Planar Graphs. CoRR abs/2111.03560 (2021) - [i13]Hung Le, Shay Solomon:
A Unified Framework of Light Spanners II: Fine-Grained Optimality. CoRR abs/2111.13748 (2021) - [i12]Hung Le, Lazar Milenkovic, Shay Solomon:
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. CoRR abs/2112.09124 (2021) - 2020
- [j3]Hung Le, Baigong Zheng:
Local search is a PTAS for feedback vertex set in minor-free graphs. Theor. Comput. Sci. 838: 17-24 (2020) - [c9]Hung Le, Shay Solomon:
Light Euclidean Spanners with Steiner Points. ESA 2020: 67:1-67:22 - [c8]Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le:
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. FOCS 2020: 589-600 - [c7]Hung Le:
A PTAS for subset TSP in minor-free graphs. SODA 2020: 2279-2298 - [i11]Hung Le, Shay Solomon:
Light Euclidean Spanners with Steiner Points. CoRR abs/2007.11636 (2020) - [i10]Hung Le, Shay Solomon:
A Unified and Fine-Grained Approach for Light Spanners. CoRR abs/2008.10582 (2020) - [i9]Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le:
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. CoRR abs/2009.05039 (2020)
2010 – 2019
- 2019
- [c6]Hung Le, Baigong Zheng:
A Simple Local Search Gives a PTAS for the Feedback Vertex Set Problem in Minor-Free Graphs. COCOON 2019: 375-386 - [c5]Hung Le, Shay Solomon:
Truly Optimal Euclidean Spanners. FOCS 2019: 1078-1100 - [c4]Glencora Borradaile, Hung Le, Baigong Zheng:
Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs. SEA² 2019: 98-113 - [c3]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Greedy spanners are optimal in doubling metrics. SODA 2019: 2371-2379 - [i8]Hung Le, Shay Solomon:
Truly Optimal Euclidean Spanners. CoRR abs/1904.12042 (2019) - 2018
- [j2]Hung Le:
A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph. Graphs Comb. 34(6): 1217-1246 (2018) - [i7]Hung Le, Baigong Zheng:
Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs. CoRR abs/1804.06428 (2018) - [i6]Glencora Borradaile, Hung Le, Baigong Zheng:
Designing Practical PTASes for Minimum Feedback Vertex Set in Planar Graphs. CoRR abs/1804.07869 (2018) - 2017
- [j1]Glencora Borradaile, Hung Le, Melissa Sherman-Bennett:
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph. Graphs Comb. 33(6): 1621-1634 (2017) - [c2]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Minor-Free Graphs Have Light Spanners. FOCS 2017: 767-778 - [i5]Glencora Borradaile, Jeff Erickson, Hung Le, Robbie Weber:
Embedded-width: A variant of treewidth for plane graphs. CoRR abs/1703.07532 (2017) - [i4]Glencora Borradaile, Hung Le:
Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs. CoRR abs/1703.10633 (2017) - [i3]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Minor-free graphs have light spanners. CoRR abs/1711.00821 (2017) - [i2]Glencora Borradaile, Hung Le, Christian Wulff-Nilsen:
Greedy spanners are optimal in doubling metrics. CoRR abs/1712.05007 (2017) - 2016
- [c1]Glencora Borradaile, Hung Le:
Optimal Dynamic Program for r-Domination Problems over Tree Decompositions. IPEC 2016: 8:1-8:23 - 2015
- [i1]Glencora Borradaile, Hung Le:
Optimal dynamic program for r-domination problems over tree decompositions. CoRR abs/1502.00716 (2015)
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 2025-03-08 00:52 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:
