by Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Reference:
Parameterized Complexity and Kernel Bounds for Hard Planning ProblemsChrister Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan SzeiderAlgorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Paul G. Spirakis, Maria J. Serna, eds.), volume 7878 of Lecture Notes in Computer Science, pages 13-24, 2013, Springer Verlag.
Bibtex Entry:
@string{springer="Springer Verlag"}
@string{lncs="Lecture Notes in Computer Science"}
@inproceedings{BackstromJonssonOrdyniakSzeider13,
author = {Christer B{\"a}ckstr{\"o}m and Peter Jonsson and
Sebastian Ordyniak and Stefan Szeider},
title = {Parameterized Complexity and Kernel Bounds for Hard
Planning Problems},
pages = {13-24},
editor = {Paul G. Spirakis and Maria J. Serna},
booktitle = {Algorithms and Complexity, 8th International
Conference, CIAC 2013, Barcelona, Spain, May 22-24,
2013. Proceedings},
publisher = Springer,
series = LNCS,
volume = {7878},
year = {2013},
doi = {10.1007/978-3-642-38233-8_2},
}