Pages that link to "Item:Q1208428"
From MaRDI portal
The following pages link to A note on optimal area algorithms for upward drawings of binary trees (Q1208428):
Displaying 46 items.
- Logarithmic width, linear area upward drawing of AVL trees (Q287192) (← links)
- On the approximability of two tree drawing conventions (Q294876) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area (Q452455) (← links)
- A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio (Q482353) (← links)
- Three-dimensional graph drawing (Q675316) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- A note on minimum-area upward drawing of complete and Fibonacci trees (Q970209) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Strictly-upward drawings of ordered search trees (Q1274319) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Linear area upward drawings of AVL trees (Q1384187) (← links)
- A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199) (← links)
- Pole dancing: 3D morphs for tree drawings (Q1725773) (← links)
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings (Q1862119) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- Order-preserving, upward drawing of binary trees using fewer bends (Q1887067) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs (Q2009630) (← links)
- Grid straight-line embeddings of trees with a minimum number of bends per path (Q2059894) (← links)
- Horton-Strahler number, rooted pathwidth and upward drawings of trees (Q2059912) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- Tree drawings revisited (Q2189731) (← links)
- On the area requirements of planar straight-line orthogonal drawings of ternary trees (Q2220843) (← links)
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (Q2224848) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- Ideal Drawings of Rooted Trees With Approximately Optimal Width (Q2985123) (← links)
- Pinning Balloons with Perfect Angles and Optimal Area (Q3223951) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS (Q3520432) (← links)
- Tree Drawings on the Hexagonal Grid (Q3611873) (← links)
- Grid-Obstacle Representations with Connections to Staircase Guarding (Q4625102) (← links)
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES (Q4661881) (← links)
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees (Q5014106) (← links)
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs (Q5042451) (← links)
- Drawing Halin-graphs with small height (Q5050008) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- (Q5115791) (← links)
- Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) (Q5208867) (← links)
- Pole Dancing: 3D Morphs for Tree Drawings (Q5233136) (← links)
- A Lower Bound on the Area Requirements of Series-Parallel Graphs (Q5302052) (← links)
- Upward Planar Drawings with Three and More Slopes (Q5886036) (← links)
- How to fit a tree in a box (Q5915945) (← links)
- How to fit a tree in a box (Q5925577) (← links)
- Upward drawings of search trees (extended abstract) (Q6550539) (← links)
