World's Best Scientists 2026 revealed!
Fedor V. Fomin

Fedor V. Fomin

Award Badge
Computer Science
Norway
2026
Award Badge
Mathematics
Norway
2026

D-Index & Metrics

Computer Science

D-Index
67
Citations
17097
World Ranking
2200
National Ranking
2

Mathematics

D-Index
67
Citations
16922
World Ranking
337
National Ranking
1

Research.com Recognitions

  • 2026 - Research.com Computer Science in Norway Leader Award
  • 2026 - Research.com Mathematics in Norway Leader Award
  • 2025 - Research.com Computer Science in Norway Leader Award
  • 2025 - Research.com Mathematics in Norway Leader Award
  • 2023 - Research.com Computer Science in Norway Leader Award
  • 2023 - Research.com Mathematics in Norway Leader Award
  • 2022 - Research.com Computer Science in Norway Leader Award
  • 2022 - Research.com Mathematics in Norway Leader Award
  • 2019 - European Association for Theoretical Computer Science (EATCS) Fellow For his fundamental contributions in the fields of parametrized complexity and exponential algorithms
  • 2019 - Member of Academia Europaea

Overview

Fedor V. Fomin is a researcher affiliated with the University of Bergen in Norway, specializing primarily in computer science. Their scholarly contributions cover a range of subfields including computational theory and mathematics, computer networks and communications, artificial intelligence, computer graphics and computer-aided design, and discrete mathematics and combinatorics.

Their research extensively addresses topics such as:

  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Optimization and Search Problems
  • Computational Geometry and Mesh Generation
  • Graph Labeling and Dimension Problems
  • Limits and Structures in Graph Theory
  • Semigroups and Automata Theory

Among the recent papers authored or co-authored by Fomin are:

  • "A survey of parameterized algorithms and the complexity of edge modification" (2023), published in Computer Science Review
  • "On the Tractability of Optimization Problems on H-Graphs" (2020), published in Algorithmica
  • "How to find a good explanation for clustering?" (2023), published in Artificial Intelligence
  • "How to Find a Good Explanation for Clustering?" (2022), published in Proceedings of the AAAI Conference on Artificial Intelligence
  • "On coresets for fair clustering in metric and Euclidean spaces and their applications" (2024), published in Journal of Computer and System Sciences

Frequent collaborators include:

  • Petr A. Golovach
  • Kirill Simonov
  • Saket Saurabh
  • Fahad Panolan
  • Tuukka Korhonen

Fomin has contributed to notable publication venues, with multiple papers appearing in:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Algorithmica
  • SIAM Journal on Discrete Mathematics
  • ACM Transactions on Algorithms

In addition to journal and conference papers, they have authored a book entitled Treewidth, Kernels, and Algorithms, published in 2020 by Springer Science+Business Media.

Fedor V. Fomin's work has been recognized with awards such as membership in the Academia Europaea in 2019 and designation as a Fellow of the European Association for Theoretical Computer Science in the same year, which acknowledged fundamental contributions in parametrized complexity and exponential algorithms.

Best Publications

  • Parameterized Algorithms

    Marek Cygan;Fedor V. Fomin;Lukasz Kowalik;Daniel Lokshtanov

  • Exact Exponential Algorithms

    Fedor V. Fomin;Petteri Kaski

  • An annotated bibliography on guaranteed graph searching

    Fedor V. Fomin;Dimitrios M. Thilikos

  • Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

    Erik D. Demaine;Fedor V. Fomin;Mohammadtaghi Hajiaghayi;Dimitrios M. Thilikos

  • A measure & conquer approach for the analysis of exact algorithms

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Kernelization: Theory of Parameterized Preprocessing

    Fedor V. Fomin;Daniel Lokshtanov;Saket Saurabh;Meirav Zehavi

  • Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

    Fedor V. Fomin;Dimitrios M. Thilikos

  • Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms

    Fedor V. Fomin;Daniel Lokshtanov;Neeldhara Misra;Saket Saurabh

  • Improved algorithms for feedback vertex set problems

    Jianer Chen;Fedor V. Fomin;Yang Liu;Songjian Lu

  • A $c^k n$ 5-Approximation Algorithm for Treewidth

    Hans L. Bodlaender;Pål Grǿnås Drange;Markus S. Dregi;Fedor V. Fomin

  • Bidimensionality and kernels

    Fedor V. Fomin;Daniel Lokshtanov;Saket Saurabh;Dimitrios M. Thilikos

  • Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

    Erik D. Demaine;Fedor V. Fomin;Mohammadtaghi Hajiaghayi;Dimitrios M. Thilikos

  • Measure and conquer: a simple O(20.288n) independent set algorithm

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Measure and conquer: domination – a case study

    Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Exact (exponential) algorithms for the dominating set problem

    Fedor V. Fomin;Dieter Kratsch;Gerhard J. Woeginger

  • Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms

    Fedor V. Fomin;Daniel Lokshtanov;Fahad Panolan;Saket Saurabh

  • On the complexity of some colorful problems parameterized by treewidth

    Michael R. Fellows;Fedor V. Fomin;Daniel Lokshtanov;Frances Rosamond

  • Meta) Kernelization

    Hans L. Bodlaender;Fedor V. Fomin;Daniel Lokshtanov;Eelko Penninkx

  • Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

    Frederic Dorn;Eelko Penninkx;Hans L. Bodlaender;Fedor V. Fomin

  • Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications

    Fedor V. Fomin;Fabrizio Grandoni;Artem V. Pyatkin;Alexey A. Stepanov

  • Efficient computation of representative sets with applications in parameterized and exact algorithms

    Fedor V. Fomin;Daniel Lokshtanov;Saket Saurabh

Frequent Co-Authors

Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Dimitrios M. Thilikos
Dimitrios M. Thilikos National and Kapodistrian University of Athens
Michał Pilipczuk
Michał Pilipczuk University of Warsaw
Dieter Kratsch
Dieter Kratsch University of Lorraine
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Fabrizio Grandoni
Fabrizio Grandoni Dalle Molle Institute for Artificial Intelligence Research
Marek Cygan
Marek Cygan University of Warsaw
Dániel Marx
Dániel Marx Saarland University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA opens doors to various interdisciplinary fields. Many students complement their math skills with business-focused studies, such as the easiest mba program options available online. These programs help in understanding management principles while leveraging quantitative skills.

For those aiming to advance quickly in leadership roles, investing in a fastest online mba degree programs can be a practical choice, allowing students to earn credentials without extensive time away from work.

Additionally, professionals interested in data analytics or finance often explore affordable options like a cheap masters in finance. This builds expertise in financial modeling and risk analysis, complementing a mathematical foundation.

For those focused on business research or consulting, a 1 year dba program online offers an accelerated path to doctoral credentials, emphasizing practical applications of mathematical methods in decision-making.

Best Scientists Citing Fedor V. Fomin

Trending Scientists

Recently Published Articles