Rate My Professor Petr Golovach

Prior to his appointment at the University of Bergen, Golovach taught at Syktyvkar State University in Russia from 1991 to 2007, where he delivered courses on programming, discrete mathematics, combinatorial algorithms, graph theory, matroid theory, and computational complexity. From 2009 to 2011, he taught at Durham University in the United Kingdom, covering advanced theory of computation and formal aspects of computer science. At the University of Bergen, his teaching includes advanced theory of computation, advanced algorithms techniques (INF 334 in 2015), and selected topics in algorithms and complexity, such as enumeration algorithms (INF 339 in 2018). He has supervised PhD students, including Nidhi Purohit on matrix clustering with size constraints, and master's students such as Øyving Stette Haarberg on the complexity of edge-editing to a connected graph of bounded degree (2019) and Andreas Steinvik on kernelization for balanced graph clustering (2020). Golovach organized the Dagstuhl Seminar 18381 on “Algorithmic enumeration: output-sensitive, input-sensitive, parameterized, approximative” in 2018. He has served on program committees for STACS 2020, IPEC 2019, WG 2019 and 2016, WEPA 2018, and SWAT 2014, and chaired the program committee for IPEC 2021.