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

Since 2002, I am a professor in computer science at the University of Bergen, doing research in Algorithms and Combinatorics. My Master (1992) and PhD (1997) degrees are from the Faculty of Mathematics and Mechanics, St. Petersburg State University and my supervisor was Prof. Nikolay Petrov. Here is a link to my page at the Mathematics Genealogy Project.


Editorial Boards

Algorithmica +++ SIAM J. Discrete Mathematics (SIDMA) +++ Information and Computation +++ Theoretical Computer Science +++ Diskretnyi Analiz i Issledovanie Operatsii

Conference Program Committee Chair

CSR 2018 ICALP 2013 SWAT 2012 IWPEC 2009 WG 2006

Conference Program Committees

SOSA 2022+++ WG 2022+++ FUN 2022+++ CSR 2022+++ WALCOM 2022+++ LATIN 2022+++ HALG 2022+++ ESA 2022+++ STOC 2021+++ MOTOR 2021+++ MFCS 2020+++ WEPA 2020+++ MFCS 2019+++ WEPA2018+++ SODA 2018 +++ IPEC 2018 +++ FAW 2018 +++ FUN 2018 +++ ESA 2017+++ WADS 2017+++ WG 2017+++ LATIN 2016 +++ CSR 2016 +++ FUN 2016 +++ STACS 2015 +++ CIAC 2015 +++ FAW 2015 +++ TTCS 2015 +++ EUROCOMB 2015 +++ FSTTCS 2015 +++ CSR 2014 +++ WG 2014 +++ FUN 2014 +++ MFCS 2014 +++ SOFSEM 2013 +++ ICALP 2012 +++ WG 2012 +++ IPEC 2012 +++ MFCS 2012 +++ ICALP 2011 +++ WG 2010 +++ TAMC 2010 +++ MFCS 2010 +++ FSTTCS 2010+++ SOFSEM 2009 +++ TAMC 2009 +++ LATIN 2008 +++ WG 2008 +++ IWPEC 2008 +++ SWAT 2008 +++ COCOA 2008 +++ SODA 2007 +++ MFCS 2007 +++ STACS 2006 +++ LATIN 2006 +++ SIROCCO 2006 +++ IWPEC 2006 +++ WG 2005 +++ ESA 2004 +++ WG 2004 +++ WG 2003

Conferences/schools/workshops organization

Frontiers of Parameterized Complexity: Online seminar and Youtube channel

Research Schools: School on Parameterized Algorithms Bedlewo 2014 +++ Recent Advances in Algorithms St. Petersburg 2017 +++ Recent Advances in Parameterized Complexity Tel Aviv 2017 +++ Recent Advances in Algorithms St. Petersburg 2018 +++ Bergen Algorithms Schools

WorKer (Workshop on Kernelization): WorKer 2009 +++ WorKer 2010 +++ WorKer 2011 +++ WorKer 2015 +++ WorKer 2019

GRASTA (Graph Searching) GRASTA 2006 +++GRASTA 2011 +++ GRASTA 2012 +++ GRASTA 2014 +++ GRASTA-MAC 2015 +++ GRASTA 2017 +++ GRASTA 2018

Dagstuhl Seminars: 08431 (Moderately Exponential Time Algorithms) +++ 11071 (Theory and Applications of Graph Searching Problems) +++ 13121 (Bidimensional Structures: Algorithms, Combinatorics and Logic) +++ 17041 (Randomization in Parameterized Complexity) +++ 19041 (New Horizons in Parameterized Complexity)

Unordered collection of other events