103 citations · 136 across the 6 of their papers we have counts for
6 papers
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond
Christer Bäckström, Peter Jonsson
The causal graph of a planning instance is an important tool for planning both in practice and in theory. The theoretical studies of causal graphs have largely analysed the computa…
Algorithms and Limits for Compact Plan Representations
Christer Bäckström, Peter Jonsson
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit re…
A Complete Parameterized Complexity Analysis of Bounded Planning
Christer Baeckstroem, Peter Jonsson, Sebastian Ordyniak +1
The propositional planning problem is a notoriously difficult computational problem, which remains hard even under strong syntactical and structural restrictions. Given its difficu…
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak +1
The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the…
The Complexity of Planning Revisited - A Parameterized Analysis
Christer Baeckstroem, Yue Chen, Peter Jonsson +2
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have influenced following res…
Computational Aspects of Reordering Plans
C. Backstrom
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan les…