Brief CV

• Since 2002 professor at the University of Bergen
• Academic family

Research:   Theoretical Computer Science, including

• Graph Algorithms
• Parameterized Complexity
• Combinatorics
• Algorithmic Foundations of Machine Learning
• Combinatorial Games. 

Awards and Honors

• ERC Advanced Grant (2025)
• ACM (Association for Computing Machinery) Fellow  (2024) for "contributions to the development of parameterized complexity and exact exponential algorithms".
• Member of the Norwegian Academy of Science and Letters (Det Norske Videnskaps Akademi, DNVA) since 2021
• Member of the Norwegian Academy of Technological Sciences (Norges tekniskevitenskapsakademi, NTVA) since 2021
• Member of Academia Europaea since 2019
• EATCS Fellow (2019) for "his fundamental contributions in the fields of parametrized complexity and exponential agorithms"
• ERC Advanced Grant (2011) 

Books (with links to free downloads)

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi, Kernelization. Theory of Parameterized Preprocessing, Cambridge University Press, 2019. Amazon link. Free downloadable version and errata are available from here.

Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh, Parameterized Algorithms, Springer, 2015. Amazon link. Free downloadable version and errata are available from here.

Fedor V. Fomin and Dieter Kratsch, Exact Exponential Algorithms, Springer, 2010. Amazon link. Free downloadable version and errata are available from here.

Most of my publications are available through DBLP and arXiv 

 Journal publications