<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Carsten Thomassen | AC Group | TU Wien</title><link>https://ac.notready.eu/author/carsten-thomassen/</link><atom:link href="https://ac.notready.eu/author/carsten-thomassen/index.xml" rel="self" type="application/rss+xml"/><description>Carsten Thomassen</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jan 2007 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Carsten Thomassen</title><link>https://ac.notready.eu/author/carsten-thomassen/</link></image><item><title>On the Complexity of Some Colorful Problems Parameterized by Treewidth</title><link>https://ac.notready.eu/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/on-the-complexity-of-some-colorful-problems-parameterized-by-treewidth/</guid><description/></item></channel></rss>