2026 Daniel Lokshtanov: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	58	3649	3547	1744	1682	338	12664

Overview

Daniel Lokshtanov is affiliated with the University of California, Santa Barbara in the United States. Their research primarily focuses on the domain of computer science, with a strong emphasis on computational theory and mathematics.

Their work spans several subfields of study, including:

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

Key topics in their research cover:

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

Lokshtanov has been published extensively in various academic venues, notably:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
ACM Transactions on Algorithms
SIAM Journal on Computing
ACM Transactions on Computation Theory

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
A $c^k n$ 5-Approximation Algorithm for Treewidth

Hans L. Bodlaender;Pål Grǿnås Drange;Markus S. Dregi;Fedor V. Fomin

202
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
Treewidth governs the complexity of target set selection

Oren Ben-Zwi;Danny Hermelin;Daniel Lokshtanov;Ilan Newman

145
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
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
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

Saket Saurabh Institute of Mathematical Sciences

Fedor V. Fomin University of Bergen

Michał Pilipczuk University of Warsaw

Dániel Marx Saarland University

Marek Cygan University of Warsaw

Venkatesh Raman Indian Institute of Technology Palakkad

Dimitrios M. Thilikos National and Kapodistrian University of Athens

Michael R. Fellows Lebanese American University

Frances A. Rosamond University of Bergen

Hans L. Bodlaender Utrecht University

External Links

Personal website of Daniel Lokshtanov Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring online education in the USA opens doors to a range of flexible and rewarding career opportunities. For those interested in advancing into management after studying computer science, an affordable online mba can build leadership skills without breaking the bank.

Time-conscious students are also turning to 1 year masters programs that allow you to gain credentials swiftly and enter the workforce sooner.

If your goal is to maximize return on investment, consider online degrees that pay well—these programs are designed to deliver lucrative career options in technology and related fields.

Those with a keen interest in AI may be particularly interested in the cheapest online masters in artificial intelligence, a great option for gaining in-demand expertise while keeping educational expenses low.

Each of these pathways provides unique advantages, catering to different needs and ambitions in today's evolving tech job market.