Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
Parameterized Complexity, Computational Geometry, Graph Algorithms, Exact Algorithms, Fine Grained Complexity, and Streaming Algorithms. |
Teaching Actvities (while with the theory group - since Jan 2011)
- Advanced Data Stuructures and Algorithms - Jul-Nov, 2022
- Parameterized Algorithms - Jan-Apr, 2022
- Topics in Design and Analysis of Algorithms (Kernelization) - Aug-Nov, 2021
- Recent Developments in Theoretical Computer Science (Parameterized Algorithms) - Feb-May, 2021
Publications (while with the group, last 10)
See here for all publications while at IITM
- 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 - 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 - 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 - Distance From Triviality 2.0: Hybrid Parameterizations
Authors: Akanksha Agrawal, M.S. Ramanujan
International Workshop on Combinatorial Algorithms (IWOCA), Jun 2022 - Fine-grained complexity of rainbow coloring and its variants
Authors: Akanksha Agrawal
Journal of Computer and System Sciences, Vol 124, Mar 2022 - Parameterized Complexity of Minimum Membership Dominating Set
Authors: Akanksha Agrawal, Pratibha Choudhary, Narayanaswamy N S, Nisha K K, Vijayaraghunathan Ramamoorthi
WALCOM, 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 - Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH
Authors: Akanksha Agrawal, Allumalla Ravi Kiran, Dhanekula Varun Teja
16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Sep 2021 - A Polynomial Kernel for Deletion to Ptolemaic Graphs
Authors: Akanksha Agrawal, Aditya Anand, Saket Saurabh
16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Aug 2021