( en | de | ru )

 

Disambiguation of "Bäckström, Christer"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Complexity and Kernel Bounds for Hard Planning Problems.

, , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 13-24. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christer Lindqvist

Christer Thörn

Christer Beckmann

Christer Petersen

Christer Johann

 

Other publications of authors with the same name

Time and Space Bounds for Planning., and . J. Artif. Intell. Res., (2017)Tractable Subclasses of the Point-Interval Algebra: A Complete Classification., , and . KR, page 352-363. Morgan Kaufmann, (1996)Complexity Results for SAS+ Planning., and . IJCAI, page 1430-1435. Morgan Kaufmann, (1993)A Linear-Programming Approach to Temporal Reasoning., and . AAAI/IAAI, Vol. 2, page 1235-1240. AAAI Press / The MIT Press, (1996)0-262-51091-X.An integrated multiple media news portal., , , , , , , , , and 2 other author(s). ELPUB, IOS Press, (2001)A Representation of Coordinated Actions.. SCAI, volume 1 of Frontiers in Artificial Intelligence and Applications, page 205-220. IOS Press, (1988)Planning with Abstraction Hierarchies can be Exponentially Less Efficient., and . IJCAI, page 1599-1605. Morgan Kaufmann, (1995)From Macro Plans to Automata Plans., , and . ECAI, volume 242 of Frontiers in Artificial Intelligence and Applications, page 91-96. IOS Press, (2012)Executing Parallel Plans Faster by Adding Actions.. ECAI, page 615-619. John Wiley and Sons, Chichester, (1994)Upper and Lower Time and Space Bounds for Planning., and . ECAI, volume 285 of Frontiers in Artificial Intelligence and Applications, page 716-724. IOS Press, (2016)