Duan, Ran Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Duan, R. (2013). Breaking the O(n^2.5) Deterministic Time Barrier for Undirected Unit-capacity Maximum Flow. In S., Khanna (Ed.), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1171-1179). Philadelphia, PA: SIAM. doi:10.1137/1.9781611973105.84.