Elbassioni, Khaled Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K., & Rudolf, G. (2007). Generating Minimal k-Vertex Connected Spanning Subgraphs. In G. Lin (Ed.), Computing and Combinatorics (pp. 222-231). Berlin: Springer. doi:10.1007/978-3-540-73545-8_23.