Action Structures with Implicit Coordination. - Christer Bäckström (AIMSA, 1988)

A Representation of Coordinated Actions Characterized by Interval Valued Conditions. - Christer Bäckström (ISMIS, 1988)

A Representation of Coordinated Actions. - Christer Bäckström (SCAI, 1988)

Planning in Polynomial Time. - Christer Bäckström; Inger Klein (Expert Systems in Engineering, 1990)

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

Planning in polynomial time: the SAS-PUBS class. - Christer Bäckström; Inger Klein (Comput. Intell., 1991)

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

On the Computational Complexity of Planning and Story Understanding. - Christer Bäckström; Bernhard Nebel (ECAI, 1992)

Equivalence and Tractability Results for SAS+ Planning. - Christer Bäckström (KR, 1992)

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

Executing Parallel Plans Faster by Adding Actions. - Christer Bäckström (ECAI, 1994)

On the Computational Complexity of Temporal Projection, Planning, and Plan Validation. - Bernhard Nebel; Christer Bäckström (Artif. Intell., 1994)

Planning with Abstraction Hierarchies can be Exponentially Less Efficient. - Christer Bäckström; Peter Jonsson (IJCAI, 1995)

Expressive Equivalence of Planning Formalisms. - Christer Bäckström (Artif. Intell., 1995)

Complexity Results for SAS+ Planning. - Christer Bäckström; Bernhard Nebel (Comput. Intell., 1995)

On the Size of Reactive Plans. - Peter Jonsson; Christer Bäckström (AAAI/IAAI, Vol. 2, 1996)

A Linear-Programming Approach to Temporal Reasoning. - Peter Jonsson; Christer Bäckström (AAAI/IAAI, Vol. 2, 1996)

Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. - Peter Jonsson; Thomas Drakengren; Christer Bäckström (KR, 1996)

State-Variable Planning Under Structural Restrictions: Algorithms and Complexity. - Peter Jonsson; Christer Bäckström (Artif. Intell., 1998)

A Unifying Approach to Temporal Constraint Reasoning. - Peter Jonsson; Christer Bäckström (Artif. Intell., 1998)

Tractable Plan Existence Does Not Imply Tractable Plan Generation. - Peter Jonsson; Christer Bäckström (Ann. Math. Artif. Intell., 1998)

Computational Aspects of Reordering Plans. - Christer Bäckström (J. Artif. Intell. Res., 1998)

Efficient planning for a miniature assembly line. - Inger Klein; Peter Jonsson; Christer Bäckström (Artif. Intell. Eng., 1999)

Computational Complexity of Relating Time Points with Intervals. - Peter Jonsson; Thomas Drakengren; Christer Bäckström (Artif. Intell., 1999)

Towards efficient universal planning: A randomized approach. - Peter Jonsson; Patrik Haslum; Christer Bäckström (Artif. Intell., 2000)

An integrated multiple media news portal. - Caj Södergård; Matti Aaltonen; Christer Bäckström; Ari Heinonen; Timo Järvinen; Timo Kinnunen; Pauliina Koivunen; Sari Lehtola; Ville Ollikainen; Katja Rentto; Mikko Seppälä; Antti Tammela (ELPUB, 2001)

An Integrated Multiple Media Portal with Semiautomatic Editing Features. - Caj Södergård; Matti Aaltonen; Christer Bäckström; Ari Heinonen; Timo Järvinen; Timo Kinnunen; Pauliina Koivunen; Sari Lehtola; Ville Ollikainen; Katja Rentto; Mikko Seppälä; Antti Tammela (WWW Posters, 2001)

Electronic editor: automatic content-based sequential compilation of newspaper articles. - Ville Ollikainen; Christer Bäckström; Samuel Kaski (Neurocomputing, 2002)

Limits for Compact Representation of Plans. - Christer Bäckström; Peter Jonsson (ICAPS, 2011)

All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. - Christer Bäckström; Peter Jonsson (SOCS, 2011)

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

Macros, Reactive Plans and Compact Representations. - Christer Bäckström; Anders Jonsson 001; Peter Jonsson (ECAI, 2012)

From Macro Plans to Automata Plans. - Christer Bäckström; Anders Jonsson 001; Peter Jonsson (ECAI, 2012)

Abstracting Abstraction in Search with Applications to Planning. - Christer Bäckström; Peter Jonsson (KR, 2012)

Abstracting Abstraction in Search II: Complexity Analysis. - Christer Bäckström; Peter Jonsson (SOCS, 2012)

Algorithms and Limits for Compact Plan Representations. - Christer Bäckström; Peter Jonsson (J. Artif. Intell. Res., 2012)

Parameterized Complexity and Kernel Bounds for Hard Planning Problems. - Christer Bäckström; Peter Jonsson; Sebastian Ordyniak; Stefan Szeider (CIAC, 2013)

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

Fast Detection of Unsolvable Planning Instances Using Local Consistency. - Christer Bäckström; Peter Jonsson; Simon Ståhlberg (SOCS, 2013)

A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. - Christer Bäckström; Peter Jonsson (J. Artif. Intell. Res., 2013)

Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs. - Christer Bäckström (ECAI, 2014)

Automaton Plans. - Christer Bäckström; Anders Jonsson 001; Peter Jonsson (J. Artif. Intell. Res., 2014)

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

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

A complete parameterized complexity analysis of bounded planning. - Christer Bäckström; Peter Jonsson; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2015)

A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning. - Meysam Aghighi; Christer Bäckström (ICAPS, 2016)

Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. - Meysam Aghighi; Christer Bäckström; Peter Jonsson; Simon Ståhlberg (ECAI, 2016)

Upper and Lower Time and Space Bounds for Planning. - Christer Bäckström; Peter Jonsson (ECAI, 2016)

Refining complexity analyses in planning by exploiting the exponential time hypothesis. - Meysam Aghighi; Christer Bäckström; Peter Jonsson; Simon Ståhlberg (Ann. Math. Artif. Intell., 2016)

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

Time and Space Bounds for Planning. - Christer Bäckström; Peter Jonsson (J. Artif. Intell. Res., 2017)

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

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

Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. - Christer Bäckström; Peter Jonsson; Sebastian Ordyniak (J. Artif. Intell. Res., 2021)

A framework for analysing state-abstraction methods. - Christer Bäckström; Peter Jonsson (Artif. Intell., 2022)