1. Bäckström, C., Jonsson, P.: All PSPACE-complete planning problems are equal but some are more equal than others. In: Proceedings 4th Annual Symposium on Combinatorial Search (SOCS-11), pp 10–17, Barcelona, Spain (2011)
2. Bäckström, C., Jonsson, P.: Algorithms and limits for compact plan representations. J. Artif. Intell. Res. 44, 141–177 (2012)
3. Bäckström, C., Jonsson, P.: A refined view of causal graphs and component sizes: SP-closed graph classes and beyond. J. Artif. Intell. Res. 47, 575–611 (2013)
4. Bäckström, C., Jonsson, P., Ordyniak, S., Szeider, S.: A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci., 1311–1332 (2015)
5. Bäckström, C., Jonsson, P., Ståhlberg, S.: Fast detection of unsolvable planning instances using local consistency. In: Proceedings 6th Annual Symposium on Combinatorial Search (SOCS-13), pp 29–37, WA, USA (2013)