What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- Parameterized Algorithms (908 citations)
- Exact Exponential Algorithms (324 citations)
- An annotated bibliography on guaranteed graph searching (290 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (81.67%)
- Discrete mathematics (56.30%)
- Parameterized complexity (31.85%)
What were the highlights of his more recent work (between 2017-2021)?
- Combinatorics (81.67%)
- Parameterized complexity (31.85%)
- Time complexity (12.78%)
In recent papers he was focusing on the following fields of study:
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.
Between 2017 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
