What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Discrete mathematics
Michael R. Fellows mostly deals with Combinatorics, Parameterized complexity, Discrete mathematics, Vertex cover and Time complexity.
Michael R. Fellows interconnects Computational complexity theory, Theoretical computer science, Graph and Computational problem in the investigation of issues within Parameterized complexity.
His research investigates the connection with Theoretical computer science and areas like Analysis of algorithms which intersect with concerns in Courcelle's theorem and Exponential time hypothesis.
His Complexity class, Computability and Graph Layout study in the realm of Discrete mathematics connects with subjects such as Bounded function.
His Vertex cover research is multidisciplinary, relying on both Kernelization, Edge cover and Vertex.
His Time complexity study also includes fields such as
- Decidability together with Partially ordered set and Calculus,
- Decision problem together with Polynomial.
His most cited work include:
- Parameterized Complexity (3033 citations)
- Fundamentals of Parameterized Complexity (863 citations)
- On problems without polynomial kernels (525 citations)
What are the main themes of his work throughout his whole career to date?
Michael R. Fellows mainly investigates Combinatorics, Discrete mathematics, Parameterized complexity, Vertex cover and Time complexity.
His research in the fields of Feedback vertex set, Kernelization, Pathwidth and Graph theory overlaps with other disciplines such as Bounded function.
His work in Pathwidth tackles topics such as Indifference graph which are related to areas like 1-planar graph.
His study in Treewidth, Dominating set, Chordal graph, Independent set and Maximal independent set is carried out as part of his studies in Discrete mathematics.
Within one scientific family, he focuses on topics pertaining to Theoretical computer science under Parameterized complexity, and may sometimes address concerns connected to Polynomial.
He has researched Vertex cover in several fields, including Edge cover, Planar graph and Iterative compression.
He most often published in these fields:
- Combinatorics (56.92%)
- Discrete mathematics (55.03%)
- Parameterized complexity (47.80%)
What were the highlights of his more recent work (between 2010-2021)?
- Parameterized complexity (47.80%)
- Discrete mathematics (55.03%)
- Combinatorics (56.92%)
In recent papers he was focusing on the following fields of study:
Michael R. Fellows focuses on Parameterized complexity, Discrete mathematics, Combinatorics, Vertex cover and Kernelization.
His Parameterized complexity research includes themes of Computational complexity theory, Algorithmics, Time complexity and Theoretical computer science.
Michael R. Fellows has included themes like Algorithm design and Dynamic programming in his Theoretical computer science study.
His work on Treewidth, Planar graph, Graph and Vertex as part of general Discrete mathematics research is frequently linked to Bounded function, bridging the gap between disciplines.
The Vertex cover study combines topics in areas such as Turing machine, Search tree, Edge cover, Feedback vertex set and Optimization problem.
His study in Kernelization is interdisciplinary in nature, drawing from both Polynomial kernel and Kernel.
Between 2010 and 2021, his most popular works were:
- Fundamentals of Parameterized Complexity (863 citations)
- Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity (91 citations)
- On the complexity of some colorful problems parameterized by treewidth (86 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algorithm
- Discrete mathematics
His primary scientific interests are in Combinatorics, Parameterized complexity, Discrete mathematics, Kernelization and Vertex cover.
His Treewidth, Graph theory, 1-planar graph and Indifference graph study in the realm of Combinatorics interacts with subjects such as Social connectedness.
His research integrates issues of Computational complexity theory, Algorithmics, Theoretical computer science and Bipartite graph in his study of Parameterized complexity.
His research investigates the link between Discrete mathematics and topics such as Theory of computation that cross with problems in Integer programming, Mealy machine and Finite-state machine.
He works mostly in the field of Kernelization, limiting it down to concerns involving Kernel and, occasionally, Quadratic equation and Tree.
Vertex model and Edge cover is closely connected to Feedback vertex set in his research, which is encompassed under the umbrella topic of Vertex cover.
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.
