معرفی
Fedor Fomin is a Professor in Algorithms at the Department of Informatics, University of Bergen, Norway, since 2002. His research focuses on fundamental problems in computer science and mathematics, particularly in algorithm design and graph theory.
Research Interests: His work spans advanced algorithmic techniques such as
- Matroid algorithms
- Algorithmic graph minors
- Treewidth and its applications
- Exact and exponential time algorithms
- Pursuit-evasion games and graph searching
- Parameterized algorithms and kernelization
- Graph coloring
Publications: He has authored over 150 peer-reviewed journal articles in venues like J. ACM, SIAM J. Computing, and Combinatorica, alongside 160 conference papers in top-tier events including FOCS, STOC, and AAAI. His research demonstrates expertise in bridging theoretical computer science and discrete mathematics.
Scientific Awards:
- EATCS Fellow (2019)
- ERC Advanced Investigator Grant (2010)
- EATCS-IPEC Nerode Prize 2017 (with F. Grandoni and D. Kratsch)
- EATCS-IPEC Nerode Prize 2015 (with E. D. Demaine, M. T. Hajiaghayi, and D. M. Thilikos)
- Norway's Outstanding Young Investigator Award (2005)
Grants: He has secured major grants from The Research Council of Norway (NFR), the Russian Ministry of Education and Science (mega-grant), and the European Research Council (ERC) as Principal Investigator.
