Saket Saurabh

About me

I am a Professor of Theoretical Computer Science at the Institute of Mathematical Sciences, Chennai, India. I am also affiliated to Department of Informatics, University of Bergen, Norway (as a Professor).

My other affiliations include Adjunct Professor at Indian Statistical Institute (ISI) Kolkata (2019-2024) and a member of IRL 2000 ReLaX.

I am interested in designing efficient algorithms (or prove it does not exist) for hard problems arising in every domain. In particular I design algorithms whose running time is analyzed in terms of different input parameters. In particular, I am interested in Multivariate Complexity or its two variable avatar Parameterized Complexity. My other interests include Graph Theory, Matroids, Matching Theory and Approximation Algorithms. In short my current research interests include:

  • ​Parameterized Complexity

  • Moderately Exponential Time Algorithms

  • Graph Theory

  • Approximation Algorithms

Forthcoming Events:

ICALP22, IWDG-2021, GTA2021, PC 301, IMSc Weekly PC Seminar, Frontiers of PC