<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fabrizio Montecchiani | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/fabrizio-montecchiani/</link><atom:link href="https://ac.tuwien.ac.at/team/fabrizio-montecchiani/index.xml" rel="self" type="application/rss+xml"/><description>Fabrizio Montecchiani</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>Fabrizio Montecchiani</title><link>https://ac.tuwien.ac.at/team/fabrizio-montecchiani/</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>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>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>Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable</title><link>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-2/</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>Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable</title><link>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable/</guid><description/></item><item><title>Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable</title><link>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/extending-orthogonal-planar-graph-drawings-is-fixed-parameter-tractable-3/</guid><description/></item><item><title>New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)</title><link>https://ac.tuwien.ac.at/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/new-frontiers-of-parameterized-complexity-in-graph-drawing-dagstuhl-seminar-23162/</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>On the Upward Book Thickness Problem: Combinatorial and Complexity Results</title><link>https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results-2/</guid><description/></item><item><title>The Influence of Dimensions on the Complexity of Computing Decision Trees</title><link>https://ac.tuwien.ac.at/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/</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>Parameterized Algorithms for Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-3/</guid><description/></item><item><title>Parameterized Algorithms for Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts/</guid><description/></item><item><title>On the Upward Book Thickness Problem: Combinatorial and Complexity Results</title><link>https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-upward-book-thickness-problem-combinatorial-and-complexity-results/</guid><description/></item><item><title>Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-in-graph-drawing-dagstuhl-seminar-21293/</guid><description/></item><item><title>Layered Fan-Planar Graph Drawings</title><link>https://ac.tuwien.ac.at/publication/layered-fan-planar-graph-drawings/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/layered-fan-planar-graph-drawings/</guid><description/></item><item><title>Parameterized Algorithms for Book Embedding Problems</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-2/</guid><description/></item><item><title>Parameterized Algorithms for Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-2/</guid><description/></item><item><title>Parameterized Algorithms for Queue Layouts</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-queue-layouts-4/</guid><description/></item><item><title>Parameterized Algorithms for Book Embedding Problems</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems-3/</guid><description/></item><item><title>Parameterized Algorithms for Book Embedding Problems</title><link>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-algorithms-for-book-embedding-problems/</guid><description/></item><item><title>Progress on Partial Edge Drawings</title><link>https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings-2/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings-2/</guid><description/></item><item><title>Progress on Partial Edge Drawings</title><link>https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings/</guid><description/></item></channel></rss>