1. Massively Parallel Algorithms for Approximate Shortest Paths;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n);2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Bridge Girth: A Unifying Notion in Network Design;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Almost-Optimal Sublinear Additive Spanners;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02