Brief CV

• Master (1992) and PhD (1997) from St. Petersburg State University
• Postdocs: Universidad de Chile, Charles University, and Paderborn University
• 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. 

Editorial Boards:

• Algorithmica
• SIAM J. Discrete Mathematics (SIDMA)
• Information and Computation (I&C)
• Theoretical Computer Science (TCS)
• Innovations in Graph Theory (IGT)
• Journal of Applied and Industrial Mathematics

Program Committee Chairing:

• 2025 COCOON (International Computing and Combinatorics Conference)
• 2018 CSR (International Computer Science Symposium in Russia)
• 2013 ICALP (International Colloquium on Automata, Languages and Programming) (Track A)
• 2012 SWAT (Scandinavian Symposium and Workshops on Algorithm Theory)
• 2009 IWPEC (International Workshop on Parameterized and Exact Computation)
• 2006 WG (Workshop on Graph Theoretic Concepts in Computer Science)

Awards and Honors

• ERC Advanced Grant (2025)
• The EATCS-IPEC Nerode Prize 2024 for outstanding paper in the area of multivariate algorithmics (paper Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos, (Meta) Kernelization, Journal of the ACM 63 (5), article No. 44, (2016).)
• 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".
• The EATCS-IPEC Nerode Prize 2017 for outstanding paper in the area of multivariate algorithmics (paper Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch, A Measure & Conquer approach for the analysis of exact algorithms, Journal of the ACM 56 (5) article No. 25, (2009).)
• The EATCS-IPEC Nerode Prize 2015 for outstanding paper in the area of multivariate algorithmics (paper Erik D. Demaine, Fedor V. Fomin, Mohammad T. Hajiaghayi, and Dimitrios M. Thilikos, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, Journal of the ACM 52 (6), (2005), pp. 866–893.)
• 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