1. Maximum Bipartite Matching in
2+(1)
Time via a Combinatorial Algorithm;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Maximum Concurrent Flow Solutions for Improved Routing in IoT Future Networks;Arabian Journal for Science and Engineering;2022-11-22