1. Tractable cost-optimal planning over restricted polytree causal graphs;Aghighi,2015
2. Bounded-width QBF is PSPACE-complete;Atserias;J. Comput. Syst. Sci.,2014
3. Parameterising the complexity of planning by the number of paths in the domain-transition graphs;Bäckström,2014
4. Some fixed parameter tractability results for planning with non-acyclic domain-transition graphs;Bäckström,2015
5. A refined view of causal graphs and component sizes: SP-closed graph classes and beyond;Bäckström;J. Artif. Intell. Res.,2013