Planar stories of graph drawings: algorithms and experiments

DOI10.4230/LIPICS.GD.2025.32MaRDI QIDQ7354826zbMATH OpenFDO

Authors Carla Binucci, Sabine Cornelsen, Walter Didimo, Seok-Hee Hong, Eleni Katsanou, Maurizio Patrignani, Antonios Symvonis, Samuel Wolf

Publication date 21 September 2026

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Cites work

• A linear-time algorithm for the generation of trees
• Bundling-aware graph drawing
• Drawing Big Graphs Using Spectral Sparsification
• Empirical evaluation of aesthetics-based graph layout
• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• Exploring Complex Drawings via Edge Stratification
• Face covers and the genus problem for apex graphs
• Finding near-optimal weight independent sets at scale
• Graph minors. III. Planar tree-width
• Graph Stories in Small Area
• How to Obtain the Complete List of Caterpillars
• scientific article; zbMATH DE number 6850320 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Intersection graphs of segments
• On the complexity of reconfiguration problems
• On the complexity of the storyplan problem
• On the complexity of the storyplan problem
• Parameterized complexity of independent set reconfiguration problems
• Small Point-Sets Supporting Graph Stories
• Small point-sets supporting graph stories
• SOFSEM 2005: Theory and Practice of Computer Science
• TGI-EB: a new framework for edge bundling integrating topology, geometry and importance

This page was built for publication: Planar stories of graph drawings: algorithms and experiments

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