Vertex Cover Gets Faster and Harder on Low Degree Graphs. - Akanksha Agrawal 001; Sathish Govindarajan; Neeldhara Misra (COCOON, 2014)

Kernelizing Buttons and Scissors. - Akanksha Agrawal 001; Sudeshna Kolay; Saket Saurabh 001; Roohani Sharma (CCCG, 2016)

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. - Akanksha Agrawal 001; Sushmita Gupta; Saket Saurabh 001; Roohani Sharma (IPEC, 2016)

A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. - Akanksha Agrawal 001; Sudeshna Kolay; Daniel Lokshtanov; Saket Saurabh 001 (LATIN, 2016)

On the Parameterized Complexity of Simultaneous Deletion Problems. - Akanksha Agrawal 001; R. Krithika 001; Daniel Lokshtanov; Amer E. Mouawad; M. S. Ramanujan 001 (FSTTCS, 2017)

On the Parameterized Complexity of Happy Vertex Coloring. - Akanksha Agrawal 001 (IWOCA, 2017)

Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. - Akanksha Agrawal 001; Daniel Lokshtanov; Amer E. Mouawad (WG, 2017)

Polylogarithmic Approximation Algorithms for Weighted-$ mathcal{F}$-Deletion Problems. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (CoRR, 2017)

Hitting and Covering Partially. - Akanksha Agrawal 001; Pratibha Choudhary; Pallavi Jain 001; Lawqueen Kanesh; Vibha Sahlot; Saket Saurabh 001 (COCOON, 2018)

Exploring the Kernelization Borders for Hitting Cycles. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Pranabendu Misra; Saket Saurabh 001 (IPEC, 2018)

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Daniel Lokshtanov; Saket Saurabh 001 (MFCS, 2018)

Kernels for deletion to classes of acyclic digraphs. - Akanksha Agrawal 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (J. Comput. Syst. Sci., 2018)

Parameterised Algorithms for Deletion to Classes of DAGs. - Akanksha Agrawal 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (Theory Comput. Syst., 2018)

Kernelization of Cycle Packing with Relaxed Disjointness Constraints. - Akanksha Agrawal 001; Daniel Lokshtanov; Diptapriyo Majumdar; Amer E. Mouawad; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Simultaneous Feedback Vertex Set: A Parameterized Perspective. - Akanksha Agrawal 001; Daniel Lokshtanov; Amer E. Mouawad; Saket Saurabh 001 (ACM Trans. Comput. Theory, 2018)

Connecting the Dots (with Minimum Crossings). - Akanksha Agrawal 001; Grzegorz Guspiel; Jayakrishnan Madathil; Saket Saurabh 001; Meirav Zehavi (SoCG, 2019)

Parameterized Streaming Algorithms for Min-Ones d-SAT. - Akanksha Agrawal 001; Arindam Biswas 001; Édouard Bonnet; Nick Brettell; Radu Curticapean; Dániel Marx; Tillmann Miltzow; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2019)

Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. - Akanksha Agrawal 001; Sudeshna Kolay; Jayakrishnan Madathil; Saket Saurabh 001 (ISAAC, 2019)

Interval Vertex Deletion Admits a Polynomial Kernel. - Akanksha Agrawal 001; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (SODA, 2019)

FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. - Akanksha Agrawal 001; Pradeesha Ashok; Meghana M. Reddy; Saket Saurabh 001; Dolly Yadav (CoRR, 2019)

On the Parameterized Complexity of Contraction to Generalization of Trees. - Akanksha Agrawal 001; Saket Saurabh 001; Prafullkumar Tale (Theory Comput. Syst., 2019)

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2019)

Split Contraction: The Untold Story. - Akanksha Agrawal 001; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Comput. Theory, 2019)

Parameterized Analysis of Art Gallery and Terrain Guarding. - Akanksha Agrawal 001; Meirav Zehavi (CSR, 2020)

On the Parameterized Complexity of Clique Elimination Distance. - Akanksha Agrawal 001; M. S. Ramanujan 001 (IPEC, 2020)

Parameterized Complexity of Conflict-Free Matchings and Paths. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Saket Saurabh 001 (Algorithmica, 2020)

Path Contraction Faster than 2n. - Akanksha Agrawal 001; Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Prafullkumar Tale (SIAM J. Discret. Math., 2020)

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2020)

Parameterized complexity of happy coloring problems. - Akanksha Agrawal 001; N. R. Aravind; Subrahmanyam Kalyanasundaram; Anjeneya Swami Kare; Juho Lauri; Neeldhara Misra; I. Vinod Reddy (Theor. Comput. Sci., 2020)

Quadratic vertex kernel for split vertex deletion. - Akanksha Agrawal 001; Sushmita Gupta; Pallavi Jain 001; R. Krithika 001 (Theor. Comput. Sci., 2020)

