Saket Saurabh

Saket Saurabh is a Professor at the Institute of Mathematical Sciences (IMSc), Chennai, India, and an Adjunct Faculty at the University of Bergen, Norway. He holds a PhD in Theoretical Computer Science (TCS) from IMSc (2008). His research focuses on Parameterized Complexity, Exact Exponential Algorithms, Graph Theory, Algorithmic Game Theory, and Theoretical Foundations of Machine Learning.

Before joining IMSc, he held postdoctoral positions at the University of Bergen (2007–2009) and was a Research Assistant there (2006–2007). He teaches advanced courses such as Parameterized Complexity, Kernelization, and Algorithms for Big Data. His work emphasizes developing efficient algorithms for NP-hard problems through techniques like kernelization and fixed-parameter tractability.

His publications primarily address graph algorithms, parameterized complexity, and algorithm design, with contributions to meta-kernelization frameworks, representative families, and lower bounds for clique-width parameterizations. Notable collaborations include seminal work on graph isomorphism for bounded treewidth graphs and the fixed-parameter tractability of minimum bisection.