Dr. Ashutosh Rai did his PhD in Theoretical Computer Science from The Institute of Mathematical Sciences (IMSc), Chennai. He works in the area of Parameterized Complexity and Graph Algorithms. In particular, he has worked on arriving at fast Fixed Parameter Tractable (FPT) algorithms and finding small kernels for NP-hard graph modification problems. More recently, he has been working on the interplay between parameterized and approximation algorithms.
He has held postdoctoral positions at Hong Kong Polytechnic University and at Charles University in Prague.
His current research interests are: Parameterized Complexity, Kernelization, Parameterized Approximation, Extension Complexity, Connections between Classical and Parameterized Complexity.
Office: B-511 (R&D Block)