Jan M. Hochstein, Karsten Weihe. Maximum ::::s-t::::-flow with ::::k:::: crossings in ::::O::::(::::k:::::::3:::::::n:::: log ::::n::::) time. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 843-847, SIAM, 2007. [doi]