1. Frank Frank, A. , A. [1990]: Packing paths, circuits and cuts – a survey. In: Paths, Flows, and VLSI-Layout (B. Korte Korte, B. , L. Lovász Lovász, L. , H.J. Prömel Prömel, H.J. , A. Schrijver Schrijver, A. , eds.), Springer, Berlin 1990, pp. 47–100
2. Naves Naves, G. , G., and Sebő Sebő, A. , A. [2009]: Multiflow feasibility: an annotated tableau. In: Research Trends in Combinatorial Optimization (W.J. Cook Cook, W.J. , L. Lovász Lovász, L. , J. Vygen Vygen, J. , eds.), Springer, Berlin 2009, pp. 261–283
3. Ripphausen-Lipa Ripphausen-Lipa, H. , H., Wagner Wagner, D. , D., and Weihe Weihe, K. , K. [1995]: Efficient algorithms for disjoint paths in planar graphs. In: Combinatorial Optimization; DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20 (W. Cook Cook, W.J. , L. Lovász Lovász, L. , P. Seymour Seymour, P.D. , eds.), AMS, Providence 1995
4. Schrijver Schrijver, A. , A. [2003]: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Chapters 70–76
5. Shmoys Shmoys, D.B. , D.B. [1996]: Cut problems and their application to divide-and-conquer. In: Approximation Algorithms for NP-Hard Problems (D.S. Hochbaum Hochbaum, D.S. , ed.), PWS, Boston, 1996