D. Lokshtanov

Publications
Influence

M. Cygan, F. Fomin, +5 authors S. Saurabh
Computer Science
Springer International Publishing
23 July 2015

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. Expand

Known algorithms on graphs of bounded treewidth are probably optimal

D. Lokshtanov, D. Marx, S. Saurabh
Computer Science, Mathematics
SODA '11
30 July 2010

We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. Expand

Lower bounds based on the Exponential Time Hypothesis

D. Lokshtanov, D. Marx, S. Saurabh
Mathematics, Computer Science
Bull. EATCS
2011

The Exponential Time Hypothesis (ETH) is a conjecture stating that, roughly speaking, n-variable 3-SAT cannot be solved in time 2o(n). Expand

(Meta) Kernelization

H. Bodlaender, F. Fomin, D. Lokshtanov, Eelko Penninkx, S. Saurabh, D. Thilikos
Computer Science, Mathematics
50th Annual IEEE Symposium on Foundations of…
4 April 2009

We show that all problems expressible in Counting Monadic Second Order Logic and satisfying a compactness condition admit a polynomial kernel on graphs of bounded genus. Expand

Fast FAST

N. Alon, D. Lokshtanov, S. Saurabh
Mathematics, Computer Science
ICALP
6 July 2009

We present a randomized subexponential time, polynomial space parameterized algorithm for the k -Weighted Feedback Arc Set in Tournaments (k -FAST ) problem. Expand

On Problems as Hard as CNF-SAT

M. Cygan, Holger Dell, +6 authors Magnus Wahlstrom
Computer Science
IEEE 27th Conference on Computational Complexity
10 December 2011

The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. Expand

Incompressibility through Colors and IDs

M. Dom, D. Lokshtanov, S. Saurabh
Mathematics, Computer Science
ICALP
6 July 2009

In parameterized complexity each problem instance comes with a parameter k , and a parameterized problem is said to admit a kernel if there are polynomial time preprocessing rules that reduce the input instance to an instance with size k . Expand

Slightly superexponential parameterized problems

D. Lokshtanov, D. Marx, S. Saurabh
Computer Science, Mathematics
SODA '11
23 January 2011

A central problem in parameterized algorithms is to obtain algorithms with running time <i>f</i>(<i>k</i>) such that the dependence on the parameter is as slow growing function of the parameter as possible. Expand

Treewidth governs the complexity of target set selection

Oren Ben-Zwi, D. Hermelin, D. Lokshtanov, I. Newman
Computer Science, Mathematics
Discret. Optim.
1 February 2011

We present an algorithm for Target Set Selection running in n^O^(^w^) time, for graphs with n vertices and treewidth bounded by w. Expand

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

F. Fomin, D. Lokshtanov, S. Saurabh
Computer Science, Mathematics
SODA
16 April 2013

We give two algorithms computing representative families of linear and uniform matroids and demonstrate how to use representative families for designing single-exponential parameterized and exact exponential time algorithms. Expand

Recommended Authors