Research Publications/Reports
Listing last 25 publications. (View All) View/Hide Filter- Fine-grained complexity of rainbow coloring and its variants
Akanksha Agrawal, Appeared in Journal of Computer and System Sciences, Vol 124, Mar 2022.
- Parameterized Complexity of Minimum Membership Dominating Set
Akanksha Agrawal, Pratibha Choudhary, Narayanaswamy N S, Nisha K K, Vijayaraghunathan Ramamoorthi, Appeared in WALCOM, Mar 2022.
- Deleting, Eliminating and Decomposing to Hereditary Graph Classes Are All FPT Equivalent
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi, Appeared in ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), Jan 2022.
- Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH
Akanksha Agrawal, Allumalla Ravi Kiran, Dhanekula Varun Teja, Appeared in 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Sep 2021.
- A Polynomial Kernel for Deletion to Ptolemaic Graphs
Akanksha Agrawal, Aditya Anand, Saket Saurabh, Appeared in 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Aug 2021.
- Paths to Trees and Cacti
Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale, Appeared in Theoretical Computer Science, Vol 860, Mar 2021.
- An FPT Algorithm for Elimination Distance to Bounded Degree Graphs
Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Appeared in Symposium on Theoretical Aspects of Computer Science (STACS 2021), Mar 2021.