Fedor V. Fomin

Fedor V. Fomin is a computer scientist known for work in algorithms, parameterized complexity, and graph theory. He has held positions at University of Bergen, University of Warsaw, and collaborated with researchers associated with CNRS, INRIA, Carnegie Mellon University, and University of California, Berkeley. His work connects topics in P vs NP problem, Fixed-parameter tractability, and structural graph theory such as treewidth and graph minors.

Early life and education

Fomin completed undergraduate studies at Saint Petersburg State University and pursued graduate research connected with institutions such as Russian Academy of Sciences and Steklov Institute of Mathematics. He later undertook doctoral studies at institutions collaborating with University of Bergen and worked with researchers affiliated with ETH Zurich, University of Warsaw, and Max Planck Institute for Informatics. During his formative years he engaged with research communities including International Conference on Graph Theory, ACM Symposium on Theory of Computing, and European Symposium on Algorithms.

Academic career

Fomin has held academic appointments at University of Bergen and University of Warsaw and has been a visiting researcher at University of California, Berkeley, Carnegie Mellon University, Princeton University, and ETH Zurich. He has taught courses that intersect topics discussed at Institute for Advanced Study seminars and delivered invited talks at venues such as International Colloquium on Automata, Languages and Programming, Symposium on Discrete Algorithms, and International Congress of Mathematicians. Fomin has supervised doctoral students who continued work at institutions like Max Planck Institute for Informatics, University of Oxford, and University of Cambridge. He maintains collaborations with scientists from CNRS, Inria Saclay, Microsoft Research, and Google Research.

Research and contributions

Fomin's research focuses on algorithmic graph theory with emphasis on Fixed-parameter tractability, kernelization, and combinatorial optimization in graphs such as those studied via tree decomposition, graph minor theory, and planar graphs. He contributed to advances in parameterized algorithms for problems related to feedback vertex set, vertex cover, dominating set, and problems reducible via bidimensionality theory. His work connects to complexity classifications stemming from the P versus NP problem and leverages techniques from probabilistic method, dynamic programming, and structural results like the Graph Minor Theorem. Collaborations produced results impacting algorithmic treatments of sparsity and led to kernelization bounds influencing research at conferences such as STOC, FOCS, ICALP, and ESA.

Fomin co-authored influential work on subexponential algorithms for problems on planar graphs and graphs excluding a fixed minor, integrating methods related to separator theorem and exploiting parameters like pathwidth and treewidth. He has worked on exact and parameterized algorithms for combinatorial problems with connections to applications in bioinformatics, network design, and computational geometry. His joint research with authors from Royal Institute of Technology, University of Edinburgh, University of Warsaw, and University of Bergen produced algorithmic frameworks referenced alongside results from Robertson–Seymour theory and techniques used in software from Wolfram Research and implementations influenced by libraries from Boost C++ Libraries.

Awards and honors

Fomin has been recognized by research communities through invitations to speak at major venues such as International Congress of Mathematicians sessions and has received awards and distinctions from institutions including European Research Council grants, national research councils like Research Council of Norway, and honors from universities such as University of Bergen and University of Warsaw. He has been involved with editorial boards of journals associated with SIAM, ACM Transactions on Algorithms, and Elsevier publications, and has served on program committees for conferences including STOC, FOCS, SODA, and ICALP.

Selected publications

- Fomin, with coauthors, on parameterized algorithms for feedback vertex set and kernelization results published in proceedings of STOC and SODA. - Fomin, with coauthors, on subexponential parameterized algorithms for planar graphs and minor-free graphs appearing in FOCS and ICALP. - Monographs and survey chapters authored or coauthored appearing in collections by Springer, Oxford University Press, and in lecture series associated with Cambridge University Press. - Collaborative papers with researchers from Max Planck Institute for Informatics, Carnegie Mellon University, and ETH Zurich addressing problems in graph theory and algorithm design presented at ESA, ICALP, and IPEC.

Category:Computer scientists Category:Algorithmists Category:Graph theorists