2026 Saket Saurabh: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	60	557	469	3	3	514	13792
Computer Science	60	3249	3155	29	29	525	14058

Saket Saurabh publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Saket Saurabh sits on this spectrum.

42 publications 537+

This scientist: 514 publications — 97th percentile

97% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Saket Saurabh D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Saket Saurabh sits on this spectrum.

30 D-Index 86+

This scientist: 60 D-Index — 85th percentile

85% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

Research.com Recognitions

2026 - Research.com Mathematics in India Leader Award
2025 - Research.com Mathematics in India Leader Award
2023 - Research.com Mathematics in India Leader Award
2020 - Member of Academia Europaea

Overview

Saket Saurabh is affiliated with the Institute of Mathematical Sciences in India and focuses on research in computer science, particularly in computational theory and mathematics.

Their recent publications cover a range of topics primarily centered on graph theory, algorithms, and optimization. Among these are:

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs (2021), published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Don't Be Strict in Local Search! (2021), published in Proceedings of the AAAI Conference on Artificial Intelligence
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (2022), published in SIAM Journal on Computing
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems (2020), published in ACM Transactions on Algorithms
A Polynomial Kernel for Paw-Free Editing (2020), published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent collaborators include:

Daniel Lokshtanov
Meirav Zehavi
Fahad Panolan
Fedor V. Fomin
Lawqueen Kanesh

Publications are often found in venues such as:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Algorithmica
Theoretical Computer Science
ACM Transactions on Algorithms

Their main field of study is Computer Science, with a focus on several subfields including:

Computational Theory and Mathematics
Computer Networks and Communications
Computer Graphics and Computer-Aided Design
Artificial Intelligence
Discrete Mathematics and Combinatorics

The primary research topics Saket Saurabh has worked on include:

Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Optimization and Search Problems
Computational Geometry and Mesh Generation
Limits and Structures in Graph Theory
Interconnection Networks and Systems
Graph Labeling and Dimension Problems

Saket Saurabh was awarded membership in the Academia Europaea in 2020.

Best Publications

Parameterized Algorithms

Marek Cygan;Fedor V. Fomin;Lukasz Kowalik;Daniel Lokshtanov

2673
Citations
Lower bounds based on the Exponential Time Hypothesis

Daniel Lokshtanov;Dániel Marx;Saket Saurabh

359
Citations
Incompressibility through Colors and IDs

Michael Dom;Daniel Lokshtanov;Saket Saurabh

284
Citations
Kernelization: Theory of Parameterized Preprocessing

Fedor V. Fomin;Daniel Lokshtanov;Saket Saurabh;Meirav Zehavi

240
Citations
On Problems as Hard as CNF-SAT

Marek Cygan;Holger Dell;Daniel Lokshtanov;Dániel Marx

233
Citations
Kernelization Lower Bounds Through Colors and IDs

Michael Dom;Daniel Lokshtanov;Saket Saurabh

228
Citations
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms

Fedor V. Fomin;Daniel Lokshtanov;Neeldhara Misra;Saket Saurabh

208
Citations
Bidimensionality and kernels

Fedor V. Fomin;Daniel Lokshtanov;Saket Saurabh;Dimitrios M. Thilikos

192
Citations
Faster Parameterized Algorithms Using Linear Programming

Daniel Lokshtanov;N. S. Narayanaswamy;Venkatesh Raman;M. S. Ramanujan

189
Citations
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms

Fedor V. Fomin;Daniel Lokshtanov;Fahad Panolan;Saket Saurabh

172
Citations
On the complexity of some colorful problems parameterized by treewidth

Michael R. Fellows;Fedor V. Fomin;Daniel Lokshtanov;Frances Rosamond

168
Citations
Graph Layout Problems Parameterized by Vertex Cover

Michael R. Fellows;Daniel Lokshtanov;Neeldhara Misra;Frances A. Rosamond

162
Citations
Meta) Kernelization

Hans L. Bodlaender;Fedor V. Fomin;Daniel Lokshtanov;Eelko Penninkx

160
Citations
Kernel(s) for problems with no kernel: On out-trees with many leaves

Daniel Binkele-Raible;Henning Fernau;Fedor V. Fomin;Daniel Lokshtanov

126
Citations
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles

Venkatesh Raman;Saket Saurabh

124
Citations
Known algorithms on graphs of bounded treewidth are probably optimal

Daniel Lokshtanov;Dániel Marx;Saket Saurabh

124
Citations
On Problems as Hard as CNF-SAT

Marek Cygan;Holger Dell;Daniel Lokshtanov;D'niel Marx

122
Citations
Fast FAST

Noga Alon;Daniel Lokshtanov;Saket Saurabh

120
Citations
On Two Techniques of Combining Branching and Treewidth

Fedor V. Fomin;Serge Gaspers;Saket Saurabh;Alexey A. Stepanov

120
Citations
Meta) Kernelization

Hans L. Bodlaender;Fedor V. Fomin;Daniel Lokshtanov;Eelko Penninkx

106
Citations
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves

Henning Fernau;Fedor V. Fomin;Daniel Lokshtanov;Daniel Raible

105
Citations
Efficient computation of representative sets with applications in parameterized and exact algorithms

Fedor V. Fomin;Daniel Lokshtanov;Saket Saurabh

79
Citations
Slightly Superexponential Parameterized Problems

Daniel Lokshtanov;Dániel Marx;Saket Saurabh

46
Citations

Frequent Co-Authors

Daniel Lokshtanov University of California, Santa Barbara

Fedor V. Fomin University of Bergen

Venkatesh Raman Indian Institute of Technology Palakkad

Michał Pilipczuk University of Warsaw

Gregory Gutin Royal Holloway University of London

Marek Cygan University of Warsaw

Dániel Marx Saarland University

Dimitrios M. Thilikos National and Kapodistrian University of Athens

Michael R. Fellows Lebanese American University

Frances A. Rosamond University of Bergen

External Links

Personal website of Saket Saurabh Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA can open doors to various related fields, including business and marketing. Many students consider expanding their skillset through graduate programs to enhance career prospects.

For those interested in business administration, exploring the shortest online mba programs is an excellent way to gain leadership skills without a lengthy time commitment. These accelerated paths help professionals quickly adapt to management roles.

Marketing is another complementary field, with marketing graduate programs offering affordable options that lead to well-paying jobs. This blend of analytical and creative expertise suits many math graduates.

For a more intensive route, the one year mba programs provide a fast-tracked learning experience to boost career growth efficiently.

Additionally, flexibility is key for many students. Programs like mba programs that accept transfer credits make it easier to continue education without losing prior progress, ensuring a smoother transition to advanced qualifications.