[23] Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs

•     

•  Conference : AAAI 2026, Singapore

[22]  Towards transitive-free digraphs. 

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

•  Journal: TCS 2025

[21]  Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints: 

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

•  Conference: SOFSEM 2025,  Bratislava, Slovakia

[20]       Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities:

•  Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue,

•  Conference: SODA 2025, New Orleans, USA

[19]      Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints:

•  Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar and Abhishek Sahu

•  Conference: MFCS 2024,  Bratislava, Slovakia

[18]     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,  Tallinn, Estonia

[17]    A Polynomial Kernel for Vertex Deletion to Proper Helly Circular-arc Graph:  

• Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu, 

•  Conference: LATIN 2024, Puerto Varas, Chile

[16]    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, Puerto Varas, Chile

[15]    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, Gandhinagar, India

[14]     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, Florence, Italy

[13]     Partitioning Subclasses of Chordal Graphs with Few Deletions:

•   Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma  

•  Conference: CIAC 2023, Florence, Italy

[12]      Parameterized Complexity of Perfectly Matched Sets.

• Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu 

• Conference: IPEC 2022, Potsdam, Germany

[11]      An Exact Algorithm for Knot-free Vertex Deletion.

•  M.S. Ramanujam, Abhishek Sahu, Saket Saurabh, Shaily Verma

•  Conference: MFCS 2022, Vienna, Austria    

[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, Marseille, France

•  Journal: SIDMA 2023

[9]    A Polynomial Kernel for Vertex Deletion to Bipartite permutation Graph. 

•   M. Jayakrishnan, Lawqueen Kanesh, Abhishek Sahu, Saket Saurabh, Shaily Verma

•  Conference: IPEC 2021 ,  Lisbon, Portugal   

•  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, Atlanta, USA

•   Journal: Algorithmica 2022

[7]      Kernelization of Arc-Disjoint Cycle Packing in α-bounded digraphs.   

• Abhishek Sahu, Saket Saurabh

•  Conference:  CSR 2020 , Yekaterinburg, Russia 

•  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, Aachen, Germany

•   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, Sao Paulo, Brazil

[4]   On the Complexity of Mixed Dominating Set. 

• Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh

• Conference:  CSR 2019, Novosibirsk, Russia

[3]   The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. 

• R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi

• Conference:  LATIN 2018, Buenos Aires, Argentina

•   Journal: Algorithmica 2019

[2]   Mixed Dominating Set: A Parameterized Perspective. 

• Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu

• Conference:  WG 2017,  Eindhoven, The Netherlands

[1]   Dynamic Parameterized Problems On the Complexity of Mixed Dominating Set. 

• R. Krithika, Abhishek Sahu, Prafullkumar Tale

• Conference:  IPEC 2016, Aarhus, Denmark

•   Journal: Algorithmica 2018