Christer Bäckström

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