1. Minimum Cut in $$O(m\log ^2 n)$$ Time;Theory of Computing Systems;2024-06-12
2. 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
3. Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow;Communications of the ACM;2023-11-17
4. A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06