| No. |
Title |
Author |
Year |
| 1 |
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481) |
Chudnovsky, Maria et al. |
2023 |
| 2 |
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation |
Agrawal, Akanksha et al. |
2022 |
| 3 |
On Finding Short Reconfiguration Sequences Between Independent Sets |
Agrawal, Akanksha et al. |
2022 |
| 4 |
Parameterized Complexity of Perfectly Matched Sets |
Agrawal, Akanksha et al. |
2022 |
| 5 |
A Polynomial Kernel for Deletion to Ptolemaic Graphs |
Agrawal, Akanksha et al. |
2021 |
| 6 |
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs |
Agrawal, Akanksha et al. |
2021 |
| 7 |
Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH |
Agrawal, Akanksha et al. |
2021 |
| 8 |
On the Parameterized Complexity of Clique Elimination Distance |
Agrawal, Akanksha et al. |
2020 |
| 9 |
Parameter Analysis for Guarding Terrains |
Agrawal, Akanksha et al. |
2020 |
| 10 |
The Parameterized Complexity of Guarding Almost Convex Polygons |
Agrawal, Akanksha et al. |
2020 |
| 11 |
Connecting the Dots (with Minimum Crossings) |
Agrawal, Akanksha et al. |
2019 |
| 12 |
Exploring the Kernelization Borders for Hitting Cycles |
Agrawal, Akanksha et al. |
2019 |
| 13 |
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices |
Agrawal, Akanksha et al. |
2019 |
| 14 |
Parameterized Complexity of Conflict-Free Matchings and Paths |
Agrawal, Akanksha et al. |
2019 |
| 15 |
Parameterized Streaming Algorithms for Min-Ones d-SAT |
Agrawal, Akanksha et al. |
2019 |
| 16 |
Path Contraction Faster Than 2^n |
Agrawal, Akanksha et al. |
2019 |
| 17 |
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy |
Agrawal, Akanksha et al. |
2018 |
| 18 |
Erdös-Pósa Property of Obstructions to Interval Graphs |
Agrawal, Akanksha et al. |
2018 |
| 19 |
On the Parameterized Complexity of Contraction to Generalization of Trees |
Agrawal, Akanksha et al. |
2018 |
| 20 |
On the Parameterized Complexity of Simultaneous Deletion Problems |
Agrawal, Akanksha et al. |
2018 |
| 21 |
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems |
Agrawal, Akanksha et al. |
2018 |
| 22 |
Fine-Grained Complexity of Rainbow Coloring and its Variants |
Agrawal, Akanksha |
2017 |
| 23 |
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set |
Agrawal, Akanksha et al. |
2017 |
| 24 |
Split Contraction: The Untold Story |
Agrawal, Akanksha et al. |
2017 |
| 25 |
Kernelization of Cycle Packing with Relaxed Disjointness Constraints |
Agrawal, Akanksha et al. |
2016 |
| 26 |
Kernels for Deletion to Classes of Acyclic Digraphs |
Agrawal, Akanksha et al. |
2016 |
| 27 |
Simultaneous Feedback Edge Set: A Parameterized Perspective |
Agrawal, Akanksha et al. |
2016 |
| 28 |
Simultaneous Feedback Vertex Set: A Parameterized Perspective |
Agrawal, Akanksha et al. |
2016 |
