Petr Golovach

Petr Golovach is a Research Professor at the Department of Informatics, University of Bergen. His research focuses on Discrete Mathematics and Theoretical Computer Science, particularly graph theory, algorithms, parameterized complexity, and clustering. He has held academic positions at Syktyvkar State University (1991–2007), Durham University (2009–2011), and currently teaches advanced courses like Advanced Algorithms Techniques and Enumeration Algorithms at the University of Bergen.

His research interests include graph algorithms, parameterized complexity, matroid theory, and algorithmic enumeration. He has organized notable events like the Dagstuhl Seminar 2018 and serves on program committees for STACS, IPEC, and SWAT. Notable contributions include work on hybrid clustering algorithms, graph cuts under matroid constraints, and parameterized tractability of path and cycle problems.

He has supervised PhD students like Nidhi Purohit and master’s students including Øyving Stette Haarberg and Andreas Steinvik. His publications span over 200 peer-reviewed papers in top venues such as Journal of the ACM and conferences like SODA and ICALP. His research bridges extremal combinatorics with algorithm design, emphasizing practical and theoretical advancements in graph-based problems.