A Polynomial Kernel for Deletion to Ptolemaic Graphs. - Akanksha Agrawal 001; Aditya Anand 001; Saket Saurabh 001 (IPEC, 2021)

Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH. - Akanksha Agrawal 001; Ravi Kiran Allumalla; Varun Teja Dhanekula (IPEC, 2021)

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. - Akanksha Agrawal 001; Lawqueen Kanesh; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (STACS, 2021)

Simultaneous Feedback Edge Set: A Parameterized Perspective. - Akanksha Agrawal 001; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2021)

Elimination Distance to Topological-minor-free Graphs is FPT. - Akanksha Agrawal 001; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (CoRR, 2021)

Paths to trees and cacti. - Akanksha Agrawal 001; Lawqueen Kanesh; Saket Saurabh 001; Prafullkumar Tale (Theor. Comput. Sci., 2021)

Distance from Triviality 2.0: Hybrid Parameterizations. - Akanksha Agrawal 001; M. S. Ramanujan 001 (IWOCA, 2022)

A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. - Akanksha Agrawal 001; Saket Saurabh 001; Meirav Zehavi (IPEC, 2022)

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. - Akanksha Agrawal 001; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2022)

Parameterized Complexity of Maximum Edge Colorable Subgraph. - Akanksha Agrawal 001; Madhumita Kundu; Abhishek Sahu; Saket Saurabh 001; Prafullkumar Tale (Algorithmica, 2022)

Parameter Analysis for Guarding Terrains. - Akanksha Agrawal 001; Sudeshna Kolay; Meirav Zehavi (Algorithmica, 2022)

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. - Akanksha Agrawal 001; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001 (Algorithmica, 2022)

Recurrent Problems in the LOCAL model. - Akanksha Agrawal 001; John Augustine; David Peleg; Srikkanth Ramachandran (CoRR, 2022)

Fine-grained complexity of rainbow coloring and its variants. - Akanksha Agrawal 001 (J. Comput. Syst. Sci., 2022)

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. - Akanksha Agrawal 001; Lawqueen Kanesh; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2022)

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). - Maria Chudnovsky; Neeldhara Misra; Daniël Paulusma; Oliver Schaudt; Akanksha Agrawal 001 (Dagstuhl Reports, 2022)

Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. - Akanksha Agrawal 001; M. S. Ramanujan 001 (FSTTCS, 2023)

Local Recurrent Problems in the SUPPORTED Model. - Akanksha Agrawal 001; John Augustine; David Peleg; Srikkanth Ramachandran (OPODIS, 2023)

Brief Announcement: Local Problems in the SUPPORTED Model. - Akanksha Agrawal 001; John Augustine; David Peleg; Srikkanth Ramachandran (PODC, 2023)

Computing Square Colorings on Bounded-Treewidth and Planar Graphs. - Akanksha Agrawal 001; Dániel Marx; Daniel Neuen; Jasper Slusallek (SODA, 2023)

Clustering what Matters: Optimal Approximation for Clustering with Outliers. - Akanksha Agrawal 001; Tanmay Inamdar 002; Saket Saurabh 001; Jie Xue 003 (J. Artif. Intell. Res., 2023)

Erdős-Pósa property of obstructions to interval graphs. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (J. Graph Theory, 2023)

Polynomial Kernel for Interval Vertex Deletion. - Akanksha Agrawal 001; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (ACM Trans. Algorithms, 2023)

Parameterized complexity of perfectly matched sets. - Akanksha Agrawal 001; Sutanay Bhattacharjee; Satyabrata Jana; Abhishek Sahu (Theor. Comput. Sci., 2023)

Parameterized Complexity of Minimum Membership Dominating Set. - Akanksha Agrawal 001; Pratibha Choudhary; N. S. Narayanaswamy; K. K. Nisha; Vijayaragunathan Ramamoorthi (Algorithmica, 2023)

A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. - Akanksha Agrawal 001; Satyabrata Jana; Abhishek Sahu (LATIN (2), 2024)

Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma (SODA, 2024)

Eliminating Crossings in Ordered Graphs. - Akanksha Agrawal 001; Sergio Cabello; Michael Kaufmann 001; Saket Saurabh 001; Roohani Sharma; Yushi Uno; Alexander Wolff 001 (SWAT, 2024)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (CoRR, 2024)

Recognizing well-dominated graphs is coNP-complete. - Akanksha Agrawal 001; Henning Fernau; Philipp Kindermann; Kevin Mann; Uéverton S. Souza (Inf. Process. Lett., 2024)

The Parameterized Complexity of Guarding Almost Convex Polygons. - Akanksha Agrawal 001; Kristine V. K. Knudsen; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (Discret. Comput. Geom., 2024)

Parameterized Saga of First-Fit and Last-Fit Coloring. - Akanksha Agrawal 001; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Shaily Verma (STACS, 2025)

On finding short reconfiguration sequences between independent sets. - Akanksha Agrawal 001; Soumita Hait; Amer E. Mouawad (J. Comput. Syst. Sci., 2025)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (ACM Trans. Algorithms, 2025)