Akanksha Agrawal
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
36
Venues
17
Active years
2014–2026
Best venue rank
A*
Where they publish
Papers
36 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Computational Boundaries for Escaping Rectangles. | Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abhishek Sahu, Saket Saurabh, Kushal Singanporia |
| 2025 | STACS | Parameterized Saga of First-Fit and Last-Fit Coloring. | Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma |
| 2024 | LATIN | A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. | Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu |
| 2024 | SODA | Odd Cycle Transversal on | Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma |
| 2023 | AAAI | Clustering What Matters: Optimal Approximation for Clustering with Outliers. | Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue |
| 2023 | OPODIS | Local Recurrent Problems in the SUPPORTED Model. | Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran |
| 2023 | PODC | Brief Announcement: Local Problems in the SUPPORTED Model. | Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran |
| 2023 | SODA | Computing Square Colorings on Bounded-Treewidth and Planar Graphs. | Akanksha Agrawal, Dniel Marx, Daniel Neuen, Jasper Slusallek |
| 2022 | ISAAC | On Finding Short Reconfiguration Sequences Between Independent Sets. | Akanksha Agrawal, Soumita Hait, Amer E. Mouawad |
| 2022 | IWOCA | Distance from Triviality 2.0: Hybrid Parameterizations. | Akanksha Agrawal, M. S. Ramanujan |
| 2022 | SODA | Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. | Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2022 | WALCOM | Parameterized Complexity of Minimum Membership Dominating Set. | Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi |
| 2021 | STACS | An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. | Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2020 | COCOON | Parameterized Complexity of Maximum Edge Colorable Subgraph. | Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale |
| 2020 | CSR | Parameterized Analysis of Art Gallery and Terrain Guarding. | Akanksha Agrawal, Meirav Zehavi |
| 2019 | CIAC | Quadratic Vertex Kernel for Split Vertex Deletion. | Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika |
| 2019 | ICALP | Path Contraction Faster Than 2 | Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale |
| 2019 | ISAAC | Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. | Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh |
| 2019 | MFCS | Parameterized Complexity of Conflict-Free Matchings and Paths. | Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh |
| 2019 | SODA | Interval Vertex Deletion Admits a Polynomial Kernel. | Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2018 | COCOON | Hitting and Covering Partially. | Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh |
| 2018 | MFCS | Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. | Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh |
| 2018 | STACS | Erds-Psa Property of Obstructions to Interval Graphs. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | CIAC | Paths to Trees and Cacti. | Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale |
| 2017 | IWOCA | On the Parameterized Complexity of Happy Vertex Coloring. | Akanksha Agrawal |
| 2017 | MFCS | Fine-Grained Complexity of Rainbow Coloring and its Variants. | Akanksha Agrawal |
| 2017 | SODA | Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. | Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi |
| 2017 | STACS | Split Contraction: The Untold Story. | Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2017 | WADS | Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. | Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh |
| 2017 | WG | Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. | Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad |
| 2016 | ICALP | Kernelization of Cycle Packing with Relaxed Disjointness Constraints. | Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh |
| 2016 | ISAAC | Simultaneous Feedback Edge Set: A Parameterized Perspective. | Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2016 | ISAAC | Kernels for Deletion to Classes of Acyclic Digraphs. | Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2016 | LATIN | A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. | Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh |
| 2016 | STACS | Simultaneous Feedback Vertex Set: A Parameterized Perspective. | Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh |
| 2014 | COCOON | Vertex Cover Gets Faster and Harder on Low Degree Graphs. | Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra |