1. A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions;SIAM Journal on Computing;2024-03-13
3. A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Critical Path Awareness Techniques for Large-Scale Graph Partitioning;IEEE Transactions on Sustainable Computing;2023-07-01
5. Sparse Semi-Oblivious Routing: Few Random Paths Suffice;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16