Fedor Fomin received his Master (1992) and PhD (1997) degrees from the Faculty of Mathematics and Mechanics, St. Petersburg State University. Here is a link to his page at the Mathematics Genealogy Project. In 2002, after doing postdocs in Chile (Universidad de Chile), Czech Republic (Charles University), and in Germany (University of Paderborn), he joined the Department of Informatics, University of Bergen, as the professor in Algorithms.
His current research interests are mainly in Algorithms and Combinatorics: Parameterized Algorithms and Kernelization +++ Exact (exponential time) Algorithms +++ Low-rank Matrix Approximation and Clustering +++ Algorithmic Foundations of Machine Learning+++ Graph Algorithms +++ Matroid Algorithms +++ Algorithmic Graph Minors +++ Sparse Graphs +++ Tournaments +++ Metric Embeddings +++ Graph Coloring +++ Graph Homomorphisms +++Treewidth +++ Pursuit-evasion and graph searching.