What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algorithm
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Parameterized complexity, Vertex cover and Kernelization.
Treewidth, Feedback vertex set, Dominating set, Planar graph and Exponential time hypothesis are among the areas of Combinatorics where the researcher is concentrating his efforts.
He regularly ties together related areas like Algorithm in his Discrete mathematics studies.
His Parameterized complexity study combines topics from a wide range of disciplines, such as Time complexity, Steiner tree problem, Upper and lower bounds, Polynomial and Bipartite graph.
Saket Saurabh has researched Vertex cover in several fields, including Edge cover, Graph Layout and Maximal independent set.
Within one scientific family, Saket Saurabh focuses on topics pertaining to Theoretical computer science under Kernelization, and may sometimes address concerns connected to Tree.
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?
Saket Saurabh spends much of his time researching Combinatorics, Parameterized complexity, Discrete mathematics, Vertex cover and Kernelization.
His study in Graph, Feedback vertex set, Vertex, Time complexity and Treewidth is done as part of Combinatorics.
His study in Parameterized complexity is interdisciplinary in nature, drawing from both Disjoint sets, Bounded function, Integer and Vertex.
His Discrete mathematics research is multidisciplinary, relying on both Algorithm and Approximation algorithm.
Saket Saurabh has included themes like Edge cover, Bipartite graph and Maximal independent set in his Vertex cover study.
His Kernelization study integrates concerns from other disciplines, such as Open problem and Polynomial.
He most often published in these fields:
- Combinatorics (82.07%)
- Parameterized complexity (53.99%)
- Discrete mathematics (47.64%)
What were the highlights of his more recent work (between 2019-2021)?
- Combinatorics (82.07%)
- Parameterized complexity (53.99%)
- Time complexity (14.86%)
In recent papers he was focusing on the following fields of study:
Saket Saurabh focuses on Combinatorics, Parameterized complexity, Time complexity, Approximation algorithm and Graph.
His work is connected to Kernelization, Graph, Vertex, Integer and Treewidth, as a part of Combinatorics.
His study connects Vertex cover and Kernelization.
His Parameterized complexity research is within the category of Algorithm.
His biological study spans a wide range of topics, including Discrete mathematics and Planar graph.
When carried out as part of a general Graph research project, his work on Exponential time hypothesis is frequently linked to work in Polynomial kernel, therefore connecting diverse disciplines of study.
Between 2019 and 2021, his most popular works were:
- Parameterized complexity and approximability of directed odd cycle transversal (16 citations)
- A Polynomial Sized Kernel for Tracking Paths Problem (8 citations)
- Hitting topological minors is FPT (6 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.
