معرفی
Saurabh Saket is a Professor in Algorithms at the Department of Informatics, University of Bergen, Norway (since 2013), and concurrently a Professor at the Institute of Mathematical Sciences, India (since 2009). Previously, he was a Postdoctoral Fellow at the Department of Informatics, University of Bergen (2007–2009).
His research focuses on parameterized algorithms, kernelization, exact algorithms, matroid algorithms, algorithmic graph minors, treewidth, and approximation algorithms. He has made breakthrough contributions to complexity theory, kernelization preprocessing, and exact exponential-time algorithms, with key results published in top venues like Journal of the ACM, SODA, FOCS, and STOC.
Awards and Grants
- 2020: Fellow of Indian Academy of Sciences
- 2019: Outstanding Young Researcher Meltzer Award (Norway)
- 2017–2018: Swarnajayanti Fellowship (India)
- 2019–2024: ERC Consolidator Grant 'LOPRE'
- 2013–2017: ERC Starting Grant 'PARAPPROX'
His work bridges parameterized complexity with approximation algorithms and has led to foundational results in algorithmic lower bounds, combinatorial optimization, and logic applications.
