Research Interests :
Parameterized Complexity, Computational GeometryPublications : (Last Five, while at IITM)DBLP | View All
- On Finding Short Reconfiguration Sequences Between Independent Sets.

Authors :
Akanksha Agrawal,
Soumita Hait,
Amer E. MouawadAppeared in
33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea. (ISAAC 2022) ,LIPIcs, Vol 248, pp.39:1-39:14, Dec 2022
- A Finite Algorithm for the Realizabilty of a Delaunay Triangulation.

Authors :
Akanksha Agrawal,
Saket Saurabh ,
Meirav ZehaviAppeared in
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany. (IPEC 2022) ,LIPIcs, Vol 249, pp.1:1-1:16, Sep 2022
- Parameterized Complexity of Perfectly Matched Sets.

Authors :
Akanksha Agrawal,
Sutanay Bhattacharjee,
Satyabrata Jana,
Abhishek SahuAppeared in
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany. (IPEC 2022) ,LIPIcs, Vol 249, pp.2:1-2:13, Sep 2022
- Distance from Triviality 2.0: Hybrid Parameterizations.

Authors :
Akanksha Agrawal,
M. S. Ramanujan Appeared in
Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (IWOCA 2022) ,Lecture Notes in Computer Science, Vol 13270, pp.3-20, Jun 2022
- Parameterized Complexity of Minimum Membership Dominating Set.

Authors :
Akanksha Agrawal,
Pratibha Choudhary,
N.S. Narayanaswamy,
K. K. Nisha,
Vijayaragunathan RamamoorthiAppeared in
WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings (WALCOM 2022) ,Lecture Notes in Computer Science, Vol 13174, pp.288-299, Mar 2022
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) |