Akanksha Agrawal

106 papers A* 11A 5B 21C 4Misc 4Journal 53Unranked 8
YearRankTypeTitle / Venue / Authors
2025 B ed.
20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025
IPEC
Akanksha Agrawal, Erik Jan van Leeuwen
2025 J jnl
Odd Cycle Transversal on
ACM Trans. Algorithms
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
2025 J jnl
On finding short reconfiguration sequences between independent sets.
J. Comput. Syst. Sci.
Akanksha Agrawal, Soumita Hait, Amer E. Mouawad
2025 A conf
Parameterized Saga of First-Fit and Last-Fit Coloring.
STACS
Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma
2025 J jnl
Path Contraction Faster than 2
CoRR
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2025 J jnl
Solving Problems on Graphs: From Structure to Algorithms (Dagstuhl Seminar 25041).
Dagstuhl Reports
Akanksha Agrawal, Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt, Julien Codsi
2024 — conf
A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion.
LATIN (2)
Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu
2024 J jnl
A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion.
CoRR
Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu
2024 — conf
Eliminating Crossings in Ordered Graphs.
SWAT
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
2024 J jnl
Eliminating Crossings in Ordered Graphs.
CoRR
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
2024 A* conf
Odd Cycle Transversal on
SODA
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma
2024 J jnl
Odd Cycle Transversal on P
CoRR
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
2024 J jnl
Parameterized Saga of First-Fit and Last-Fit Coloring.
CoRR
Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma
2024 J jnl
Recognizing well-dominated graphs is coNP-complete.
Inf. Process. Lett.
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
2024 J jnl
The Parameterized Complexity of Guarding Almost Convex Polygons.
Discret. Comput. Geom.
Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2023 — conf
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels.
FSTTCS
Akanksha Agrawal, M. S. Ramanujan
2023 A* conf
Brief Announcement: Local Problems in the SUPPORTED Model.
PODC
Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
2023 A* conf
Clustering What Matters: Optimal Approximation for Clustering with Outliers.
AAAI
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2023 J jnl
Clustering what Matters: Optimal Approximation for Clustering with Outliers.
J. Artif. Intell. Res.
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2023 A* conf
Computing Square Colorings on Bounded-Treewidth and Planar Graphs.
SODA
Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
2023 J jnl
Erdős-Pósa property of obstructions to interval graphs.
J. Graph Theory
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2023 B conf
Local Recurrent Problems in the SUPPORTED Model.
OPODIS
Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
2023 J jnl
Parameterized Complexity of Minimum Membership Dominating Set.
Algorithmica
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
2023 J jnl
Parameterized complexity of perfectly matched sets.
Theor. Comput. Sci.
Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu
2023 J jnl
Polynomial Kernel for Interval Vertex Deletion.
ACM Trans. Algorithms
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2022 B conf
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation.
IPEC
Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
2022 J jnl
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation.
CoRR
Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
2022 J jnl
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.
SIAM J. Discret. Math.
Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2022 J jnl
Clustering What Matters: Optimal Approximation for Clustering with Outliers.
CoRR
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
2022 J jnl
Computing Square Colorings on Bounded-Treewidth and Planar Graphs.
CoRR
Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek
2022 A* conf
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent.
SODA
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2022 C conf
Distance from Triviality 2.0: Hybrid Parameterizations.
IWOCA
Akanksha Agrawal, M. S. Ramanujan
2022 J jnl
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.
Algorithmica
Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2022 J jnl
Fine-grained complexity of rainbow coloring and its variants.
J. Comput. Syst. Sci.
Akanksha Agrawal
2022 B conf
On Finding Short Reconfiguration Sequences Between Independent Sets.
ISAAC
Akanksha Agrawal, Soumita Hait, Amer E. Mouawad
2022 J jnl
On finding short reconfiguration sequences between independent sets.
CoRR
Akanksha Agrawal, Soumita Hait, Amer E. Mouawad
2022 J jnl
Parameter Analysis for Guarding Terrains.
Algorithmica
Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
2022 J jnl
Parameterized Complexity of Maximum Edge Colorable Subgraph.
Algorithmica
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2022 B conf
Parameterized Complexity of Minimum Membership Dominating Set.
WALCOM
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
2022 B conf
Parameterized Complexity of Perfectly Matched Sets.
IPEC
Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu
2022 J jnl
Recognizing well-dominated graphs is coNP-complete.
CoRR
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza
2022 J jnl
Recurrent Problems in the LOCAL model.
CoRR
Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
2022 J jnl
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
Dagstuhl Reports
Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal
2021 B conf
A Polynomial Kernel for Deletion to Ptolemaic Graphs.
IPEC
Akanksha Agrawal, Aditya Anand, Saket Saurabh
2021 A conf
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.
STACS
Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021 J jnl
Elimination Distance to Topological-minor-free Graphs is FPT.
CoRR
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021 J jnl
Parameterized Complexity of Minimum Membership Dominating Set.
CoRR
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi
2021 J jnl
Paths to trees and cacti.
Theor. Comput. Sci.
Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
2021 B conf
Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH.
IPEC
Akanksha Agrawal, Ravi Kiran Allumalla, Varun Teja Dhanekula
2021 J jnl
Simultaneous Feedback Edge Set: A Parameterized Perspective.
Algorithmica
Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020 B conf
On the Parameterized Complexity of Clique Elimination Distance.
IPEC
Akanksha Agrawal, M. S. Ramanujan
2020 — conf
Parameter Analysis for Guarding Terrains.
SWAT
Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
2020 Misc conf
Parameterized Analysis of Art Gallery and Terrain Guarding.
CSR
Akanksha Agrawal, Meirav Zehavi
2020 J jnl
Parameterized Complexity of Conflict-Free Matchings and Paths.
Algorithmica
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh
2020 Misc conf
Parameterized Complexity of Maximum Edge Colorable Subgraph.
COCOON
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2020 J jnl
Parameterized Complexity of Maximum Edge Colorable Subgraph.
CoRR
Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2020 J jnl
Parameterized complexity of happy coloring problems.
Theor. Comput. Sci.
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy
2020 J jnl
Path Contraction Faster than 2
SIAM J. Discret. Math.
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2020 J jnl
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems.
ACM Trans. Algorithms
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2020 J jnl
Quadratic vertex kernel for split vertex deletion.
Theor. Comput. Sci.
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
2020 A* conf
The Parameterized Complexity of Guarding Almost Convex Polygons.
SoCG
Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020 J jnl
The Parameterized Complexity of Guarding Almost Convex Polygons.
CoRR
Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2019 A* conf
Connecting the Dots (with Minimum Crossings).
SoCG
Akanksha Agrawal, Grzegorz Guspiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
2019 J jnl
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding.
CoRR
Akanksha Agrawal, Pradeesha Ashok, Meghana M. Reddy, Saket Saurabh, Dolly Yadav
2019 J jnl
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.
ACM Trans. Algorithms
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019 A* conf
Interval Vertex Deletion Admits a Polynomial Kernel.
SODA
Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019 J jnl
On the Parameterized Complexity of Contraction to Generalization of Trees.
Theory Comput. Syst.
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2019 B conf
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices.
ISAAC
Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh
2019 B conf
Parameterized Complexity of Conflict-Free Matchings and Paths.
MFCS
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh
2019 — conf
Parameterized Streaming Algorithms for Min-Ones d-SAT.
FSTTCS
Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman, Saket Saurabh
2019 A* conf
Path Contraction Faster Than 2
ICALP
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale
2019 C conf
Quadratic Vertex Kernel for Split Vertex Deletion.
CIAC
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
2019 J jnl
Split Contraction: The Untold Story.
ACM Trans. Comput. Theory
Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2018 B conf
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.
MFCS
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh
2018 A conf
Erdös-Pósa Property of Obstructions to Interval Graphs.
STACS
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018 B conf
Exploring the Kernelization Borders for Hitting Cycles.
IPEC
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh
2018 Misc conf
Hitting and Covering Partially.
COCOON
Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh
2018 J jnl
Kernelization of Cycle Packing with Relaxed Disjointness Constraints.
SIAM J. Discret. Math.
Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
2018 J jnl
Kernels for deletion to classes of acyclic digraphs.
J. Comput. Syst. Sci.
Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018 J jnl
Parameterised Algorithms for Deletion to Classes of DAGs.
Theory Comput. Syst.
Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018 — conf
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems.
APPROX-RANDOM
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018 J jnl
Simultaneous Feedback Vertex Set: A Parameterized Perspective.
ACM Trans. Comput. Theory
Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2017 B conf
Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard.
WG
Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad
2017 B conf
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.
WADS
Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2017 A* conf
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.
SODA
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017 J jnl
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.
CoRR
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017 B conf
Fine-Grained Complexity of Rainbow Coloring and its Variants.
MFCS
Akanksha Agrawal
2017 B conf
On the Parameterized Complexity of Contraction to Generalization of Trees.
IPEC
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2017 J jnl
On the Parameterized Complexity of Contraction to Generalization of Trees.
CoRR
Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
2017 C conf
On the Parameterized Complexity of Happy Vertex Coloring.
IWOCA
Akanksha Agrawal
2017 — conf
On the Parameterized Complexity of Simultaneous Deletion Problems.
FSTTCS
Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan
2017 C conf
Paths to Trees and Cacti.
CIAC
Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
2017 J jnl
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems.
CoRR
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2017 A conf
Split Contraction: The Untold Story.
STACS
Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2016 B conf
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion.
LATIN
Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2016 B conf
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.
IPEC
Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma
2016 A* conf
Kernelization of Cycle Packing with Relaxed Disjointness Constraints.
ICALP
Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh
2016 — conf
Kernelizing Buttons and Scissors.
CCCG
Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma
2016 B conf
Kernels for Deletion to Classes of Acyclic Digraphs.
ISAAC
Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2016 B conf
Simultaneous Feedback Edge Set: A Parameterized Perspective.
ISAAC
Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016 J jnl
Simultaneous Feedback Edge Set: A Parameterized Perspective.
CoRR
Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016 A conf
Simultaneous Feedback Vertex Set: A Parameterized Perspective.
STACS
Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2015 J jnl
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion.
CoRR
Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
2015 J jnl
Simultaneous Feedback Vertex Set: A Parameterized Perspective.
CoRR
Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh
2014 Misc conf
Vertex Cover Gets Faster and Harder on Low Degree Graphs.
COCOON
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
2014 J jnl
Vertex Cover Gets Faster and Harder on Low Degree Graphs.
CoRR
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra