Publications in this Area
(listing only last 10)
- Computing Square Colorings on Bounded-Treewidth and Planar Graphs
Authors: Akanksha Agrawal, Daniel Marx, Daniel Neuen, Jasper Slusallek
ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), Jan 2023 - On finding short reconfiguration sequences between independent sets
Authors: Akanksha Agrawal, Soumita Hait, Amer E. Mouawad
The 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022 - On Rotation Distance, Transpositions and Rank Bounded Trees
Authors: Anoop S K M, Jayalal Sarma
28th International Computing and Combinatorics Conference (COCOON 2022), Oct 2022 - A Finite Algorithm for the Realizability of a Delaunay Triangulation
Authors: Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
The 17th International Symposium on Parameterized and Exact Computation (IPEC), Sep 2022 - Parameterized Complexity of Perfectly Matched Sets
Authors: Akanksha Agrawal, Sutanay Bhattacharjee, Abhishek Sahu, Satyabrata Jana
The 17th International Symposium on Parameterized and Exact Computation (IPEC), Sep 2022 - Distance From Triviality 2.0: Hybrid Parameterizations
Authors: Akanksha Agrawal, M.S. Ramanujan
International Workshop on Combinatorial Algorithms (IWOCA), Jun 2022 - Parameterized Complexity of Minimum Membership Dominating Set
Authors: Akanksha Agrawal, Pratibha Choudhary, Narayanaswamy N S, Nisha K K, Vijayaraghunathan Ramamoorthi
WALCOM, Mar 2022 - Fine-grained complexity of rainbow coloring and its variants
Authors: Akanksha Agrawal
Journal of Computer and System Sciences, Vol 124, Mar 2022 - Succinct Data Structure for Path Graphs
Authors: Girish Balakrishnan, Sankardeep Chakraborty, Narayanaswamy N S, Kunihiko Sadakane
Data Compression Conference (DCC 2022), Mar 2022 - Deleting, Eliminating and Decomposing to Hereditary Graph Classes Are All FPT Equivalent
Authors: Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Jan 2022