<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Philipp Kindermann | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/philipp-kindermann/</link><atom:link href="https://ac.tuwien.ac.at/team/philipp-kindermann/index.xml" rel="self" type="application/rss+xml"/><description>Philipp Kindermann</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.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Philipp Kindermann</title><link>https://ac.tuwien.ac.at/team/philipp-kindermann/</link></image><item><title>On the Complexity of Extending Storylines</title><link>https://ac.tuwien.ac.at/publication/on-the-complexity-of-extending-storylines/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-complexity-of-extending-storylines/</guid><description/></item><item><title>On the Recognition of Outerplanar Graphs with Queue Number 1</title><link>https://ac.tuwien.ac.at/publication/on-the-recognition-of-outerplanar-graphs-with-queue-number-1/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-recognition-of-outerplanar-graphs-with-queue-number-1/</guid><description/></item><item><title>Splitting Vertices in 2-Layer Graph Drawings</title><link>https://ac.tuwien.ac.at/publication/splitting-vertices-in-2-layer-graph-drawings/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/splitting-vertices-in-2-layer-graph-drawings/</guid><description/></item><item><title>Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth</title><link>https://ac.tuwien.ac.at/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/upward-and-orthogonal-planarity-are-w-1-hard-parameterized-by-treewidth/</guid><description/></item><item><title>ClusterSets: Optimizing Planar Clusters in Categorical Point Data</title><link>https://ac.tuwien.ac.at/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/</guid><description/></item><item><title>Lombardi Drawings of Knots and Links</title><link>https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links-2/</guid><description/></item><item><title>Lombardi Drawings of Knots and Links</title><link>https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lombardi-drawings-of-knots-and-links/</guid><description/></item></channel></rss>