<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Alexander Dobler | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/alexander-dobler/</link><atom:link href="https://ac.tuwien.ac.at/team/alexander-dobler/index.xml" rel="self" type="application/rss+xml"/><description>Alexander Dobler</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>Alexander Dobler</title><link>https://ac.tuwien.ac.at/team/alexander-dobler/</link></image><item><title>Block Crossings in One-Sided Tanglegrams</title><link>https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams-2/</guid><description/></item><item><title>Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies</title><link>https://ac.tuwien.ac.at/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/</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>Representing Hypergraphs by Point-Line Incidences</title><link>https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences-2/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences-2/</guid><description/></item><item><title>The Story(line) So Far: A Survey on Storyline Visualization</title><link>https://ac.tuwien.ac.at/publication/the-story-line-so-far-a-survey-on-storyline-visualization/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/the-story-line-so-far-a-survey-on-storyline-visualization/</guid><description/></item><item><title>A note on the complexity of one-sided crossing minimization of trees</title><link>https://ac.tuwien.ac.at/publication/a-note-on-the-complexity-of-one-sided-crossing-minimization-of-trees/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-note-on-the-complexity-of-one-sided-crossing-minimization-of-trees/</guid><description/></item><item><title>Geometry Matters in Planar Storyplans</title><link>https://ac.tuwien.ac.at/publication/geometry-matters-in-planar-storyplans/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/geometry-matters-in-planar-storyplans/</guid><description/></item><item><title>On Minimizing Wiggle in Stacked Area Charts</title><link>https://ac.tuwien.ac.at/publication/on-minimizing-wiggle-in-stacked-area-charts/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-minimizing-wiggle-in-stacked-area-charts/</guid><description/></item><item><title>Optimizing Wiggle in Storylines</title><link>https://ac.tuwien.ac.at/publication/optimizing-wiggle-in-storylines/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/optimizing-wiggle-in-storylines/</guid><description/></item><item><title>PACE Solver Description: Bad Dominating Set Maker</title><link>https://ac.tuwien.ac.at/publication/pace-solver-description-bad-dominating-set-maker/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pace-solver-description-bad-dominating-set-maker/</guid><description/></item><item><title>Representing Hypergraphs by Point-Line Incidences</title><link>https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences/</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>Hoop Diagrams: A Set Visualization Method</title><link>https://ac.tuwien.ac.at/publication/hoop-diagrams-a-set-visualization-method/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/hoop-diagrams-a-set-visualization-method/</guid><description/></item><item><title>Improving Temporal Treemaps by Minimizing Crossings</title><link>https://ac.tuwien.ac.at/publication/improving-temporal-treemaps-by-minimizing-crossings/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/improving-temporal-treemaps-by-minimizing-crossings/</guid><description/></item><item><title>Minimizing Corners in Colored Rectilinear Grids</title><link>https://ac.tuwien.ac.at/publication/minimizing-corners-in-colored-rectilinear-grids/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/minimizing-corners-in-colored-rectilinear-grids/</guid><description/></item><item><title>PACE Solver Description: CRGone</title><link>https://ac.tuwien.ac.at/publication/pace-solver-description-crgone/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pace-solver-description-crgone/</guid><description/></item><item><title>Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings</title><link>https://ac.tuwien.ac.at/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/</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>Block Crossings in One-Sided Tanglegrams</title><link>https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams/</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>LinSets.zip: Compressing Linear Set Diagrams</title><link>https://ac.tuwien.ac.at/publication/linsets-zip-compressing-linear-set-diagrams/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/linsets-zip-compressing-linear-set-diagrams/</guid><description/></item><item><title>PACE Solver Description: Touiouidth</title><link>https://ac.tuwien.ac.at/publication/pace-solver-description-touiouidth/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/pace-solver-description-touiouidth/</guid><description/></item><item><title>On Computing Optimal Linear Diagrams</title><link>https://ac.tuwien.ac.at/publication/on-computing-optimal-linear-diagrams/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-computing-optimal-linear-diagrams/</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></channel></rss>