Fedor Fomin
Fedor V. Fomin | |
|---|---|
Фёдор Владимирович Фомин | |
| Born | 1968 (age 57–58) |
| Education | St. Petersburg State University |
| Known for | bidimensionality, measure and conquer, kernelization |
| Awards | Nerode Prize ×3, ACM Fellow, EATCS Fellow |
| Scientific career | |
| Fields | Algorithms, parameterized complexity, graph theory |
| Workplaces | University of Bergen |
| Thesis | Задачи преследования и поиска на графах (Pursuit-evasion and Search Problems on Graphs) (1997) |
| Nikolai Nikolaevich Petrov | |
Fedor V. Fomin (born 1968) is a Russian-Norwegian computer scientist and professor of computer science at the University of Bergen. He works in parameterized complexity, exact exponential algorithms, and graph algorithms, and is known in particular for bidimensionality theory, the measure-and-conquer technique for analysing exponential-time algorithms, and results on kernelization. He has co-authored three books on algorithms, including the textbook Parameterized Algorithms (2015).
He is a three-time recipient of the Nerode Prize, an EATCS Fellow, and an ACM Fellow, and is an elected member of the Norwegian Academy of Science and Letters, the Norwegian Academy of Technological Sciences, and the Academia Europaea.