Ankit Abhinav

About

I am currently a PhD student at National Institute of Science Education and Research Bhubaneshwar, India. I work primarily in the field of Parameterized Complexity and Graph Algorithms.

Employment

Employment history is unavailable.

Education

• National Institute of Science Education and Research PhD
  2020 - Present

Projects & Funding

Projects & funding information is unavailable.

Publications (8)

• On the Parameterized Complexity of Connected Cluster Vertex Deletion
  Lecture Notes in Computer Science 2026 DOI: 10.1007/978-3-032-04700-7_1
  +Save
• Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
  Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics 2025 DOI: 10.1007/978-3-031-82670-2_3
  +Save
• Towards Transitive-free Digraphs
  Arxiv 2025 DOI: 10.48550/arXiv.2503.10541
  +Save
• Towards transitive-free digraphs
  Theoretical Computer Science 2025 DOI: 10.1016/j.tcs.2025.115270
  +Save
• Parameterized algorithms for finding highly connected solution
  Theoretical Computer Science 2023 DOI: 10.1016/j.tcs.2022.11.024
  +Save
• Parameterized Algorithms for Finding Highly Connected Solution
  Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics 2022 DOI: 10.1007/978-3-031-09574-0_1
  +Save
• Parameterized Complexity of Graph Partitioning into Connected Clusters
  Arxiv 2022 DOI: 10.48550/arxiv.2202.12042
  +Save
• Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets
  Leibniz International Proceedings in Informatics Lipics 2022 DOI: 10.4230/LIPIcs.MFCS.2022.6
  +Save