<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Christer Bäckström | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/christer-backstrom/</link><atom:link href="https://ac.tuwien.ac.at/team/christer-backstrom/index.xml" rel="self" type="application/rss+xml"/><description>Christer Bäckström</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2015 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Christer Bäckström</title><link>https://ac.tuwien.ac.at/team/christer-backstrom/</link></image><item><title>A complete parameterized complexity analysis of bounded planning</title><link>https://ac.tuwien.ac.at/publication/a-complete-parameterized-complexity-analysis-of-bounded-planning/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-complete-parameterized-complexity-analysis-of-bounded-planning/</guid><description/></item><item><title>Parameterized Complexity and Kernel Bounds for Hard Planning Problems</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-and-kernel-bounds-for-hard-planning-problems/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-and-kernel-bounds-for-hard-planning-problems/</guid><description/></item><item><title>The Complexity of Planning Revisited - A Parameterized Analysis</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-planning-revisited-a-parameterized-analysis/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-planning-revisited-a-parameterized-analysis/</guid><description/></item></channel></rss>