|
Akanksha Agrawal
Assistant Professor Email : akanksha [at] cse [dot] iitm [dot] ac [dot] in | Phone : 4391
Link to Personal Homepage
|
Research Interests :
Parameterized Complexity, Computational GeometryPublications : (Last Five, while at IITM)DBLP | View All
- Fine-grained complexity of rainbow coloring and its variants.

Authors :
Akanksha AgrawalAppeared in
J. Comput. Syst. Sci., Vol 124, pp.140-158, Jan 2022
- Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH.

Authors :
Akanksha Agrawal,
Ravi Kiran Allumalla,
Varun Teja DhanekulaAppeared in
16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal. (IPEC 2021) ,LIPIcs, Vol 214, pp.2:1-2:12, Sep 2021
- A Polynomial Kernel for Deletion to Ptolemaic Graphs.

Authors :
Akanksha Agrawal,
Aditya Anand,
Saket Saurabh Appeared in
16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal. (IPEC 2021) ,LIPIcs, Vol 214, pp.1:1-1:15, Sep 2021
- An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.

Authors :
Akanksha Agrawal,
Lawqueen Kanesh,
Fahad Panolan,
M. S. Ramanujan ,
Saket Saurabh Appeared in
38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrcken, Germany (Virtual Conference). (STACS 2021) ,LIPIcs, Vol 187, pp.5:1-5:11, Mar 2021
- Simultaneous Feedback Edge Set: A Parameterized Perspective.

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) |