1. Network Flows: Theory, Algorithms, and Applications;Ahuja,1993
2. Finding and counting given length cycles;Alon;Algorithmica,1997
3. Finding good approximate vertex and edge partitions is NP-hard;Bui;Inform. Process. Lett.,1992
4. J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, G. Xia, Tight lower bounds for certain parameterized NP-hard problems, in: Proc. 19th Ann. IEEE Conf. on Computational Complexity, 2004, pp. 150–160.
5. W.H. Cunningham, The optimal multiterminal cut problem, in: Reliability of Computer and Communication Networks (New Brunswick, NJ, 1989), Vol. 5, DIMACS Series in Discrete Mathematics Theoretical Computer Sciences, American Mathematical Society, Providence, RI, 1991, pp. 105–120.