Abhishek Sahu
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
19
Venues
12
Active years
2017–2026
Best venue rank
A*
Where they publish
Papers
19 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs. | Aritra Banik, Mano Prakash Parthasarathi, Venkatesh Raman, Diya Roy, Abhishek Sahu |
| 2026 | ESA | Computational Boundaries for Escaping Rectangles. | Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abhishek Sahu, Saket Saurabh, Kushal Singanporia |
| 2025 | SODA | Parameterized Approximation for Capacitated | Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Vaishali Surianarayanan, Jie Xue |
| 2025 | SOFSEM | Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. | Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh |
| 2024 | ICALP | Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. | Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2024 | LATIN | A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. | Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu |
| 2024 | LATIN | Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. | Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2024 | MFCS | Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. | Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu |
| 2023 | CIAC | Partitioning Subclasses of Chordal Graphs with Few Deletions. | Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma |
| 2023 | SODA | Parameterized Approximation Scheme for Biclique-free Max | Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2022 | MFCS | An Exact Algorithm for Knot-Free Vertex Deletion. | M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma |
| 2022 | STACS | Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. | Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh |
| 2020 | COCOON | Parameterized Complexity of Maximum Edge Colorable Subgraph. | Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale |
| 2020 | CSR | Kernelization of Arc Disjoint Cycle Packing in α-Bounded Digraphs. | Abhishek Sahu, Saket Saurabh |
| 2020 | LATIN | Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. | Petr A. Golovach, R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2019 | CSR | On the Complexity of Mixed Dominating Set. | Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh |
| 2019 | MFCS | Packing Arc-Disjoint Cycles in Tournaments. | Stphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi |
| 2018 | LATIN | The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue. | R. Krithika, Abhishek Sahu, Saket Saurabh, Meirav Zehavi |
| 2017 | WG | Mixed Dominating Set: A Parameterized Perspective. | Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu |