معرفی
Saket Saurabh is a Professor at the Department of Informatics, University of Bergen. His research focuses on parameterized complexity, algorithms, graph theory, and combinatorial optimization. He has contributed extensively to theoretical computer science, with a strong emphasis on algorithm design and analysis for NP-hard problems.
His work includes studies on graph algorithms, approximation schemes, and fairness in computational problems. Recent publications address topics such as minimum membership dominating sets, hybrid clustering, and fair hitting set problems. Saurabh has collaborated widely, with co-authors like Fedor Fomin, Petr Golovach, and others.
Key research interests include parameterized algorithms for graph problems, exponential-time approximation methods, and structural graph theory. His contributions have advanced the understanding of computational complexity and practical algorithmic solutions for challenging problems.
