Follow
Hung Le
Title
Cited by
Cited by
Year
Truly optimal euclidean spanners
H Le, S Solomon
SIAM Journal on Computing, FOCS19-135-FOCS19-199, 2022
382022
Greedy spanners are optimal in doubling metrics
G Borradaile, H Le, C Wulff-Nilsen
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
342019
Optimal dynamic program for r-domination problems over tree decompositions
G Borradaile, H Le
arXiv preprint arXiv:1502.00716, 2015
312015
Minor-free graphs have light spanners
G Borradaile, H Le, C Wulff-Nilsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
292017
On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs
V Cohen-Addad, A Filtser, PN Klein, H Le
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
192020
Light Euclidean spanners with Steiner points
H Le, S Solomon
arXiv preprint arXiv:2007.11636, 2020
122020
Clan embeddings into trees, and low treewidth graphs
A Filtser, H Le
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
112021
Optimal approximate distance oracle for planar graphs
H Le, C Wulff-Nilsen
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
62022
Local search is a PTAS for feedback vertex set in minor-free graphs
H Le, B Zheng
Theoretical Computer Science 838, 17-24, 2020
62020
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time∗
H Le, S Solomon
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
52022
Dynamic matching algorithms under vertex updates
H Le, L Milenkovic, S Solomon, V Vassilevska Williams
The 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), 2022
42022
Reliable spanners: Locality-sensitive orderings strike back
A Filtser, H Le
arXiv e-prints, arXiv: 2101.07428, 2021
42021
Towards a unified theory of light spanners I: Fast (yet optimal) constructions
H Le, S Solomon
arXiv preprint arXiv:2106.15596, 2021
32021
A unified and fine-grained approach for light spanners
H Le, S Solomon
arXiv preprint arXiv:2008.10582, 2020
32020
A PTAS for subset TSP in minor-free graphs
H Le
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
32020
A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph
H Le
Graphs and Combinatorics 34, 1217-1246, 2018
32018
Light spanners for bounded treewidth graphs imply light spanners for -minor-free graphs
G Borradaile, H Le
arXiv preprint arXiv:1703.10633, 2017
32017
Can't see the forest for the trees: navigating metric spaces by bounded hop-diameter spanners
O Kahalon, H Le, L Milenković, S Solomon
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
22022
Sparse euclidean spanners with tiny diameter: A tight lower bound
H Le, L Milenkovic, S Solomon
arXiv preprint arXiv:2112.09124, 2021
22021
Engineering a PTAS for minimum feedback vertex set in planar graphs
G Borradaile, H Le, B Zheng
Analysis of Experimental Algorithms: Special Event, SEA² 2019, Kalamata …, 2019
22019
The system can't perform the operation now. Try again later.
Articles 1–20