Area-efficient static and incremental graph drawings
From MaRDI portal
Publication:826069
DOI10.1007/3-540-63397-9_4zbMATH Open1477.68201OpenAlexW1809204768MaRDI QIDQ826069FDOQ826069
Authors: Michael Kaufmann, Therese Biedl 
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/3-540-63397-9_4
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (23)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Graph compact orthogonal layout algorithm
- Streamed Graph Drawing and the File Maintenance Problem
- Algorithms and bounds for L-drawings of directed graphs
- Title not available (Why is that?)
- Square-orthogonal drawing with few bends per edge
- Orthogonal drawings based on the stratification of planar graphs
- Bounded degree acyclic decompositions of digraphs.
- Drawing trees in a streaming model
- Relating bends and size in orthogonal graph drawings
- Bend-optimal orthogonal graph drawing in the general position model
- Drawing Clustered Graphs on an Orthogonal Grid
- GRIP: Graph Drawing with Intelligent Placement
- An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- The DFS-heuristic for orthogonal graph drawing
- Optimal-area visibility representations of outer-1-plane graphs
- Non-planar square-orthogonal drawing with few-bend edges
- On the complexity of some geometric problems with fixed parameters
- Balanced vertex-orderings of graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Title not available (Why is that?)
This page was built for publication: Area-efficient static and incremental graph drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826069)
