Concepedia

Daniel Lokshtanov

DL

Statistics

Publications

114

Citations

4.7K

H-Index

40

Active since

2005

Affiliations

University of Bergen(Current)

Institute of Mathematical Sciences

University of California San Diego

University of Warsaw

Utrecht University

Daniel Lokshtanov is an author at University of Bergen specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityCombinatorial OptimizationDiscrete MathematicsGraph TheoryMathematical ProgrammingComputational GeometryApproximation TheoryTheory Of Computing

Publications per year

2005–2023

114

Publications

114

A $c^k n$ 5-Approximation Algorithm for Treewidth

Hans L. Bodlaender, Pål Grønås Drange, Markus Sortland Dregi et al. · SIAM Journal on Computing · 2016 · 198 citations · Full text

Faster Parameterized Algorithms Using Linear Programming

Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman et al. · ACM Transactions on Algorithms · 2014 · 178 citations

Mathematical Programming, Engineering, Computational Complexity +16

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

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan et al. · Journal of the ACM · 2016 · 164 citations

Mathematical Programming, Computational Complexity Theory, Efficient Computation +18

Bidimensionality and kernels

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh et al. · Symposium on Discrete Algorithms · 2010 · 158 citations

Mathematical Programming, Computational Complexity Theory, Engineering +18

(Meta) Kernelization

Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov et al. · 2009 · 154 citations

Engineering, Graph Theory, Linear Kernels +11

1–5 of 114