- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j13 |      | Christer Bäckström, Peter Jonsson: Algorithms and Limits for Compact Plan Representations. J. Artif. Intell. Res. (JAIR) 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 |
| 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 |
| 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 | | |
| c18 | | Christer Bäckström, Peter Jonsson: All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others. SOCS 2011 |
| i1 | | |
| 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) |
| 1999 | ||
| j10 | | Inger Klein, Peter Jonsson, Christer Bäckström: Efficient planning for a miniature assembly line. AI in Engineering 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. (JAIR) 9: 99-137 (1998) |
| 1996 | ||
| c15 | | |
| 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. Computational Intelligence 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 | | |
| 1993 | ||
| c9 | | |
| 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 | | |
| 1991 | ||
| j1 | | Christer Bäckström, Inger Klein: Planning in polynomial time: the SAS-PUBS class. Computational Intelligence 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 |
| 1988 | ||
| c3 | | |
| c2 | | Christer Bäckström: A Representation of Coordinated Actions Characterized by Interval Valued Conditions. ISMIS 1988: 220-229 |
| c1 | | |
Colors in the list of coauthors
Last update Tue May 21 19:03:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page