Akanksha Agrawal

Employment

• Indian Institute of Technology Madras Assistant Professor
  2020 - Present
• Ben-Gurion University of the Negev Postdoc
  2019 - 2020
• Hungarian Academy of Sciences Postdoc
  2018 - 2019

Education

• University of Bergen Ph.D.
  2015 - 2017
• Indian Institute of Science M.Sc.(Engg.)
  2012 - 2014

Projects & Funding

Projects & funding information is unavailable.

Publications (41)

• FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding
  CoRR 2019
  +Save
• Interval Vertex Deletion Admits a Polynomial Kernel
  Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019 2019 DOI: 10.1137/1.9781611975482.103
  +Save
• Parameterized Complexity of Conflict-Free Matchings and Paths
  44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany 2019 DOI: 10.4230/LIPIcs.MFCS.2019.35
  +Save
• Path Contraction Faster Than 2\(^\mboxn\)
  46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece 2019 DOI: 10.4230/LIPIcs.ICALP.2019.11
  +Save
• Quadratic Vertex Kernel for Split Vertex Deletion
  Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings 2019 DOI: 10.1007/978-3-030-17402-6\_1
  +Save
• Split Contraction: The Untold Story
  TOCT 2019 DOI: 10.1145/3319909
  +Save
• Connecting the Dots (with Minimum Crossings)
  35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA 2019 DOI: 10.4230/LIPIcs.SoCG.2019.7
  +Save
• Hitting and Covering Partially
  Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings 2018 DOI: 10.1007/978-3-319-94776-1\_62
  +Save
• Simultaneous Feedback Vertex Set: A Parameterized Perspective
  TOCT 2018 DOI: 10.1145/3265027
  +Save
• Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems
  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA 2018 DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.1
  +Save