Small Point-Sets Supporting Graph Stories
From MaRDI portal
Publication:6141788
DOI10.7155/jgaa.00639zbMath1529.05114OpenAlexW4388429443MaRDI QIDQ6141788
Luca Grilli, Fabrizio Grosso, Alessandra Tappini, Walter Didimo, Maurizio Patrignani, Giuseppe Di Battista, Giacomo Ortali
Publication date: 20 December 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00639
Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Drawing trees in a streaming model
- On simultaneous planar graph embeddings
- Drawing colored graphs on colored points
- Incremental convex planarity testing
- Planarity of streamed graphs
- Advancements on SEFE and partitioned book embedding problems
- Alpha-algorithms for incremental planarity testing (preliminary version)
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Streamed Graph Drawing and the File Maintenance Problem
- Offline Drawing of Dynamic Trees: Algorithmics and Document Integration
- Simultaneous Graph Embeddings with Fixed Edges
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
- On-Line Planarity Testing
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Graph Stories in Small Area
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Drawing Partially Embedded and Simultaneously Planar Graphs
- Embedding planar graphs at fixed vertex locations
- Small point-sets supporting graph stories
- On the complexity of the storyplan problem
This page was built for publication: Small Point-Sets Supporting Graph Stories