1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. Tech. Report;D. Gusfield,1999
3. S. T. McCormick, Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. In: Proc. of the 28th Annual ACM Symp. on the Theory of Computing (STOC), 319–328, 1996.
4. K. D. Wayne, A New Property and a Faster Algorithm for Baseball Elimination, In: Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999. Preprint available as a link under the URL
http://www.cs.princeton.edu/~wayne/research.html