1. Improved time bounds for the maximum flow problem;Ahuja;SIAM J. Comput.,1989
2. Algorithms for minimum flows, the computer science;Ciurea;J. Moldava,2001
3. E. Ciurea, L. Ciupala, A scaling algorithm for minimum flow problem, in: WSETS and IASME Conferences Corfu, Greece, August 17–19, 2004.
4. Two strongly polynomial cut canceling algorithms for minimum cost network flow;Ervolina;Discrete Appl. Math.,1993
5. Canceling most helpful total cuts for minimum cost network flow;Ervolina;Networks,1993