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
- Parameterized Complexity for Euclidean Geometry
Ph. D. Students
Bithika Pal
Area of Research: Machine learning
Narayan Sharma
Area of Research: Algorithms
