Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider. Parameterized Complexity and Kernel Bounds for Hard Planning Problems. In Paul G. Spirakis, Maria J. Serna, editors, Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings. Volume 7878 of Lecture Notes in Computer Science, pages 13-24, Springer, 2013. [doi]
@inproceedings{BackstromJOS13,
title = {Parameterized Complexity and Kernel Bounds for Hard Planning Problems},
author = {Christer Bäckström and Peter Jonsson and Sebastian Ordyniak and Stefan Szeider},
year = {2013},
doi = {10.1007/978-3-642-38233-8_2},
url = {http://dx.doi.org/10.1007/978-3-642-38233-8_2},
researchr = {https://researchr.org/publication/BackstromJOS13},
cites = {0},
citedby = {0},
pages = {13-24},
booktitle = {Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings},
editor = {Paul G. Spirakis and Maria J. Serna},
volume = {7878},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-38233-8},
}