AkankshaAgrawal55

Sort by
Guarding Terrains though the Lens of Parameterized Complexity
Guarding Polygons via CSP
Polynomial Kernel for Interval Vertex Deletion
Path Contraction Faster than 2^n
Ivd soda-2019
COnflict Free Feedback Vertex Set: A Parameterized Dichotomy
Simulataneous Feedback Edge Set: A Parameterized Perspective
Kernels for Deletion to Classes of Acyclic Digraphs
Kernelization of Cycle Packing with Relaxed Disjointness Constraints
Delaunay Graphs For Various Geometric Objects
Graph Modification: Beyond the known Boundaries
Non-negative Matrix Factorization
Split Contraction: The Untold Story
Fine Grained Complexity
On the Parameterized Complexity of Simultaneous Deletion Problems