Storylines with a protagonist

DOI10.4230/LIPICS.GD.2024.26MaRDI QIDQ6920455zbMATH OpenFDO

Authors Tim Hegemann, Alexander Wolff

Publication date 7 October 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.GD.2024.26

zbMATH Keywords

block crossingscrossing minimizationstoryline visualizationstoryline with a protagonist

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
• Beyond outerplanarity
• Block Crossings in Storyline Visualizations
• Block crossings in storyline visualizations
• Bundled Crossings in Embedded Graphs
• Bundled crossings revisited
• Bundled crossings revisited
• Computing storyline visualizations with few block crossings
• Crossing Minimization in Storyline Visualization
• Graphen und Matrices.
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Maximum cut parameterized by crossing number
• Metro-line crossing minimization: hardness, approximations, and tractable cases
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• On minimizing crossings in storyline visualizations
• Optimization, approximation, and complexity classes
• Ordering metro lines by block crossings
• Partitioning planar graphs: a fast combinatorial approach for max-cut
• Sorting by transpositions is difficult
• Storyline visualizations with ubiquitous actors

Cited in

(1)

• Optimizing wiggle in storylines

This page was built for publication: Storylines with a protagonist

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920455)