معرفی
Akanksha Agrawal is an Assistant Professor and Veena and Induprakas Keri Faculty Fellow at the Department of Computer Science and Engineering, Indian Institute of Technology Madras. Her research focuses on Parameterized Complexity & Algorithms, Graph Algorithms, Computational Geometry, Exact Algorithms, and Fine Grained Algorithms & Complexity. She has held postdoctoral positions at Ben-Gurion University of the Negev (Israel) and the Hungarian Academy of Sciences, funded by a PBC Fellowship. She earned her Ph.D. from the University of Bergen under Professors Saket Saurabh and Daniel Lokshtanov.
Education:
- Ph.D., University of Bergen, Norway (2017-2021)
- Postdoctoral Researcher, Ben-Gurion University of the Negev, Israel (2021-2022)
- Postdoctoral Researcher, Hungarian Academy of Sciences, Hungary (2022-2023)
Research Interests: Her work emphasizes parameterized complexity, graph algorithms, and computational geometry. She explores exact algorithms, fine-grained complexity, and algorithmic approaches to NP-hard problems. Her research bridges theoretical insights with practical algorithmic solutions.
Recent Activities & Awards:
- ACM-India Eminent Speaker (2024-2026)
- Invited Talks: COMSNETS 2025, IISc Bengaluru (2024), Bali Parameterized Graph Algorithms (2024)
- Program Committee Roles: IPEC 2025 (Co-Chair), WG 2025, CALDAM 2025
Grants & Academic Services:
- Organizing Dagstuhl Seminar (Jan. 2025) with Maria Chudnovsky, Daniel Paulusma, and Oliver Schaudt
- Contributions to international conferences and workshops
Teaching: Courses include Combinatorial Objects, Parameterized Algorithms, Design & Analysis of Algorithms, Approximation Algorithms, and Advanced Data Structures.
