default search action
Akanksha Agrawal 0001
Person information
- affiliation: Indian Institute of Technology Madras, Chennai, Tamil Nadu, India
- affiliation (former): Ben-Gurion University of the Negev, Beer-Sheva, Israel
Other persons with the same name
- Akanksha Agrawal 0002 — Panjab University, Chandigarh, India
- Akanksha Agrawal 0003
— Humanitas University, Department of Biomedical Sciences, Milan, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j27]Akanksha Agrawal, Soumita Hait, Amer E. Mouawad
On finding short reconfiguration sequences between independent sets. J. Comput. Syst. Sci. 147: 103578 (2025) - 2024
- [j26]Akanksha Agrawal
The Parameterized Complexity of Guarding Almost Convex Polygons. Discret. Comput. Geom. 71(2): 358-398 (2024) - [j25]Akanksha Agrawal, Henning Fernau, Philipp Kindermann
Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183: 106419 (2024) - [c51]Akanksha Agrawal, Satyabrata Jana
A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. LATIN (2) 2024: 208-222 - [c50]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. SODA 2024: 5276-5290 - [c49]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. SWAT 2024: 1:1-1:19 - [i22]Akanksha Agrawal, Satyabrata Jana
A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion. CoRR abs/2401.03415 (2024) - [i21]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Polynomial Time. CoRR abs/2402.11465 (2024) - [i20]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. CoRR abs/2404.09771 (2024) - 2023
- [j24]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. Algorithmica 85(11): 3430-3452 (2023) - [j23]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue
Clustering what Matters: Optimal Approximation for Clustering with Outliers. J. Artif. Intell. Res. 78: 143-166 (2023) - [j22]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh
Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory 102(4): 702-727 (2023) - [j21]Akanksha Agrawal
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19(2): 11:1-11:68 (2023) - [j20]Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana
Parameterized complexity of perfectly matched sets. Theor. Comput. Sci. 958: 113861 (2023) - [c48]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering What Matters: Optimal Approximation for Clustering with Outliers. AAAI 2023: 6666-6674 - [c47]Akanksha Agrawal, M. S. Ramanujan:
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. FSTTCS 2023: 36:1-36:17 - [c46]Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
Local Recurrent Problems in the SUPPORTED Model. OPODIS 2023: 22:1-22:19 - [c45]Akanksha Agrawal
Brief Announcement: Local Problems in the SUPPORTED Model. PODC 2023: 172-175 - [c44]Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek:
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. SODA 2023: 2087-2110 - 2022
- [j19]Akanksha Agrawal
Parameter Analysis for Guarding Terrains. Algorithmica 84(4): 961-981 (2022) - [j18]Akanksha Agrawal
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 84(9): 2622-2641 (2022) - [j17]Akanksha Agrawal, Madhumita Kundu
Parameterized Complexity of Maximum Edge Colorable Subgraph. Algorithmica 84(10): 3075-3100 (2022) - [j16]Akanksha Agrawal:
Fine-grained complexity of rainbow coloring and its variants. J. Comput. Syst. Sci. 124: 140-158 (2022) - [j15]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. 36(2): 911-921 (2022) - [c43]Akanksha Agrawal, Soumita Hait, Amer E. Mouawad:
On Finding Short Reconfiguration Sequences Between Independent Sets. ISAAC 2022: 39:1-39:14 - [c42]Akanksha Agrawal
Distance from Triviality 2.0: Hybrid Parameterizations. IWOCA 2022: 3-20 - [c41]Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. IPEC 2022: 1:1-1:16 - [c40]Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana
Parameterized Complexity of Perfectly Matched Sets. IPEC 2022: 2:1-2:13 - [c39]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA 2022: 1976-2004 - [c38]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. WALCOM 2022: 288-299 - [i19]Akanksha Agrawal, Henning Fernau
Recognizing well-dominated graphs is coNP-complete. CoRR abs/2208.08864 (2022) - [i18]Akanksha Agrawal, Soumita Hait, Amer E. Mouawad:
On finding short reconfiguration sequences between independent sets. CoRR abs/2209.05145 (2022) - [i17]Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. CoRR abs/2210.03932 (2022) - [i16]Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek:
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. CoRR abs/2211.04458 (2022) - [i15]Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh, Jie Xue:
Clustering What Matters: Optimal Approximation for Clustering with Outliers. CoRR abs/2212.00696 (2022) - [i14]Akanksha Agrawal, John Augustine, David Peleg, Srikkanth Ramachandran
Recurrent Problems in the LOCAL model. CoRR abs/2212.14542 (2022) - [i13]Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports 12(11): 109-123 (2022) - 2021
- [j14]Akanksha Agrawal, Fahad Panolan
Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 83(2): 753-774 (2021) - [j13]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
Paths to trees and cacti. Theor. Comput. Sci. 860: 98-116 (2021) - [c37]Akanksha Agrawal, Aditya Anand
A Polynomial Kernel for Deletion to Ptolemaic Graphs. IPEC 2021: 1:1-1:15 - [c36]Akanksha Agrawal, Ravi Kiran Allumalla, Varun Teja Dhanekula:
Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH. IPEC 2021: 2:1-2:12 - [c35]Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS 2021: 5:1-5:11 - [i12]Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR abs/2104.09950 (2021) - [i11]Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy, K. K. Nisha, Vijayaragunathan Ramamoorthi:
Parameterized Complexity of Minimum Membership Dominating Set. CoRR abs/2110.06656 (2021) - 2020
- [j12]Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh
Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica 82(7): 1939-1965 (2020) - [j11]Akanksha Agrawal, Fedor V. Fomin
Path Contraction Faster than 2n. SIAM J. Discret. Math. 34(2): 1302-1325 (2020) - [j10]Akanksha Agrawal
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms 16(4): 51:1-51:38 (2020) - [j9]Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Quadratic vertex kernel for split vertex deletion. Theor. Comput. Sci. 833: 164-172 (2020) - [j8]Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835: 58-81 (2020) - [c34]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Parameterized Complexity of Maximum Edge Colorable Subgraph. COCOON 2020: 615-626 - [c33]Akanksha Agrawal
The Parameterized Complexity of Guarding Almost Convex Polygons. SoCG 2020: 3:1-3:16 - [c32]Akanksha Agrawal, Meirav Zehavi:
Parameterized Analysis of Art Gallery and Terrain Guarding. CSR 2020: 16-29 - [c31]Akanksha Agrawal
On the Parameterized Complexity of Clique Elimination Distance. IPEC 2020: 1:1-1:13 - [c30]Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi:
Parameter Analysis for Guarding Terrains. SWAT 2020: 4:1-4:18 - [i10]Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. CoRR abs/2003.07793 (2020) - [i9]Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Parameterized Complexity of Maximum Edge Colorable Subgraph. CoRR abs/2008.07953 (2020)
2010 – 2019
- 2019
- [j7]Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale
On the Parameterized Complexity of Contraction to Generalization of Trees. Theory Comput. Syst. 63(3): 587-614 (2019) - [j6]Akanksha Agrawal
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms 15(1): 11:1-11:28 (2019) - [j5]Akanksha Agrawal
Split Contraction: The Untold Story. ACM Trans. Comput. Theory 11(3): 18:1-18:22 (2019) - [c29]Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Quadratic Vertex Kernel for Split Vertex Deletion. CIAC 2019: 1-12 - [c28]Akanksha Agrawal
Connecting the Dots (with Minimum Crossings). SoCG 2019: 7:1-7:17 - [c27]Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell
Parameterized Streaming Algorithms for Min-Ones d-SAT. FSTTCS 2019: 8:1-8:20 - [c26]Akanksha Agrawal
Path Contraction Faster Than 2n. ICALP 2019: 11:1-11:13 - [c25]Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ISAAC 2019: 41:1-41:14 - [c24]Akanksha Agrawal
Parameterized Complexity of Conflict-Free Matchings and Paths. MFCS 2019: 35:1-35:15 - [c23]Akanksha Agrawal
Interval Vertex Deletion Admits a Polynomial Kernel. SODA 2019: 1711-1730 - [i8]Akanksha Agrawal, Pradeesha Ashok, Meghana M. Reddy, Saket Saurabh, Dolly Yadav:
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding. CoRR abs/1905.01822 (2019) - 2018
- [j4]Akanksha Agrawal
Kernels for deletion to classes of acyclic digraphs. J. Comput. Syst. Sci. 92: 9-21 (2018) - [j3]Akanksha Agrawal
Parameterised Algorithms for Deletion to Classes of DAGs. Theory Comput. Syst. 62(8): 1880-1909 (2018) - [j2]Akanksha Agrawal
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. SIAM J. Discret. Math. 32(3): 1619-1643 (2018) - [j1]Akanksha Agrawal
Simultaneous Feedback Vertex Set: A Parameterized Perspective. ACM Trans. Comput. Theory 10(4): 18:1-18:25 (2018) - [c22]Akanksha Agrawal
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM 2018: 1:1-1:15 - [c21]Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh:
Hitting and Covering Partially. COCOON 2018: 751-763 - [c20]Akanksha Agrawal
Exploring the Kernelization Borders for Hitting Cycles. IPEC 2018: 14:1-14:14 - [c19]Akanksha Agrawal
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. MFCS 2018: 53:1-53:15 - [c18]Akanksha Agrawal
Erdös-Pósa Property of Obstructions to Interval Graphs. STACS 2018: 7:1-7:15 - 2017
- [c17]Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale
Paths to Trees and Cacti. CIAC 2017: 31-42 - [c16]Akanksha Agrawal
On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS 2017: 9:1-9:14 - [c15]Akanksha Agrawal:
On the Parameterized Complexity of Happy Vertex Coloring. IWOCA 2017: 103-115 - [c14]Akanksha Agrawal
On the Parameterized Complexity of Contraction to Generalization of Trees. IPEC 2017: 1:1-1:12 - [c13]Akanksha Agrawal
Fine-Grained Complexity of Rainbow Coloring and its Variants. MFCS 2017: 60:1-60:14 - [c12]Akanksha Agrawal
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA 2017: 1383-1398 - [c11]Akanksha Agrawal
Split Contraction: The Untold Story. STACS 2017: 5:1-5:14 - [c10]Akanksha Agrawal, Pranabendu Misra, Fahad Panolan
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS 2017: 25-36 - [c9]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad:
Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. WG 2017: 32-44 - [i7]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR abs/1707.04908 (2017) - [i6]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR abs/1707.04917 (2017) - [i5]Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale:
On the Parameterized Complexity of Contraction to Generalization of Trees. CoRR abs/1708.00622 (2017) - 2016
- [c8]Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma:
Kernelizing Buttons and Scissors. CCCG 2016: 279-286 - [c7]Akanksha Agrawal
Kernelization of Cycle Packing with Relaxed Disjointness Constraints. ICALP 2016: 26:1-26:14 - [c6]Akanksha Agrawal
Simultaneous Feedback Edge Set: A Parameterized Perspective. ISAAC 2016: 5:1-5:13 - [c5]Akanksha Agrawal
Kernels for Deletion to Classes of Acyclic Digraphs. ISAAC 2016: 6:1-6:12 - [c4]Akanksha Agrawal
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC 2016: 2:1-2:14 - [c3]Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN 2016: 1-13 - [c2]Akanksha Agrawal
Simultaneous Feedback Vertex Set: A Parameterized Perspective. STACS 2016: 7:1-7:15 - [i4]Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Simultaneous Feedback Edge Set: A Parameterized Perspective. CoRR abs/1611.07701 (2016) - 2015
- [i3]Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh:
Simultaneous Feedback Vertex Set: A Parameterized Perspective. CoRR abs/1510.01557 (2015) - [i2]Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh:
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion. CoRR abs/1510.08154 (2015) - 2014
- [c1]Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra:
Vertex Cover Gets Faster and Harder on Low Degree Graphs. COCOON 2014: 179-190 - [i1]Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra:
Vertex Cover Gets Faster and Harder on Low Degree Graphs. CoRR abs/1404.5566 (2014)
Coauthor Index
[j26] [c50] [c49] [i21] [i20] [j23] [j22] [j21] [c48] [j18] [j17] [j15] [c41] [c39] [i17] [i15] [j14] [j13] [c37] [c35] [i12] [j12] [j11] [j10] [c34] [c33] [i10] [i9] [j7] [j6] [j5] [c28] [c27] [c26] [c25] [c24] [c23] [i8] [j4] [j3] [j2] [j1] [c22] [c21] [c20] [c19] [c18] [c17] [c14] [c12] [c11] [c10] [i7] [i6] [i5] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [i4] [i3] [i2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: