Ankit Abhinav

According to our database, Ankit Abhinav authored at least 6 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Towards transitive-free digraphs.

Ankit Abhinav, Satyabrata Jana, Abhishek Sahu

Theor. Comput. Sci., 2025

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints.

Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

On the Parameterized Complexity of Connected Cluster Vertex Deletion.

Ankit Abhinav, Sriram Bhyravarapu, A. Mohanapriya, Saket Saurabh

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2022

Parameterized Complexity of Graph Partitioning into Connected Clusters.

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh

CoRR, 2022

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

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Algorithms for Finding Highly Connected Solution.

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2022