1. Bruglieri, M., Ehrgott, M., Hamacher, H.W.: Some complexity results for k-cardinality minimum cut problems. Technical Report 69/2000, Wirtschaftsmathematik, University of Kaiserslautern (2000)
2. Bruglieri, M., Maffioli, F., Ehrgott, M.: Cardinality constrained minimum cut problems: Complexity and algorithms. Discrete Applied Mathematics 137(3), 311–341 (2004)
3. Climacao, J.: Multicriteria Analysis. Springer, Heidelberg (1997)
4. Lecture Notes in Economics and Mathematical Systems;M. Ehrgott,2000
5. Garey, M.R., Johnson, D.S.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)