Alexander Wolff | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/alexander-wolff/Alexander WolffHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngAlexander Wolffhttps://ac.tuwien.ac.at/team/alexander-wolff/On the Recognition of Outerplanar Graphs with Queue Number 1https://ac.tuwien.ac.at/publication/on-the-recognition-of-outerplanar-graphs-with-queue-number-1/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-recognition-of-outerplanar-graphs-with-queue-number-1/One-Sided Local Crossing Minimizationhttps://ac.tuwien.ac.at/publication/one-sided-local-crossing-minimization/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/one-sided-local-crossing-minimization/Optimizing Wiggle in Storylineshttps://ac.tuwien.ac.at/publication/optimizing-wiggle-in-storylines/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-wiggle-in-storylines/StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Datahttps://ac.tuwien.ac.at/publication/storysets-ordering-curves-and-dimensions-for-visualizing-uncertain-sets-and-multi-dimensional-discrete-data/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/storysets-ordering-curves-and-dimensions-for-visualizing-uncertain-sets-and-multi-dimensional-discrete-data/Bounding and Computing Obstacle Numbers of Graphshttps://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs-2/Bounding and Computing Obstacle Numbers of Graphshttps://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/bounding-and-computing-obstacle-numbers-of-graphs/ClusterSets: Optimizing Planar Clusters in Categorical Point Datahttps://ac.tuwien.ac.at/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/clustersets-optimizing-planar-clusters-in-categorical-point-data/Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexityhttps://ac.tuwien.ac.at/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity/Planar L-Drawings of Directed Graphshttps://ac.tuwien.ac.at/publication/planar-l-drawings-of-directed-graphs/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/planar-l-drawings-of-directed-graphs/Progress on Partial Edge Drawingshttps://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings-2/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings-2/Semantic Word Cloud Representations: Hardness and Approximation Algorithmshttps://ac.tuwien.ac.at/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/semantic-word-cloud-representations-hardness-and-approximation-algorithms/Drawing Metro Maps using Bézier Curveshttps://ac.tuwien.ac.at/publication/drawing-metro-maps-using-bezier-curves/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-metro-maps-using-bezier-curves/Progress on Partial Edge Drawingshttps://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/progress-on-partial-edge-drawings/Cover Contact Graphshttps://ac.tuwien.ac.at/publication/cover-contact-graphs-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/cover-contact-graphs-2/Drawing (Complete) Binary Tanglegramshttps://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams/Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programminghttps://ac.tuwien.ac.at/publication/drawing-and-labeling-high-quality-metro-maps-by-mixed-integer-programming/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-and-labeling-high-quality-metro-maps-by-mixed-integer-programming/Optimizing Active Ranges for Consistent Dynamic Map Labelinghttps://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling-2/Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractabilityhttps://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-complete-binary-tanglegrams-hardness-approximation-fixed-parameter-tractability/Drawing Binary Tanglegrams: An Experimental Evaluationhttps://ac.tuwien.ac.at/publication/drawing-binary-tanglegrams-an-experimental-evaluation/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/drawing-binary-tanglegrams-an-experimental-evaluation/Cover Contact Graphshttps://ac.tuwien.ac.at/publication/cover-contact-graphs/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/cover-contact-graphs/Morphing Polylines: A Step Towards Continuous Generalizationhttps://ac.tuwien.ac.at/publication/morphing-polylines-a-step-towards-continuous-generalization/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/morphing-polylines-a-step-towards-continuous-generalization/Optimizing Active Ranges for Consistent Dynamic Map Labelinghttps://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-active-ranges-for-consistent-dynamic-map-labeling/Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Mapshttps://ac.tuwien.ac.at/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-intra-edge-crossings-in-wiring-diagrams-and-public-transportation-maps/Morphing Polygonal Lines: A Step Towards Continuous Generalizationhttps://ac.tuwien.ac.at/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/morphing-polygonal-lines-a-step-towards-continuous-generalization/A Mixed-Integer Program for Drawing High-Quality Metro Mapshttps://ac.tuwien.ac.at/publication/a-mixed-integer-program-for-drawing-high-quality-metro-maps/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-mixed-integer-program-for-drawing-high-quality-metro-maps/