Computing Storyline Visualizations with Few Block Crossings

DOI10.1007/978-3-319-73915-1_29zbMath1503.68236arXiv1709.01055OpenAlexW2964209678MaRDI QIDQ4625125

Alexander Wolff, Fabian Lipp, Peter Markfelder, Thomas C. van Dijk

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.01055

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of satisfiability (68R07) Mathematics and literature (00A64)

Related Items (3)

On Strict (Outer-)Confluent Graphs ⋮ Computing Storyline Visualizations with Few Block Crossings ⋮ Storyline Visualizations with Ubiquitous Actors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Book Embedding Problem from a SAT-Solving Perspective
• On Minimizing Crossings in Storyline Visualizations
• Crossing Minimization in Storyline Visualization
• HordeSat: A Massively Parallel Portfolio SAT Solver
• Applying Logic Synthesis for Speeding Up SAT
• Computing Storyline Visualizations with Few Block Crossings
• Block Crossings in Storyline Visualizations

This page was built for publication: Computing Storyline Visualizations with Few Block Crossings