Ankit Abhinav

Orcid: 0000-0001-7462-8704

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Towards transitive-free digraphs.
Theor. Comput. Sci., 2025

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints.
Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

On the Parameterized Complexity of Connected Cluster Vertex Deletion.
Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

2022
Parameterized Complexity of Graph Partitioning into Connected Clusters.
CoRR, 2022

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Algorithms for Finding Highly Connected Solution.
Proceedings of the Computer Science - Theory and Applications, 2022


  Loading...