<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Marie Diana Sieper | AC Group | TU Wien</title><link>https://ac.notready.eu/author/marie-diana-sieper/</link><atom:link href="https://ac.notready.eu/author/marie-diana-sieper/index.xml" rel="self" type="application/rss+xml"/><description>Marie Diana Sieper</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 Jan 2026 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Marie Diana Sieper</title><link>https://ac.notready.eu/author/marie-diana-sieper/</link></image><item><title>The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern</title><link>https://ac.notready.eu/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/the-parameterized-complexity-of-ordering-a-graph-while-avoiding-a-forbidden-pattern-2/</guid><description/></item></channel></rss>