Fedor Fomin#

Membership Number:4989
Membership type:ORDINARY
Main Country of Residence:NORWAY

Present and Previous Positions

  • 2002 - now Professor in Algorithms, Department of Informatics, University of Bergen, Norway
  • 2014 - 2016 Leading scientist, Algorithmic Methods Laboratory, St. Petersburg Department of Steklov Institute of Mathematics, Russia
  • 2001 - 2002 Postdoctoral fellow, Heinz Nixdorf Institut, Paderborn University, Germany
  • 2000 - 2000 Postdoctoral fellow, Centro de Modelamiento Matemático, Universidad de Chile and UMR 2071-CNRS, Chile
  • 1997 - 2000 Assistant professor, Faculty of Mathematics and Mechanics, St. Petersburg State University, Russia

Fields of Scholarship
  • Matroid algorithms
  • Algorithmic graph minors
  • Treewidth
  • Exact (exponential time) algorithms
  • Pursuit-evasion and graph searching
  • Parameterized algorithms and kernelization
  • Graph coloring

Honours and Awards
  • 2019Elected EATCS Fellow
  • 2010 ERC advanced grant
  • The EATCS-IPEC Nerode Prize 2017 for outstanding paper in the area of multivariate algorithmics (paper F. V. Fomin, F. Grandoni, and D. Kratsch, A Measure & Conquer approach for the analysis of exact algorithms, Journal of the ACM 56 (5) article No. 25, (2009)
  • The EATCS-IPEC Nerode Prize 2015 for outstanding paper in the area of multivariate algorithmics (paper E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, Journal of the ACM 52 (6), (2005), pp. 866-893
  • Outstanding Young Investigator Award (Yngre fremragende forskere (YFF)) The Research Council of Norway (NFR) (2005, Norway)

Imprint Privacy policy « This page (revision-8) was last changed on Monday, 14. June 2021, 13:59 by System
  • operated by