Pages that link to "Item:Q826069"
From MaRDI portal
The following pages link to Area-efficient static and incremental graph drawings (Q826069):
Displaying 19 items.
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- Non-planar square-orthogonal drawing with few-bend edges (Q744098) (← links)
- Orthogonal drawings based on the stratification of planar graphs (Q1422412) (← links)
- Bounded degree acyclic decompositions of digraphs. (Q1426101) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Streamed Graph Drawing and the File Maintenance Problem (Q2867663) (← links)
- Algorithms and Bounds for L-Drawings of Directed Graphs (Q3177336) (← links)
- Graph Compact Orthogonal Layout Algorithm (Q3195336) (← links)
- GRIP: Graph Drawing with Intelligent Placement (Q4405598) (← links)
- Drawing Clustered Graphs on an Orthogonal Grid (Q4504998) (← links)
- Square-Orthogonal Drawing with Few Bends per Edge (Q4925252) (← links)
- An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing (Q5301374) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711557) (← links)
- On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
