Bäckström, Christer

20 publications

JAIR 2021 Cost-Optimal Planning, Delete Relaxation, Approximability, and Heuristics Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

IJCAI 2019 A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

IJCAI 2018 Novel Structural Parameters for Acyclic Planning Using Tree Embeddings Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

AAAI 2017 Plan Reordering and Parallel Execution - A Parameterized Complexity View Meysam Aghighi, Christer Bäckström

JAIR 2017 Time and Space Bounds for Planning Christer Bäckström, Peter Jonsson

IJCAI 2015 Cost-Optimal and Net-Benefit Planning - A Parameterised Complexity View Meysam Aghighi, Christer Bäckström

AAAI 2015 Some Fixed Parameter Tractability Results for Planning with Non-Acyclic Domain-Transition Graphs Christer Bäckström

JAIR 2014 Automaton Plans Christer Bäckström, Anders Jonsson, Peter Jonsson

JAIR 2013 A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond Christer Bäckström, Peter Jonsson

IJCAI 2013 Bridging the Gap Between Refinement and Heuristics in Abstraction Christer Bäckström, Peter Jonsson

JAIR 2012 Algorithms and Limits for Compact Plan Representations Christer Bäckström, Peter Jonsson

AAAI 2012 The Complexity of Planning Revisited - A Parameterized Analysis Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider

JAIR 1998 Computational Aspects of Reordering Plans Christer Bäckström

AAAI 1996 A Linear-Programming Approach to Temporal Reasoning Peter Jonsson, Christer Bäckström

AAAI 1996 On the Size of Reactive Plans Peter Jonsson, Christer Bäckström

IJCAI 1995 Planning with Abstraction Hierarchies Can Be Exponentially Less Efficient Christer Bäckström, Peter Jonsson

AAAI 1994 Tractable Planning with State Variables by Exploiting Structural Restrictions Peter Jonsson, Christer Bäckström

IJCAI 1993 Complexity Results for SAS+ Planning Christer Bäckström, Bernhard Nebel

AAAI 1992 On the Computational Complexity of Temporal Projection and Plan Validation Bernhard Nebel, Christer Bäckström

IJCAI 1991 Parallel Non-Binary Planning in Polynomial Time Christer Bäckström, Inger Klein