Block Crossings in Storyline Visualizations
DOI10.1007/978-3-319-50106-2_30zbMath1478.68266arXiv1609.00321OpenAlexW2962908739MaRDI QIDQ2961533
Martin Fink, Peter Markfelder, Thomas C. van Dijk, Norbert Fischer, Fabian Lipp, Alexander Wolff, Subhash Suri, O. V. Ravskyj
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/1609.00321
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Mathematics and literature (00A64)
Cites Work
- Depth-first iterative-deepening: An optimal admissible tree search
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Interval hypergraphs and D-interval hypergraphs
- On Minimizing Crossings in Storyline Visualizations
- Sorting by Transpositions Is Difficult
- Ordering Metro Lines by Block Crossings
- Block Crossings in Storyline Visualizations
- On Planar Supports for Hypergraphs
- Sorting a bridge hand
