Fedor Fomin is a Professor at the Department of Informatics, Faculty of Mathematics and Natural Sciences, University of Bergen. He is renowned for his contributions to theoretical computer science, particularly in parameterized complexity and exact exponential algorithms, earning him the ACM Fellow 2023 distinction. University: University of Bergen School: Faculty of Mathematics and Natural Sciences Department: Department of Informatics Academic Rank: Professor Research Interests: Fomin's work focuses on designing efficient algorithms for computationally hard problems, with a specialization in parameterized and exact exponential algorithms. His research spans graph theory, combinatorial optimization, and computational complexity, addressing foundational challenges in sparse graphs, planar graphs, and treewidth-based techniques. Key Contributions: His research includes kernelization methods, subexponential algorithms for planar graphs, and novel approaches to edge domination and satisfiability problems. He has published extensively in top venues like STOC, FOCS, and SODA. Awards: ACM Fellow 2023 EATCS Award 2019 ERC Advanced Grant 2016 Nordic Researcher Award in Theoretical Computer Science 2010 Publications: His work covers parameterized algorithms for cluster editing, feedback vertex sets, and induced subgraph problems, with applications in computational biology and network science. Collaborations: Fomin collaborates with leading researchers in theoretical computer science, including Petr Golovach and Saket Saurabh, mentoring numerous PhD students and shaping the field's future.








