James B. Orlin. Max flows in O(nm) time, or better. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 765-774, ACM, 2013. [doi]
@inproceedings{Orlin13,
title = {Max flows in O(nm) time, or better},
author = {James B. Orlin},
year = {2013},
doi = {10.1145/2488608.2488705},
url = {http://doi.acm.org/10.1145/2488608.2488705},
researchr = {https://researchr.org/publication/Orlin13},
cites = {0},
citedby = {0},
pages = {765-774},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
publisher = {ACM},
isbn = {978-1-4503-2029-0},
}