Sharma, Roohani Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Krithika, R., Sharma, R., & Tale, P. (2022). The Complexity of Contracting Bipartite Graphs into Small Cycles. In M. A. Bekos, & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 356-369). Berlin: Springer. doi:10.1007/978-3-031-15914-5_26.