| Truly optimal euclidean spanners H Le, S Solomon SIAM Journal on Computing, FOCS19-135-FOCS19-199, 2022 | 52 | 2022 |
| Optimal dynamic program for r-domination problems over tree decompositions G Borradaile, H Le arXiv preprint arXiv:1502.00716, 2015 | 45 | 2015 |
| 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 | 41 | 2019 |
| 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 | 35 | 2017 |
| 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 | 33 | 2020 |
| 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 | 20 | 2021 |
| Optimal approximate distance oracle for planar graphs H Le, C Wulff-Nilsen 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
| Low treewidth embeddings of planar and minor-free metrics A Filtser, H Le 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 12 | 2022 |
| Light Euclidean spanners with Steiner points H Le, S Solomon arXiv preprint arXiv:2007.11636, 2020 | 12 | 2020 |
| Locality-sensitive orderings and applications to reliable spanners A Filtser, H Le Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 11 | 2022 |
| 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 | 10 | 2022 |
| Covering planar metrics (and beyond): O (1) trees suffice HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 9 | 2023 |
| Greedy spanners in euclidean spaces admit sublinear separators H Le, C Than ACM Transactions on Algorithms 20 (3), 1-30, 2024 | 8 | 2024 |
| 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 | 8 | 2022 |
| 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 | 8 | 2022 |
| Planar and minor-free metrics embed into metrics of polylogarithmic treewidth with expected multiplicative distortion arbitrarily close to 1 V Cohen-Addad, H Le, M Pilipczuk, M Pilipczuk 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 7 | 2023 |
| Local search is a PTAS for feedback vertex set in minor-free graphs H Le, B Zheng Theoretical Computer Science 838, 17-24, 2020 | 7 | 2020 |
| A PTAS for subset TSP in minor-free graphs H Le Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 7 | 2020 |
| A unified and fine-grained approach for light spanners H Le, S Solomon arXiv preprint arXiv:2008.10582, 2020 | 6 | 2020 |
| Resolving the steiner point removal problem in planar graphs via shortcut partitions HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than arXiv preprint arXiv:2306.06235, 2023 | 5 | 2023 |
Shay SolomonTel Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
