Elbassioni, Khaled Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., & Gurvich, V. (2005). Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. In Algorithms and computation (pp. 156-165). Berlin: Springer.