Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Parameterized Algorithms
- M. Cygan, F. Fomin, +5 authors S. Saurabh
- Computer Science
- Springer International Publishing
- 23 July 2015
TLDR
Known algorithms on graphs of bounded treewidth are probably optimal
- D. Lokshtanov, D. Marx, S. Saurabh
- Computer Science, Mathematics
- SODA '11
- 30 July 2010
TLDR
Lower bounds based on the Exponential Time Hypothesis
- D. Lokshtanov, D. Marx, S. Saurabh
- Mathematics, Computer Science
- Bull. EATCS
- 2011
TLDR
(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
TLDR
Fast FAST
- N. Alon, D. Lokshtanov, S. Saurabh
- Mathematics, Computer Science
- ICALP
- 6 July 2009
TLDR
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
TLDR
Incompressibility through Colors and IDs
- M. Dom, D. Lokshtanov, S. Saurabh
- Mathematics, Computer Science
- ICALP
- 6 July 2009
TLDR
Slightly superexponential parameterized problems
- D. Lokshtanov, D. Marx, S. Saurabh
- Computer Science, Mathematics
- SODA '11
- 23 January 2011
TLDR
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
TLDR
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
TLDR