- Home
- Best Scientists - Mathematics
- Fedor V. Fomin

Mathematics

Norway

2023

Computer Science

Norway

2023

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
58
Citations
12,884
358
World Ranking
447
National Ranking
1

Computer Science
D-index
58
Citations
12,911
371
World Ranking
2399
National Ranking
3

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 - Member of Academia Europaea

2019 - European Association for Theoretical Computer Science (EATCS) Fellow For his fundamental contributions in the fields of parametrized complexity and exponential algorithms

- Combinatorics
- Algorithm
- Discrete mathematics

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Algorithm, Treewidth and Parameterized complexity. Combinatorics is closely attributed to Exponential function in his work. His study involves Pathwidth, 1-planar graph, Graph, Maximal independent set and Partial k-tree, a branch of Discrete mathematics.

His Algorithm study integrates concerns from other disciplines, such as Measure, Graph theory and Independent set. Fedor V. Fomin combines subjects such as Clique-sum, Graph and Tree decomposition with his study of Treewidth. Fedor V. Fomin has researched Parameterized complexity in several fields, including Bounded function and Hamiltonian path.

- Parameterized Algorithms (908 citations)
- Exact Exponential Algorithms (324 citations)
- An annotated bibliography on guaranteed graph searching (290 citations)

Fedor V. Fomin spends much of his time researching Combinatorics, Discrete mathematics, Parameterized complexity, Treewidth and Graph. His works in Pathwidth, Chordal graph, Time complexity, Planar graph and Vertex are all subjects of inquiry into Combinatorics. He interconnects Graph and Graph bandwidth in the investigation of issues within Pathwidth.

As a member of one scientific family, Fedor V. Fomin mostly works in the field of Discrete mathematics, focusing on Algorithm and, on occasion, Hamiltonian path. His research in the fields of Kernelization overlaps with other disciplines such as Polynomial kernel. His studies deal with areas such as Bidimensionality, Approximation algorithm and Tree decomposition as well as Treewidth.

- Combinatorics (81.67%)
- Discrete mathematics (56.30%)
- Parameterized complexity (31.85%)

- Combinatorics (81.67%)
- Parameterized complexity (31.85%)
- Time complexity (12.78%)

His primary scientific interests are in Combinatorics, Parameterized complexity, Time complexity, Graph and Discrete mathematics. Matroid, Treewidth, Bipartite graph, Independent set and Planar graph are the primary areas of interest in his Combinatorics study. His Treewidth study also includes

- Feedback vertex set that connect with fields like Vertex cover and Family of sets,
- Sublinear function most often made with reference to Bidimensionality.

His work in the fields of Kernelization overlaps with other areas such as Polynomial kernel. His research in Time complexity intersects with topics in Function and Vertex. His research investigates the connection between Discrete mathematics and topics such as Graph that intersect with problems in Theoretical computer science and Simple.

- Kernelization: Theory of Parameterized Preprocessing (78 citations)
- A survey of parameterized algorithms and the complexity of edge modification. (14 citations)
- On the Tractability of Optimization Problems on H-Graphs. (13 citations)

- Combinatorics
- Algorithm
- Algebra

His primary areas of investigation include Combinatorics, Parameterized complexity, Graph, Integer and Time complexity. His Combinatorics study frequently draws connections to other fields, such as Complement. His studies in Parameterized complexity integrate themes in fields like Multiset, Logical matrix, Binary number, Rank and Interval.

His research in Graph tackles topics such as Contractible space which are related to areas like Discrete mathematics. When carried out as part of a general Discrete mathematics research project, his work on Hamming distance is frequently linked to work in Rigidity, therefore connecting diverse disciplines of study. His Time complexity research is multidisciplinary, incorporating elements of Knot, Dominating set, Diagram, Link diagram and Function.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Parameterized Algorithms

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

**(2015)**

1925 Citations

Parameterized Algorithms

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

**(2015)**

1925 Citations

Exact Exponential Algorithms

Fedor V. Fomin;Petteri Kaski.

**(2010)**

571 Citations

Exact Exponential Algorithms

Fedor V. Fomin;Petteri Kaski.

**(2010)**

571 Citations

An annotated bibliography on guaranteed graph searching

Fedor V. Fomin;Dimitrios M. Thilikos.

Theoretical Computer Science **(2008)**

447 Citations

An annotated bibliography on guaranteed graph searching

Fedor V. Fomin;Dimitrios M. Thilikos.

Theoretical Computer Science **(2008)**

447 Citations

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

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

Journal of the ACM **(2005)**

384 Citations

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

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

Journal of the ACM **(2005)**

384 Citations

The curse of connectivity: t-total vertex (edge) cover

Henning Fernau;Fedor V. Fomin;Geevarghese Philip;Saket Saurabh.

computing and combinatorics conference **(2010)**

289 Citations

A measure & conquer approach for the analysis of exact algorithms

Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch.

Journal of the ACM **(2009)**

278 Citations

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

Contact us

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:

Institute of Mathematical Sciences

University of California, Santa Barbara

National and Kapodistrian University of Athens

University of Lorraine

Utrecht University

RWTH Aachen University

Dalle Molle Institute for Artificial Intelligence Research

Saarland University

Royal Holloway University of London

Institute of Mathematical Sciences

University of Chicago

Kyoto Pharmaceutical University

University of Cambridge

University of Oxford

Cincinnati Children's Hospital Medical Center

University of Michigan–Ann Arbor

University of Nebraska–Lincoln

University of Oklahoma

Bulgarian Academy of Sciences

University of Rouen

Princeton University

Columbia University

Democritus University of Thrace

University of Waterloo

University of Sussex

Max Planck Society

Something went wrong. Please try again later.