[21] Towards transitive-free digraphs.
Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh,
Journal: TCS 2025
[20] Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints:
Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh,
Conference: SOFSEM 2025
19] Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities:
Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue,
Conference: SODA 2025
18] Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints:
Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar and Abhishek Sahu
Conference: MFCS 2024
17] Satisfiability to Coverage in the Presence of Fairness, Matroid, and Global Constraints:
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana,
Conference: ICALP 2024
16] A Polynomial Kernel for Vertex Deletion to Proper Helly Circular-arc Graph:
Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu,
Conference: LATIN 2024
15] MAX-SAT with Cardinality Constraint Parameterized by the Number of Clauses:
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Ananya Upasana,
Conference: LATIN 2024
14] Minimum Consistent Subset in Trees and Interval Graphs:
Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Conference: FSTTCS 2024
[13] Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage:
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Ananya Upasana
Conference: SODA 2023
[12] Parameterized Complexity of Perfectly Matched Sets.
Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu
Conference: IPEC 2022
[11] An Exact Algorithm for Knot-free Vertex Deletion.
M.S. Ramanujam, Abhishek Sahu, Saket Saurabh, Shaily Verma
Conference: MFCS 2022
[10] On Further Exploiting c-closure for FPT Algorithms and Kernels for Domination Problems.
M. Jayakrishnan, Lawqueen Kanesh, Sanjukta Roy, Abhishek Sahu, Saket Saurabh
Conference: STACS 2021
Journal: submitted
[9] A Polynomial Kernel for Vertex Deletion to Bipartite permutation Graph.
M. Jayakrishnan, Lawqueen Kanesh, Abhishek Sahu, Saket Saurabh, Shaily Verma
Conference: IPEC 2021
Journal: Algorithmica 2022
[8] Parameterized Complexity of Maximum Edge Colorable Subgraph.
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh and Prafullkumar Tale,
Conference: COCOON 2020
Journal: Algorithmica 2022
[7] Kernelization of Arc-Disjoint Cycle Packing in α-bounded digraphs.
Abhishek Sahu, Saket Saurabh
Conference: CSR 2020
Journal: TOCS 2023
[6] Packing Arc-Disjoint Cycles in Tournaments.
Stephane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi
Conference: MFCS 2019
Journal: Algorithmica 2020
[5] Graph Hamiltonicity Parameterized by Proper Interval Deletion Set.
Petr Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
Conference: LATIN 2019
[4] On the Complexity of Mixed Dominating Set.
Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh
Conference: CSR 2019
[3] The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue.
R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi
Conference: LATIN 2018
Journal: Algorithmica 2019
[2] Mixed Dominating Set: A Parameterized Perspective.
Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu
Conference: WG 2017
[1] Dynamic Parameterized Problems On the Complexity of Mixed Dominating Set.
R. Krithika, Abhishek Sahu, Prafullkumar Tale
Conference: IPEC 2016
Journal: Algorithmica 2018
"If you steal from one author it's plagiarism; if you steal from many it's research"- Wilson Mizner