default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChrister Bäckström
Person information
- affiliation: Linköping University, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j20]Christer Bäckström
, Peter Jonsson:
A framework for analysing state-abstraction methods. Artif. Intell. 302: 103608 (2022)- 2021
- [j19]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak:
Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. J. Artif. Intell. Res. 70: 169-204 (2021)
2010 – 2019
- 2019
- [c37]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak:
A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. IJCAI 2019: 6126-6130 - 2018
- [c36]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak:
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. IJCAI 2018: 4653-4659 - [c35]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak:
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. SOCS 2018: 19-27 - 2017
- [j18]Christer Bäckström, Peter Jonsson:
Time and Space Bounds for Planning. J. Artif. Intell. Res. 60: 595-638 (2017) - [c34]Meysam Aghighi, Christer Bäckström:
Plan Reordering and Parallel Execution - A Parameterized Complexity View. AAAI 2017: 3540-3546 - 2016
- [j17]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): 157-175 (2016) - [c33]Meysam Aghighi, Christer Bäckström:
A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning. ICAPS 2016: 2-10 - [c32]Meysam Aghighi, Christer Bäckström, Peter Jonsson, Simon Ståhlberg:
Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis. ECAI 2016: 184-192 - [c31]Christer Bäckström, Peter Jonsson:
Upper and Lower Time and Space Bounds for Planning. ECAI 2016: 716-724 - 2015
- [j16]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci. 81(7): 1311-1332 (2015) - [c30]Christer Bäckström:
Some Fixed Parameter Tractability Results for Planning with Non-Acyclic Domain-Transition Graphs. AAAI 2015: 3232-3238 - [c29]Meysam Aghighi, Christer Bäckström:
Cost-Optimal and Net-Benefit Planning - A Parameterised Complexity View. IJCAI 2015: 1487-1493 - 2014
- [j15]Christer Bäckström, Anders Jonsson, Peter Jonsson:
Automaton Plans. J. Artif. Intell. Res. 51: 255-291 (2014) - [c28]Christer Bäckström:
Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs. ECAI 2014: 33-38 - [i6]Christer Bäckström, Peter Jonsson:
Algorithms and Limits for Compact Plan Representations. CoRR abs/1401.5848 (2014) - [i5]Christer Bäckström, Peter Jonsson:
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond. CoRR abs/1402.0588 (2014) - 2013
- [j14]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: 575-611 (2013) - [c27]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CIAC 2013: 13-24 - [c26]Christer Bäckström, Peter Jonsson:
Bridging the Gap Between Refinement and Heuristics in Abstraction. IJCAI 2013: 2261-2267 - [c25]Christer Bäckström, Peter Jonsson, Simon Ståhlberg:
Fast Detection of Unsolvable Planning Instances Using Local Consistency. SOCS 2013: 29-37 - [i4]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
A Complete Parameterized Complexity Analysis of Bounded Planning. CoRR abs/1310.7828 (2013) - 2012
- [j13]Christer Bäckström, Peter Jonsson:
Algorithms and Limits for Compact Plan Representations. J. Artif. Intell. Res. 44: 141-177 (2012) - [c24]Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Planning Revisited - A Parameterized Analysis. AAAI 2012: 1735-1741 - [c23]Christer Bäckström, Anders Jonsson, Peter Jonsson:
Macros, Reactive Plans and Compact Representations. ECAI 2012: 85-90 - [c22]Christer Bäckström, Anders Jonsson, Peter Jonsson:
From Macro Plans to Automata Plans. ECAI 2012: 91-96 - [c21]Christer Bäckström, Peter Jonsson:
Abstracting Abstraction in Search with Applications to Planning. KR 2012 - [c20]Christer Bäckström, Peter Jonsson:
Abstracting Abstraction in Search II: Complexity Analysis. SOCS 2012: 10-17 - [i3]Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Planning Revisited - A Parameterized Analysis. CoRR abs/1208.2566 (2012) - [i2]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CoRR abs/1211.0479 (2012) - 2011
- [c19]Christer Bäckström, Peter Jonsson:
Limits for Compact Representation of Plans. ICAPS 2011 - [c18]Christer Bäckström, Peter Jonsson:
All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. SOCS 2011: 10-17 - [i1]Christer Bäckström:
Computational Aspects of Reordering Plans. CoRR abs/1105.5441 (2011)
2000 – 2009
- 2002
- [j12]Ville Ollikainen, Christer Bäckström, Samuel Kaski:
Electronic editor: automatic content-based sequential compilation of newspaper articles. Neurocomputing 43(1-4): 91-106 (2002) - 2001
- [c17]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 - [c16]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 - 2000
- [j11]Peter Jonsson, Patrik Haslum, Christer Bäckström:
Towards efficient universal planning: A randomized approach. Artif. Intell. 117(1): 1-29 (2000)
1990 – 1999
- 1999
- [j10]Inger Klein, Peter Jonsson, Christer Bäckström:
Efficient planning for a miniature assembly line. Artif. Intell. Eng. 13(1): 69-81 (1999) - [j9]Peter Jonsson, Thomas Drakengren, Christer Bäckström:
Computational Complexity of Relating Time Points with Intervals. Artif. Intell. 109(1-2): 273-295 (1999) - 1998
- [j8]Peter Jonsson, Christer Bäckström:
State-Variable Planning Under Structural Restrictions: Algorithms and Complexity. Artif. Intell. 100(1-2): 125-176 (1998) - [j7]Peter Jonsson, Christer Bäckström:
A Unifying Approach to Temporal Constraint Reasoning. Artif. Intell. 102(1): 143-155 (1998) - [j6]Peter Jonsson, Christer Bäckström:
Tractable Plan Existence Does Not Imply Tractable Plan Generation. Ann. Math. Artif. Intell. 22(3-4): 281-296 (1998) - [j5]Christer Bäckström:
Computational Aspects of Reordering Plans. J. Artif. Intell. Res. 9: 99-137 (1998) - 1996
- [c15]Peter Jonsson, Christer Bäckström:
On the Size of Reactive Plans. AAAI/IAAI, Vol. 2 1996: 1182-1187 - [c14]Peter Jonsson, Christer Bäckström:
A Linear-Programming Approach to Temporal Reasoning. AAAI/IAAI, Vol. 2 1996: 1235-1240 - [c13]Peter Jonsson, Thomas Drakengren, Christer Bäckström:
Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. KR 1996: 352-363 - 1995
- [j4]Christer Bäckström:
Expressive Equivalence of Planning Formalisms. Artif. Intell. 76(1-2): 17-34 (1995) - [j3]Christer Bäckström, Bernhard Nebel:
Complexity Results for SAS+ Planning. Comput. Intell. 11: 625-656 (1995) - [c12]Christer Bäckström, Peter Jonsson:
Planning with Abstraction Hierarchies can be Exponentially Less Efficient. IJCAI 1995: 1599-1605 - 1994
- [j2]Bernhard Nebel, Christer Bäckström:
On the Computational Complexity of Temporal Projection, Planning, and Plan Validation. Artif. Intell. 66(1): 125-160 (1994) - [c11]Peter Jonsson, Christer Bäckström:
Tractable Planning with State Variables by Exploiting Structural Restrictions. AAAI 1994: 998-1003 - [c10]Christer Bäckström:
Executing Parallel Plans Faster by Adding Actions. ECAI 1994: 615-619 - 1993
- [c9]Christer Bäckström, Bernhard Nebel:
Complexity Results for SAS+ Planning. IJCAI 1993: 1430-1435 - 1992
- [c8]Bernhard Nebel, Christer Bäckström:
On the Computational Complexity of Temporal Projection and Plan Validation. AAAI 1992: 748-753 - [c7]Christer Bäckström, Bernhard Nebel:
On the Computational Complexity of Planning and Story Understanding. ECAI 1992: 349-353 - [c6]Christer Bäckström:
Equivalence and Tractability Results for SAS+ Planning. KR 1992: 126-137 - 1991
- [j1]Christer Bäckström, Inger Klein:
Planning in polynomial time: the SAS-PUBS class. Comput. Intell. 7: 181-197 (1991) - [c5]Christer Bäckström, Inger Klein:
Parallel Non-Binary Planning in Polynomial Time. IJCAI 1991: 268-273 - 1990
- [c4]Christer Bäckström, Inger Klein:
Planning in Polynomial Time. Expert Systems in Engineering 1990: 103-118
1980 – 1989
- 1988
- [c3]Christer Bäckström:
Action Structures with Implicit Coordination. AIMSA 1988: 103-110 - [c2]Christer Bäckström:
A Representation of Coordinated Actions Characterized by Interval Valued Conditions. ISMIS 1988: 220-229 - [c1]Christer Bäckström:
A Representation of Coordinated Actions. SCAI 1988: 205-220
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
