Akanksha Agrawal

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 87

Top Topics

Undirected Graph

Top Venues

Publications

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