@Article{kratsch_et_al:DagRep.4.11.1,
author = {Kratsch, Stefan and Lokshtanov, Daniel and Marx, D\'{a}niel and Rossmanith, Peter},
title = {{Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)}},
pages = {1--21},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {4},
number = {11},
editor = {Kratsch, Stefan and Lokshtanov, Daniel and Marx, D\'{a}niel and Rossmanith, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.11.1},
URN = {urn:nbn:de:0030-drops-49677},
doi = {10.4230/DagRep.4.11.1},
annote = {Keywords: Algorithms, parameterized complexity, kernels, width measures, exponential time hypothesis, lower bounds}
}