- fedor.fomin@uib.no
- Phone number
- +47 55584024
- Visitor address
-
HIB - Thormøhlens gate 55
5006 Bergen - Postal address
-
P.O. Box 7803NO-5020 BergenNorway
Short info
Research
My research area is Theoretical Computer Science, and my current research interests are Graph Algorithms, Parameterized Complexity, Combinatorics, Algorithmic Foundations of Machine Learning, and Combinatorial Games.
Outreach
Publications
2025
2024
- Bentert, Matthias; Fomin, Fedor; Hauser, Fanny et al. (2024). The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. (external link)
- Fomin, Fedor; Golovach, Petr; Inamdar, Tanmay et al. (2024). FPT approximation and subexponential algorithms for covering few or many edges. (external link)
- Bandyapadhyay, Sayan; Fomin, Fedor; Simonov, Kirill (2024). On coresets for fair clustering in metric and Euclidean spaces and their applications. (external link)
See a complete overview of publications in Cristin.
Books (with links to free downloads)
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi, Kernelization. Theory of Parameterized Preprocessing, Cambridge University Press, 2019. Amazon link. Free downloadable version and errata are available from here.
Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh, Parameterized Algorithms, Springer, 2015. Amazon link. Free downloadable version and errata are available from here.
Fedor V. Fomin and Dieter Kratsch, Exact Exponential Algorithms, Springer, 2010. Amazon link. Free downloadable version and errata are available from here.
arXiv +++ Journal publications
The following list of publications is automatically generated from the Norwegian national database CRIStin.