LINORD | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/linord/LINORDHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngLINORDhttps://ac.tuwien.ac.at/tag/linord/$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairnesshttps://ac.tuwien.ac.at/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/f-2-stories-a-modular-framework-for-multi-objective-optimization-of-storylines-with-a-focus-on-fairness/Block Crossings in One-Sided Tanglegramshttps://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams-2/Clarity and Computational Efficiency of Orbital Boundary Labelinghttps://ac.tuwien.ac.at/publication/clarity-and-computational-efficiency-of-orbital-boundary-labeling/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/clarity-and-computational-efficiency-of-orbital-boundary-labeling/Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchieshttps://ac.tuwien.ac.at/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-visual-clutter-in-temporal-treemaps-to-enable-comparison-of-evolving-hierarchies/Multidimensional Manhattan preferenceshttps://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences-2/Representing Hypergraphs by Point-Line Incidenceshttps://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences-2/The Story(line) So Far: A Survey on Storyline Visualizationhttps://ac.tuwien.ac.at/publication/the-story-line-so-far-a-survey-on-storyline-visualization/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-story-line-so-far-a-survey-on-storyline-visualization/A note on the complexity of one-sided crossing minimization of treeshttps://ac.tuwien.ac.at/publication/a-note-on-the-complexity-of-one-sided-crossing-minimization-of-trees/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-note-on-the-complexity-of-one-sided-crossing-minimization-of-trees/Constrained Boundary Labelinghttps://ac.tuwien.ac.at/publication/constrained-boundary-labeling-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/constrained-boundary-labeling-2/Geometry Matters in Planar Storyplanshttps://ac.tuwien.ac.at/publication/geometry-matters-in-planar-storyplans/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/geometry-matters-in-planar-storyplans/On Minimizing Wiggle in Stacked Area Chartshttps://ac.tuwien.ac.at/publication/on-minimizing-wiggle-in-stacked-area-charts/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-minimizing-wiggle-in-stacked-area-charts/Optimizing Staircase Motifs in Biofabric Network Layoutshttps://ac.tuwien.ac.at/publication/optimizing-staircase-motifs-in-biofabric-network-layouts/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-staircase-motifs-in-biofabric-network-layouts/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/Representing Hypergraphs by Point-Line Incidenceshttps://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/representing-hypergraphs-by-point-line-incidences/The complexity of cluster vertex splitting and companyhttps://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company-2/Transitions in Dynamic Point Labelinghttps://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling-2/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/transitions-in-dynamic-point-labeling-2/Boundary Labeling in a Circular Orbithttps://ac.tuwien.ac.at/publication/boundary-labeling-in-a-circular-orbit/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/boundary-labeling-in-a-circular-orbit/Bundling-Aware Graph Drawinghttps://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/bundling-aware-graph-drawing/Computing Data-driven Multilinear Metro Mapshttps://ac.tuwien.ac.at/publication/computing-data-driven-multilinear-metro-maps/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-data-driven-multilinear-metro-maps/Computing Hive Plots: A Combinatorial Frameworkhttps://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework-2/Constrained Boundary Labelinghttps://ac.tuwien.ac.at/publication/constrained-boundary-labeling/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/constrained-boundary-labeling/GdMetriX - A NetworkX Extension For Graph Drawing Metricshttps://ac.tuwien.ac.at/publication/gdmetrix-a-networkx-extension-for-graph-drawing-metrics/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/gdmetrix-a-networkx-extension-for-graph-drawing-metrics/Hoop Diagrams: A Set Visualization Methodhttps://ac.tuwien.ac.at/publication/hoop-diagrams-a-set-visualization-method/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hoop-diagrams-a-set-visualization-method/Improving Temporal Treemaps by Minimizing Crossingshttps://ac.tuwien.ac.at/publication/improving-temporal-treemaps-by-minimizing-crossings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/improving-temporal-treemaps-by-minimizing-crossings/Minimizing Corners in Colored Rectilinear Gridshttps://ac.tuwien.ac.at/publication/minimizing-corners-in-colored-rectilinear-grids/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-corners-in-colored-rectilinear-grids/On the Complexity of the Storyplan Problemhttps://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-complexity-of-the-storyplan-problem-2/PACE Solver Description: CRGonehttps://ac.tuwien.ac.at/publication/pace-solver-description-crgone/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-crgone/Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawingshttps://ac.tuwien.ac.at/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings/The Complexity of Cluster Vertex Splitting and Companyhttps://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-cluster-vertex-splitting-and-company/Block Crossings in One-Sided Tanglegramshttps://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/block-crossings-in-one-sided-tanglegrams/Computing Hive Plots: A Combinatorial Frameworkhttps://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-hive-plots-a-combinatorial-framework/Crossing Minimization in Time Interval Storylineshttps://ac.tuwien.ac.at/publication/crossing-minimization-in-time-interval-storylines/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-minimization-in-time-interval-storylines/Faster Edge-Path Bundling Through Graph Spannershttps://ac.tuwien.ac.at/publication/faster-edge-path-bundling-through-graph-spanners/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/faster-edge-path-bundling-through-graph-spanners/LinSets.zip: Compressing Linear Set Diagramshttps://ac.tuwien.ac.at/publication/linsets-zip-compressing-linear-set-diagrams/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/linsets-zip-compressing-linear-set-diagrams/MosaicSets: Embedding Set Systems into Grid Graphshttps://ac.tuwien.ac.at/publication/mosaicsets-embedding-set-systems-into-grid-graphs/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/mosaicsets-embedding-set-systems-into-grid-graphs/On Families of Planar DAGs with Constant Stack Numberhttps://ac.tuwien.ac.at/publication/on-families-of-planar-dags-with-constant-stack-number/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-families-of-planar-dags-with-constant-stack-number/PACE Solver Description: Touiouidthhttps://ac.tuwien.ac.at/publication/pace-solver-description-touiouidth/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/pace-solver-description-touiouidth/Planarizing Graphs and their Drawings by Vertex Splittinghttps://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/planarizing-graphs-and-their-drawings-by-vertex-splitting/Splitting Vertices in 2-Layer Graph Drawingshttps://ac.tuwien.ac.at/publication/splitting-vertices-in-2-layer-graph-drawings/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/splitting-vertices-in-2-layer-graph-drawings/The Influence of Dimensions on the Complexity of Computing Decision Treeshttps://ac.tuwien.ac.at/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-influence-of-dimensions-on-the-complexity-of-computing-decision-trees/Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squareshttps://ac.tuwien.ac.at/publication/compacting-squares-input-sensitive-in-place-reconfiguration-of-sliding-squares/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/compacting-squares-input-sensitive-in-place-reconfiguration-of-sliding-squares/Edge-Path Bundling: A Less Ambiguous Edge Bundling Approachhttps://ac.tuwien.ac.at/publication/edge-path-bundling-a-less-ambiguous-edge-bundling-approach/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/edge-path-bundling-a-less-ambiguous-edge-bundling-approach/Multidimensional Manhattan Preferenceshttps://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/multidimensional-manhattan-preferences/On Computing Optimal Linear Diagramshttps://ac.tuwien.ac.at/publication/on-computing-optimal-linear-diagrams/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-computing-optimal-linear-diagrams/Turbocharging Heuristics for Weak Coloring Numbershttps://ac.tuwien.ac.at/publication/turbocharging-heuristics-for-weak-coloring-numbers/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/turbocharging-heuristics-for-weak-coloring-numbers/MetroSets: Visualizing Sets as Metro Mapshttps://ac.tuwien.ac.at/publication/metrosets-visualizing-sets-as-metro-maps/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/metrosets-visualizing-sets-as-metro-maps/On the Readability of Abstract Set Visualizationshttps://ac.tuwien.ac.at/publication/on-the-readability-of-abstract-set-visualizations/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-readability-of-abstract-set-visualizations/