@inproceedings{KroneggerPP13-pc,
author    = {Martin Kronegger and
Andreas Pfandler and
Reinhard Pichler},
title     = {Parameterized Complexity of Optimal Planning: A Detailed Map},
booktitle = {Proc. of the 23rd International Joint Conference on Artificial Intelligence (IJCAI-13)},
publisher = {AAAI Press},
pages     = {954--961},
year      = {2013},
ee        = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6830},
abstract  = {The goal of this paper is a systematic parameterized complexity analysis of different variants of propositional STRIPS planning. We identify several natural problem parameters and study all possible combinations of 9 parameters in 6 different settings. These settings arise, for instance, from the distinction if negative effects of actions are allowed or not. We provide a complete picture by establishing for each case either paraNP-hardness (i.e., the parameter combination does not help) or W[t]-completeness with $t \in \{1,2\}$ (i.e., fixed-parameter intractability), or FPT (i.e., fixed-parameter tractability).}
}