What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algorithm
Daniel Lokshtanov focuses on Combinatorics, Discrete mathematics, Parameterized complexity, Vertex cover and Treewidth.
His Combinatorics research focuses on Dominating set, Planar graph, Exponential time hypothesis, Approximation algorithm and Feedback vertex set.
His Discrete mathematics study typically links adjacent topics like Transversal.
His study of Kernelization is a part of Parameterized complexity.
His Kernelization research is multidisciplinary, incorporating elements of Preprocessor and Theoretical computer science.
His Treewidth research is multidisciplinary, incorporating perspectives in Bidimensionality, Tree decomposition, Disjoint sets, Tree-depth and Bounded function.
His most cited work include:
- Parameterized Algorithms (908 citations)
- Lower bounds based on the Exponential Time Hypothesis (278 citations)
- Incompressibility through Colors and IDs (183 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, Treewidth and Graph.
His works in Feedback vertex set, Vertex, Vertex cover, Kernelization and Time complexity are all subjects of inquiry into Combinatorics.
His Kernelization research is multidisciplinary, relying on both Open problem and Spanning tree.
He frequently studies issues relating to Algorithm and Discrete mathematics.
His research in Parameterized complexity is mostly focused on Exponential time hypothesis.
His work in Treewidth tackles topics such as Bidimensionality which are related to areas like Maximal independent set and Apex graph.
He most often published in these fields:
- Combinatorics (80.10%)
- Discrete mathematics (50.52%)
- Parameterized complexity (42.93%)
What were the highlights of his more recent work (between 2017-2021)?
- Combinatorics (80.10%)
- Parameterized complexity (42.93%)
- Discrete mathematics (50.52%)
In recent papers he was focusing on the following fields of study:
Daniel Lokshtanov spends much of his time researching Combinatorics, Parameterized complexity, Discrete mathematics, Graph and Treewidth.
As a part of the same scientific study, he usually deals with the Combinatorics, concentrating on Bounded function and frequently concerns with Clique-width.
The Kernelization research Daniel Lokshtanov does as part of his general Parameterized complexity study is frequently linked to other disciplines of science, such as Polynomial kernel, therefore creating a link between diverse domains of science.
His studies in Discrete mathematics integrate themes in fields like Plane, Computational geometry, Line segment and Graph theory.
His Graph research includes elements of Model checking and Topology.
In his study, Open problem is strongly linked to Planar graph, which falls under the umbrella field of Treewidth.
Between 2017 and 2021, his most popular works were:
- Kernelization: Theory of Parameterized Preprocessing (78 citations)
- Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (25 citations)
- Deterministic Truncation of Linear Matroids (22 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Discrete mathematics
- Algorithm
Daniel Lokshtanov mostly deals with Combinatorics, Parameterized complexity, Discrete mathematics, Feedback vertex set and Treewidth.
His Combinatorics study frequently draws connections between related disciplines such as Bounded function.
He studies Parameterized complexity, namely Kernelization.
His studies in Discrete mathematics integrate themes in fields like Logical matrix and Cluster analysis.
Daniel Lokshtanov interconnects Time complexity, Algorithm, Randomized algorithm, Open problem and Family of sets in the investigation of issues within Feedback vertex set.
The various areas that he examines in his Treewidth study include Upper and lower bounds, Connected dominating set and Planar graph.
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.
