Christer Bäckström

Publication Activity (10 Years)

Years Active: 1988-2022
Publications (10 Years): 14

Top Topics

Parameterized Complexity

Optimal Planning

Planning Problems

Top Venues

J. Artif. Intell. Res.

Publications

Christer Bäckström, Peter Jonsson
A framework for analysing state-abstraction methods. Artif. Intell. 302 (2022)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. J. Artif. Intell. Res. 70 (2021)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. IJCAI (2019)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. IJCAI (2018)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. SOCS (2018)
Meysam Aghighi, Christer Bäckström
Plan Reordering and Parallel Execution - A Parameterized Complexity View. AAAI (2017)
Christer Bäckström, Peter Jonsson
Time and Space Bounds for Planning. J. Artif. Intell. Res. 60 (2017)
Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg
Refining complexity analyses in planning by exploiting the exponential time hypothesis. Ann. Math. Artif. Intell. 78 (2) (2016)
Christer Bäckström, Peter Jonsson
Upper and Lower Time and Space Bounds for Planning. ECAI (2016)
Meysam Aghighi, Christer Bäckström
A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning. ICAPS (2016)
Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg
Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. ECAI (2016)
Meysam Aghighi, Christer Bäckström
Cost-Optimal and Net-Benefit Planning - A Parameterised Complexity View. IJCAI (2015)
Christer Bäckström
Some Fixed Parameter Tractability Results for Planning with Non-Acyclic Domain-Transition Graphs. AAAI (2015)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci. 81 (7) (2015)
Christer Bäckström
Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs. ECAI (2014)
Christer Bäckström, Peter Jonsson
Algorithms and Limits for Compact Plan Representations. CoRR (2014)
Christer Bäckström, Peter Jonsson
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. CoRR (2014)
Christer Bäckström, Anders Jonsson, Peter Jonsson
Automaton Plans. J. Artif. Intell. Res. 51 (2014)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CIAC (2013)
Christer Bäckström, Peter Jonsson
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. J. Artif. Intell. Res. 47 (2013)
Christer Bäckström, Peter Jonsson
Bridging the Gap Between Refinement and Heuristics in Abstraction. IJCAI (2013)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
A Complete Parameterized Complexity Analysis of Bounded Planning. CoRR (2013)
Christer Bäckström, Peter Jonsson, Simon Ståhlberg
Fast Detection of Unsolvable Planning Instances Using Local Consistency. SOCS (2013)
Christer Bäckström, Anders Jonsson, Peter Jonsson
Macros, Reactive Plans and Compact Representations. ECAI (2012)
Christer Bäckström, Peter Jonsson
Algorithms and Limits for Compact Plan Representations. J. Artif. Intell. Res. 44 (2012)
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
The Complexity of Planning Revisited - A Parameterized Analysis CoRR (2012)
Christer Bäckström, Peter Jonsson
Abstracting Abstraction in Search II: Complexity Analysis. SOCS (2012)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Parameterized Complexity and Kernel Bounds for Hard Planning Problems CoRR (2012)
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
The Complexity of Planning Revisited - A Parameterized Analysis. AAAI (2012)
Christer Bäckström, Anders Jonsson, Peter Jonsson
From Macro Plans to Automata Plans. ECAI (2012)
Christer Bäckström, Peter Jonsson
Abstracting Abstraction in Search with Applications to Planning. KR (2012)
Christer Bäckström, Peter Jonsson
Limits for Compact Representation of Plans. ICAPS (2011)
Christer Bäckström, Peter Jonsson
All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. SOCS (2011)
Christer Bäckström
Computational Aspects of Reordering Plans CoRR (2011)
Ville Ollikainen, Christer Bäckström, Samuel Kaski
Electronic editor: automatic content-based sequential compilation of newspaper articles. Neurocomputing 43 (1-4) (2002)
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
An Integrated Multiple Media Portal with Semiautomatic Editing Features. WWW Posters (2001)
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
An integrated multiple media news portal. ELPUB (2001)
Peter Jonsson, Patrik Haslum, Christer Bäckström
Towards efficient universal planning: A randomized approach. Artif. Intell. 117 (1) (2000)
Peter Jonsson, Thomas Drakengren, Christer Bäckström
Computational Complexity of Relating Time Points with Intervals. Artif. Intell. 109 (1-2) (1999)
Inger Klein, Peter Jonsson, Christer Bäckström
Efficient planning for a miniature assembly line. Artif. Intell. Eng. 13 (1) (1999)
Peter Jonsson, Christer Bäckström
A Unifying Approach to Temporal Constraint Reasoning. Artif. Intell. 102 (1) (1998)
Peter Jonsson, Christer Bäckström
Tractable Plan Existence Does Not Imply Tractable Plan Generation. Ann. Math. Artif. Intell. 22 (3-4) (1998)
Christer Bäckström
Computational Aspects of Reordering Plans. J. Artif. Intell. Res. 9 (1998)
Peter Jonsson, Christer Bäckström
State-Variable Planning Under Structural Restrictions: Algorithms and Complexity. Artif. Intell. 100 (1-2) (1998)
Peter Jonsson, Thomas Drakengren, Christer Bäckström
Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. KR (1996)
Peter Jonsson, Christer Bäckström
A Linear-Programming Approach to Temporal Reasoning. AAAI/IAAI, Vol. 2 (1996)
Peter Jonsson, Christer Bäckström
On the Size of Reactive Plans. AAAI/IAAI, Vol. 2 (1996)
Christer Bäckström, Bernhard Nebel
Complexity Results for SAS+ Planning. Comput. Intell. 11 (1995)
Christer Bäckström, Peter Jonsson
Planning with Abstraction Hierarchies can be Exponentially Less Efficient. IJCAI (1995)
Christer Bäckström
Expressive Equivalence of Planning Formalisms. Artif. Intell. 76 (1-2) (1995)
Peter Jonsson, Christer Bäckström
Tractable Planning with State Variables by Exploiting Structural Restrictions. AAAI (1994)
Christer Bäckström
Executing Parallel Plans Faster by Adding Actions. ECAI (1994)
Bernhard Nebel, Christer Bäckström
On the Computational Complexity of Temporal Projection, Planning, and Plan Validation. Artif. Intell. 66 (1) (1994)
Christer Bäckström, Bernhard Nebel
Complexity Results for SAS+ Planning. IJCAI (1993)
Christer Bäckström, Bernhard Nebel
On the Computational Complexity of Planning and Story Understanding. ECAI (1992)
Bernhard Nebel, Christer Bäckström
On the Computational Complexity of Temporal Projection and Plan Validation. AAAI (1992)
Christer Bäckström
Equivalence and Tractability Results for SAS+ Planning. KR (1992)
Christer Bäckström, Inger Klein
Parallel Non-Binary Planning in Polynomial Time. IJCAI (1991)
Christer Bäckström, Inger Klein
Planning in polynomial time: the SAS-PUBS class. Comput. Intell. 7 (1991)
Christer Bäckström, Inger Klein
Planning in Polynomial Time. Expert Systems in Engineering (1990)
Christer Bäckström
Action Structures with Implicit Coordination. AIMSA (1988)
Christer Bäckström
A Representation of Coordinated Actions. SCAI (1988)
Christer Bäckström
A Representation of Coordinated Actions Characterized by Interval Valued Conditions. ISMIS (1988)