Parameterized Complexity and Kernel Bounds for Hard Planning Problems

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.