Kapoor, Sanjiv Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Kapoor, S. (1996). On minimum 3-cuts and approximating k-cuts using cut trees. In W. H. Cunningham, T. S. McCormick, & M. Queyranne (Eds.), Integer Programming and Combinatorial Optimization: International Conference (IPCO-5) (pp. 132-146). Berlin, Germany: Springer.