Christer Bäckström

According to our database, Christer Bäckström authored at least 55 papers between 1988 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

A framework for analysing state-abstraction methods.

Christer Bäckström, Peter Jonsson

Artif. Intell., 2022

2021

Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

J. Artif. Intell. Res., 2021

2019

A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

Novel Structural Parameters for Acyclic Planning Using Tree Embeddings.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Time and Space Bounds for Planning.

Christer Bäckström, Peter Jonsson

J. Artif. Intell. Res., 2017

Plan Reordering and Parallel Execution - A Parameterized Complexity View.

Meysam Aghighi, Christer Bäckström

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

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

Upper and Lower Time and Space Bounds for Planning.

Christer Bäckström, Peter Jonsson

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis.

Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning.

Meysam Aghighi, Christer Bäckström

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015

A complete parameterized complexity analysis of bounded planning.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider

J. Comput. Syst. Sci., 2015

Cost-Optimal and Net-Benefit Planning - A Parameterised Complexity View.

Meysam Aghighi, Christer Bäckström

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Some Fixed Parameter Tractability Results for Planning with Non-Acyclic Domain-Transition Graphs.

Christer Bäckström

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Automaton Plans.

Christer Bäckström, Anders Jonsson, Peter Jonsson

J. Artif. Intell. Res., 2014

Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs.

Christer Bäckström

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

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

Fast Detection of Unsolvable Planning Instances Using Local Consistency.

Christer Bäckström, Peter Jonsson, Simon Ståhlberg

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Bridging the Gap Between Refinement and Heuristics in Abstraction.

Christer Bäckström, Peter Jonsson

Proceedings of the IJCAI 2013, 2013

Parameterized Complexity and Kernel Bounds for Hard Planning Problems.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Algorithms and Limits for Compact Plan Representations.

Christer Bäckström, Peter Jonsson

J. Artif. Intell. Res., 2012

Abstracting Abstraction in Search II: Complexity Analysis.

Christer Bäckström, Peter Jonsson

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Abstracting Abstraction in Search with Applications to Planning.

Christer Bäckström, Peter Jonsson

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

From Macro Plans to Automata Plans.

Christer Bäckström, Anders Jonsson, Peter Jonsson

Proceedings of the ECAI 2012, 2012

Macros, Reactive Plans and Compact Representations.

Christer Bäckström, Anders Jonsson, Peter Jonsson

Proceedings of the ECAI 2012, 2012

The Complexity of Planning Revisited - A Parameterized Analysis.

Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others.

Christer Bäckström, Peter Jonsson

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Limits for Compact Representation of Plans.

Christer Bäckström, Peter Jonsson

Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

2002

Electronic editor: automatic content-based sequential compilation of newspaper articles.

Ville Ollikainen, Christer Bäckström, Samuel Kaski

Neurocomputing, 2002

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

Proceedings of the Poster Proceedings of the Tenth International World Wide Web Conference, 2001

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

Proceedings of the Electronic Publishing '01, 2001 in the Digital Publishing Odyssey: 5th ICCC/IFIP conference held at the University of Kent, 2001

2000

Towards efficient universal planning: A randomized approach.

Peter Jonsson, Patrik Haslum, Christer Bäckström

Artif. Intell., 2000

1999

Computational Complexity of Relating Time Points with Intervals.

Peter Jonsson, Thomas Drakengren, Christer Bäckström

Artif. Intell., 1999

Efficient planning for a miniature assembly line.

Inger Klein, Peter Jonsson, Christer Bäckström

Artif. Intell. Eng., 1999

1998

Computational Aspects of Reordering Plans.

Christer Bäckström

J. Artif. Intell. Res., 1998

Tractable Plan Existence Does Not Imply Tractable Plan Generation.

Peter Jonsson, Christer Bäckström

Ann. Math. Artif. Intell., 1998

A Unifying Approach to Temporal Constraint Reasoning.

Peter Jonsson, Christer Bäckström

Artif. Intell., 1998

State-Variable Planning Under Structural Restrictions: Algorithms and Complexity.

Peter Jonsson, Christer Bäckström

Artif. Intell., 1998

1996

Tractable Subclasses of the Point-Interval Algebra: A Complete Classification.

Peter Jonsson, Thomas Drakengren, Christer Bäckström

Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

A Linear-Programming Approach to Temporal Reasoning.

Peter Jonsson, Christer Bäckström

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

On the Size of Reactive Plans.

Peter Jonsson, Christer Bäckström

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Complexity Results for SAS+ Planning.

Christer Bäckström, Bernhard Nebel

Comput. Intell., 1995

Expressive Equivalence of Planning Formalisms.

Christer Bäckström

Artif. Intell., 1995

Planning with Abstraction Hierarchies can be Exponentially Less Efficient.

Christer Bäckström, Peter Jonsson

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994

On the Computational Complexity of Temporal Projection, Planning, and Plan Validation.

Bernhard Nebel, Christer Bäckström

Artif. Intell., 1994

Executing Parallel Plans Faster by Adding Actions.

Christer Bäckström

Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994

Tractable Planning with State Variables by Exploiting Structural Restrictions.

Peter Jonsson, Christer Bäckström

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1992

Equivalence and Tractability Results for SAS+ Planning.

Christer Bäckström

Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR'92). Cambridge, 1992

On the Computational Complexity of Planning and Story Understanding.

Christer Bäckström, Bernhard Nebel

Proceedings of the 10th European Conference on Artificial Intelligence, 1992

On the Computational Complexity of Temporal Projection and Plan Validation.

Bernhard Nebel, Christer Bäckström

Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991

Planning in polynomial time: the SAS-PUBS class.

Christer Bäckström, Inger Klein

Comput. Intell., 1991

Parallel Non-Binary Planning in Polynomial Time.

Christer Bäckström, Inger Klein

Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

1990

Planning in Polynomial Time.

Christer Bäckström, Inger Klein

Proceedings of the Expert Systems in Engineering, 1990

1988

A Representation of Coordinated Actions.

Christer Bäckström

Proceedings of the First Scandinavian Conference on Artificial Intelligence 1988, 1988

A Representation of Coordinated Actions Characterized by Interval Valued Conditions.

Christer Bäckström

Proceedings of the Methodologies for Intelligent Systems, 1988

Action Structures with Implicit Coordination.

Christer Bäckström

Proceedings of the Artificial Intelligence III: Methodology, Systems, Applications, 1988