Short CV: Fedor V. Fomin (Фёдор Владимирович Фомин)

I received my Master (1992) and PhD (1997) degrees from the Faculty of Mathematics and Mechanics, St. Petersburg State University, supervised by Prof. Nikolay Petrov. Here is a link to my page at the Mathematics Genealogy Project. I was an assistant professor at St. Petersburg State University (chair of Operations Research) till 1999. I was a postdoc in Chile (CMM and Universidad de Chile), in Czech Republic (ITI and Charles University), and in Germany (University of Paderborn). Since 2002, I am a professor in Algorithms, at the Department of Informatics, University of Bergen. In 2004 I received Young Investigator Award (YFF) from Norwegian Research Council. In 2011-2016 I was leading the project Rigorous Theory of Preprocessing funded by ERC via the Advanced Investigator Grant. I am also heading the Russian-funded mega project on Algorithms and complexity beyond polynomial time , which aims to build up the theoretical computer science research infrastructure at St. Petersburg Department of Steklov Institute of Mathematics.



Research

My current research interests are mainly in Algorithms and Combinatorics: Parameterized Complexity, Algorithms, and Kernelization +++ Exact (exponential time) Algorithms +++ Graph Algorithms and, in particular, Algorithmic Graph Minors +++ Graph Coloring and different modifications +++ Graph widths parameters (treewidth, branchwidth, clique-width, etc.) +++ Pursuit-evasion and search problems.

PhD students

Frederic Dorn (2007) +++ Serge Gaspers (2008) +++ Alexey Stepanov (2008) +++ Michał Pilipczuk (2013)+++ Pål Grønås Drange (2015) +++ Torstein Strømme

Postdocs (past and present)

Isolde Adler +++ Manu Basavaraju +++ Frederic Dorn +++ Archontia C. Giannopoulou +++ Petr Golovach +++ Erik Jan van Leeuwen +++ Fahad Panolan+++ Marcin Pilipczuk +++ Artem Pyatkin +++ Arash Rafiey +++ Saket Saurabh +++ Yngve Villanger

Member of Editorial Boards

Algorithmica +++ SIAM J. Discrete Mathematics (SIDMA) +++ Information and Computation +++ Journal of Discrete Algorithms +++ Theoretical Computer Science

Conference PC Chair

ICALP 2013 SWAT 2012 IWPEC 2009 WG 2006

Past events (talks, conference PCs, organization, etc.)

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+++ WorKer 2010 +++ GRASTA 2011 +++ ICALP 2011 +++ TW(BGO)-11 +++ WORKER 2011 +++ SWAT 2012 +++ 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 +++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 +++ Fine-Grained Complexity and Algorithm Design +++ Counting Complexity and Phase Transitions +++ LATIN 2016 +++ CSR 2016 +++ FUN 2016 +++ DOOR 2016

Steering Committees

IPEC (2010-2012, chair 2011-2012) +++ WG (from 2010)