<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Anaïs Villedieu | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/anais-villedieu/</link><atom:link href="https://ac.tuwien.ac.at/team/anais-villedieu/index.xml" rel="self" type="application/rss+xml"/><description>Anaïs Villedieu</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>Anaïs Villedieu</title><link>https://ac.tuwien.ac.at/team/anais-villedieu/</link></image><item><title>Multidimensional Manhattan preferences</title><link>https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences-2/</guid><description/></item><item><title>Planarizing Graphs and their Drawings by Vertex Splitting</title><link>https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting-2/</guid><description/></item><item><title>The complexity of cluster vertex splitting and company</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company-2/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company-2/</guid><description/></item><item><title>Splitting Plane Graphs to Outerplanarity</title><link>https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity-2/</guid><description/></item><item><title>The Complexity of Cluster Vertex Splitting and Company</title><link>https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/</guid><description/></item><item><title>Crossing Minimization in Time Interval Storylines</title><link>https://ac.tuwien.ac.at/publication/crossing-minimization-in-time-interval-storylines/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/crossing-minimization-in-time-interval-storylines/</guid><description/></item><item><title>MySemCloud: Semantic-aware Word Cloud Editing</title><link>https://ac.tuwien.ac.at/publication/mysemcloud-semantic-aware-word-cloud-editing/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/mysemcloud-semantic-aware-word-cloud-editing/</guid><description/></item><item><title>Planarizing Graphs and their Drawings by Vertex Splitting</title><link>https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/</guid><description/></item><item><title>Splitting Plane Graphs to Outerplanarity</title><link>https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/splitting-plane-graphs-to-outerplanarity/</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>Minimum Link Fencing</title><link>https://ac.tuwien.ac.at/publication/minimum-link-fencing/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/minimum-link-fencing/</guid><description/></item><item><title>Multidimensional Manhattan Preferences</title><link>https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences/</guid><description/></item><item><title>Turbocharging Heuristics for Weak Coloring Numbers</title><link>https://ac.tuwien.ac.at/publication/turbocharging-heuristics-for-weak-coloring-numbers/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/turbocharging-heuristics-for-weak-coloring-numbers/</guid><description/></item><item><title>Layered Area-Proportional Rectangle Contact Representation</title><link>https://ac.tuwien.ac.at/publication/layered-area-proportional-rectangle-contact-representation/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/layered-area-proportional-rectangle-contact-representation/</guid><description/></item><item><title>Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks</title><link>https://ac.tuwien.ac.at/publication/efficient-non-segregated-routing-for-reconfigurable-demand-aware-networks/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/efficient-non-segregated-routing-for-reconfigurable-demand-aware-networks/</guid><description/></item></channel></rss>