Crossing Minimization in Storyline Visualization
From MaRDI portal
Publication:2961530
DOI10.1007/978-3-319-50106-2_29zbMath1478.68242arXiv1608.08027OpenAlexW2963463283MaRDI QIDQ2961530
Francesco Mambelli, Frauke Liers, Martin Gronemann, Michael Jünger
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.08027
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mathematics and literature (00A64)
Related Items (2)
Computing Storyline Visualizations with Few Block Crossings ⋮ Storyline Visualizations with Ubiquitous Actors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for multi-level graph planarity testing and layout
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- Comparing trees via crossing minimization
- Experiments in quadratic 0-1 programming
- The cut polytope and the Boolean quadric polytope
- Drawing (complete) binary tanglegrams
- The importance of being proper
- Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
- Exact Algorithms for the Quadratic Linear Ordering Problem
- On Minimizing Crossings in Storyline Visualizations
- Crossing Number is NP-Complete
- Facets of the linear ordering polytope
- On the cut polytope
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- An SDP approach to multi-level crossing minimization
- Line Crossing Minimization on Metro Maps
This page was built for publication: Crossing Minimization in Storyline Visualization
