Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. - Ankit Abhinav; Susobhan Bandopadhyay; Aritra Banik; Yasuaki Kobayashi; Shunsuke Nagano; Yota Otachi; Saket Saurabh 001 (MFCS, 2022)

Parameterized Complexity of Graph Partitioning into Connected Clusters. - Ankit Abhinav; Susobhan Bandopadhyay; Aritra Banik; Saket Saurabh 001 (CoRR, 2022)

Parameterized algorithms for finding highly connected solution. - Ankit Abhinav; Susobhan Bandopadhyay; Aritra Banik; Saket Saurabh 001 (Theor. Comput. Sci., 2023)

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. - Ankit Abhinav; Satyabrata Jana; Nidhi Purohit; Abhishek Sahu; Saket Saurabh 001 (SOFSEM (1), 2025)

Towards transitive-free digraphs. - Ankit Abhinav; Satyabrata Jana; Abhishek Sahu (Theor. Comput. Sci., 2025)