What is he best known for?
The fields of study he is best known for:
- Algorithm
- Combinatorics
- Artificial intelligence
Rolf Niedermeier spends much of his time researching Combinatorics, Discrete mathematics, Parameterized complexity, Algorithm and Vertex cover.
His Combinatorics study combines topics from a wide range of disciplines, such as Computational complexity theory and Upper and lower bounds.
As a part of the same scientific study, he usually deals with the Discrete mathematics, concentrating on Search tree and frequently concerns with Search algorithm, Time complexity and Graph.
His Parameterized complexity research includes themes of Asymptotic computational complexity, Point, Algorithmics and Theory of computation.
His Algorithm research incorporates themes from Cluster analysis and Iterative compression.
His Vertex cover study incorporates themes from Kernelization, Pathwidth, Exponential function and Vertex.
His most cited work include:
- Invitation to fixed-parameter algorithms (1453 citations)
- Invitation to data reduction and problem kernelization (344 citations)
- Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs (235 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Combinatorics, Discrete mathematics, Parameterized complexity, Algorithm and Computational complexity theory.
His study involves Vertex cover, Graph, Vertex, Chordal graph and Independent set, a branch of Combinatorics.
His Time complexity, Feedback vertex set, Vertex, Neighbourhood and Indifference graph study are his primary interests in Discrete mathematics.
Rolf Niedermeier studies Kernelization which is a part of Parameterized complexity.
He specializes in Algorithm, namely Search tree.
His Computational complexity theory study combines topics in areas such as Mathematical economics, Bounded function and Preference.
He most often published in these fields:
- Combinatorics (48.38%)
- Discrete mathematics (43.63%)
- Parameterized complexity (41.04%)
What were the highlights of his more recent work (between 2018-2021)?
- Parameterized complexity (41.04%)
- Graph (16.41%)
- Theoretical computer science (15.77%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Parameterized complexity, Graph, Theoretical computer science, Combinatorics and Discrete mathematics.
His study in Parameterized complexity is interdisciplinary in nature, drawing from both Computational complexity theory, Theory of computation, Vertex cover and Vertex.
His work on Vertex and Treewidth as part of general Graph research is frequently linked to Change over time, thereby connecting diverse disciplines of science.
The study incorporates disciplines such as Algorithm engineering, Stable marriage problem, Degree and Computational problem in addition to Theoretical computer science.
He focuses mostly in the field of Combinatorics, narrowing it down to matters related to Bounded function and, in some cases, Vertex number and Bipartite graph.
His research investigates the connection with Discrete mathematics and areas like Computation which intersect with concerns in Core and Parameterized algorithms.
Between 2018 and 2021, his most popular works were:
- The complexity of finding small separators in temporal graphs (19 citations)
- Temporal graph classes: A view through temporal separators (19 citations)
- Efficient computation of optimal temporal walks under waiting-time constraints (11 citations)
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.
