<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Giuseppe Liotta | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/giuseppe-liotta/</link><atom:link href="https://ac.tuwien.ac.at/team/giuseppe-liotta/index.xml" rel="self" type="application/rss+xml"/><description>Giuseppe Liotta</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>Giuseppe Liotta</title><link>https://ac.tuwien.ac.at/team/giuseppe-liotta/</link></image><item><title>$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness</title><link>https://ac.tuwien.ac.at/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/</guid><description/></item><item><title>Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawings</title><link>https://ac.tuwien.ac.at/publication/using-beta-proximity-to-reduce-distortion-in-bundled-graph-drawings/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/using-beta-proximity-to-reduce-distortion-in-bundled-graph-drawings/</guid><description/></item><item><title>Bundling-Aware Graph Drawing Revisited</title><link>https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing-revisited/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing-revisited/</guid><description/></item><item><title>F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness</title><link>https://ac.tuwien.ac.at/publication/f2stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/f2stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/</guid><description/></item><item><title>Introducing Fairness in Network Visualization</title><link>https://ac.tuwien.ac.at/publication/introducing-fairness-in-network-visualization/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/introducing-fairness-in-network-visualization/</guid><description/></item><item><title>Bundling-Aware Graph Drawing</title><link>https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing/</guid><description/></item><item><title>Introducing Fairness in Graph Visualization</title><link>https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization/</guid><description/></item><item><title>Introducing Fairness in Graph Visualization via Gradient Descent</title><link>https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization-via-gradient-descent/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/introducing-fairness-in-graph-visualization-via-gradient-descent/</guid><description/></item><item><title>On the Complexity of the Storyplan Problem</title><link>https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem-2/</guid><description/></item><item><title>On the Complexity of the Storyplan Problem</title><link>https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem/</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></channel></rss>