Fedor Fomin

Fedor V. Fomin is a professor of Computer Science at the University of Bergen. He is known for his work in algorithms and graph theory.

Books[]

Fomin is the co-author of three books:

• Fomin, Fedor V.; Kratsch, Dieter (2010). Exact Exponential Algorithms. Springer. p. 203. ISBN 978-3-642-16532-0.
• Cygan, Marek; Fomin, Fedor V.; Kowalik, Lukasz; Lokshtanov, Daniel; Marx, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal; Saurabh, Saket (2015). Parameterized Algorithms. Springer. p. 555. ISBN 978-3-319-21274-6.
• Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav (2019). Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press. p. 528. doi:10.1017/9781107415157. ISBN 978-1107057760.

Awards and honours[]

With his co-authors Erik Demaine, Mohammad Hajiaghayi, and Dimitrios Thilikos, he received the 2015 European Association for Theoretical Computer Science Nerode Prize for his work on bidimensionality.^[1] Together with Fabrizio Grandoni and Dieter Kratsch, he received the 2017 Nerode Prize for his work on Measure & Conquer. In 2019 Fomin was named an EATCS Fellow for "his fundamental contributions in the fields of parametrized complexity and exponential algorithms".^[2] Fomin is elected member of the Norwegian Academy of Science and Letters, the Norwegian Academy of Technological Sciences, and the Academia Europaea.

References[]

External links[]

• Official website
• Fedor V. Fomin at DBLP Bibliography Server
• Fedor V. Fomin publications indexed by Google Scholar