Home
  • E-mailFedor.Fomin@uib.no
  • Phone+47 55 58 40 24
  • Visitor Address
    HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen

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.

     

    Open acess publications in arXiv.

    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.

     

     

    The following list of publications is automatically generated (with some mistakes) from the national database CRIStin. 

     

    GraphModif 2019 +++ ALGORITHMIC TRACTABILITY VIA ​SPARSIFIERS +++ FraNorAC 2019 +++Worker +++ Escuela de Verano en Matematicas Discretas +++ New Horizons in Parameterized Complexity+++ SODA 2018 +++ CSR 2018 +++ IPEC 2018 +++ FAW 2018 +++ FUN 2018 +++ Recent Advances in Algorithms 2018 +++ WG 2018 +++ China-Norway FPT workshop 2018 +++ GRASTA 2018 +++ WEPA2018 +++MFCS 2019 +++ GRASTA 2017 +++BAIKAL 2017 +++ NET 2017 +++ Gutin60 Algorithmica special issue +++ Recent Advances in Algorithms +++ ESA 2017+++WADS 2017+++ WG 2017+++ Turing contest 2017 +++ Aspects of Computation +++ PCS School +++CS Club +++ Recent Advances in Parameterized Complexity +++Fine-Grained Complexity and Algorithm Design +++Counting Complexity and Phase Transitions +++ LATIN 2016 +++ CSR 2016 +++ FUN 2016 +++ DOOR 2016 +++ FSTTCS 2016+++ RANGOLI OF ALGORITHMS +++ Gutin60 +++ Randomization in Parameterized Complexity+++ School on Parameterized Algorithms +++STACS 2015 +++CIAC 2015 +++FAW 2015 +++NET 2015 +++TTCS 2015 +++WorKer 2015 +++EUROCOMB 2015 +++ SAT Lower Bounds +++FSTTCS 2015 +++GRASTA-MAC 2015 +++ ICALP 2012 +++ WG 2012 +++ Width-Minors-Matroids +++ IPEC 2012 +++ GRASTA 2012 +++ MFCS 2012 +++ ENUMEX +++ ICS 2012 +++ SOFSEM 2013 +++ LMNB conference 2013 +++ APEX 2013 +++ ICALP 2013 +++ Bidimensional Structures +++ CSR 2014 +++ WG 2014 +++GRASTA 2014 +++Exploiting Graph Structure in Algorithms +++FUN 2014 +++MFCS 2014 +++WorKer 2010 +++ GRASTA 2011 +++ ICALP 2011 +++ TW(BGO)-11 +++ WORKER 2011 +++ SWAT 2012 +++ WG 2003 +++ ESA 2004 +++ WG 2004 +++ WG 2005 +++ STACS 2006 +++ LATIN 2006 +++ SIROCCO 2006 +++ GRASTA 2006 +++ IWPEC 2006 +++ SODA 2007 +++ MFCS 2007 +++ LATIN 2008 +++ WG 2008 +++ IWPEC 2008 +++ SWAT 2008 +++ COCOA 2008 +++ SOFSEM 2009 +++ WorKer 2009 +++ TAMC 2009 +++ WG 2010 +++ TAMC 2010 +++ MFCS 2010 +++ FSTTCS 2010+++