My current interests are in Algorithms and Complexity, particularly Parameterized Complexity and Approximation Algorithms. I mainly work on graph partitioning problems, and on parameterized problems in Euclidean space. I have also worked on parameterizations in other complexity paradigms like communication complexity, streaming algorithms and query complexity.
Principal Investigator
- Multi-Robot Reconfiguration with Constraints at Intermediate Time-Steps in Graphs Anusandhan National Research Foundation (ANRF)
Ph. D. Students
Ankit Chauhan
Area of Research: Algorithms and Graph Theory
Ashlesha Hota
Area of Research: Algorithms
Raghav Raju
Area of Research: Algorithm Design
