|
Akanksha Agrawal
Assistant Professor
Email : akanksha [at] cse [dot] iitm [dot] ac [dot] in | Phone : (+91)-44-2257-4391
Lab(s) : RAnG.
Link to Personal Homepage
|
Research Interests :
Parameterized Complexity, Computational GeometryPublications : (Last Five, while at IITM)DBLP | View All
- Recognizing well-dominated graphs is coNP-complete.
Authors :
Akanksha Agrawal,
Henning Fernau,
Philipp Kindermann,
Kevin Mann,
Uverton S. SouzaAppeared in
Inf. Process. Lett., Vol 183, pp.106419, Jan 2024
- Brief Announcement: Local Problems in the SUPPORTED Model.
Authors :
Akanksha Agrawal,
John Augustine,
David Peleg,
Srikkanth RamachandranAppeared in
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023 (PODC 2023) ,pp.172-175, Jun 2023
- Clustering What Matters: Optimal Approximation for Clustering with Outliers.
Authors :
Akanksha Agrawal,
Tanmay Inamdar ,
Saket Saurabh ,
Jie Xue Appeared in
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp.6666-6674, Feb 2023
- Computing Square Colorings on Bounded-Treewidth and Planar Graphs.
Authors :
Akanksha Agrawal,
Dniel Marx,
Daniel Neuen,
Jasper SlusallekAppeared in
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023 (SODA 2023) ,pp.2087-2110, Jan 2023
- Parameterized complexity of perfectly matched sets.
| Jan 2023 - May 2023 | : | - Approximation Algorithms (CS6841) |
| Jan 2022 - Apr 2022 | : | - Topics in Design and Analysis of Algorithms (CS6100) |
| Aug 2021 - Dec 2021 | : | - Topics in Design and Analysis of Algorithms (CS6100) |
| Feb 2021 - May 2021 | : | - Recent Developments in Theoretical Computer Science (CS6190) |
