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. |
Current Students
See here for former students
- Sutanay Bhattacharjee (Ph.D.)
- Hindanjali Harwanshi (M.Tech)
Teaching Actvities (while with the theory group - since Jan 2011)
- 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
- 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