Pages that link to "Item:Q5899628"
From MaRDI portal
The following pages link to Drawing Partially Embedded and Simultaneously Planar Graphs (Q5899628):
Displayed 19 items.
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- A new algorithm for embedding plane graphs at fixed vertex locations (Q2121749) (← links)
- RAC-drawability is \(\exists \mathbb{R} \)-complete (Q2151432) (← links)
- One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
- On compatible triangulations with a minimum number of Steiner points (Q2192383) (← links)
- Simultaneous Embedding (Q5001665) (← links)
- Extending Partial Orthogonal Drawings (Q5014122) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Hanani--Tutte and Hierarchical Partial Planarity (Q5058130) (← links)
- Extending Partial Orthogonal Drawings (Q5084696) (← links)
- (Q5089197) (← links)
- Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
- How to Draw a Planarization (Q5233140) (← links)
- Simultaneous Embeddings with Few Bends and Crossings (Q5233141) (← links)
- On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- Drawing Simultaneously Embedded Graphs with Few Bends (Q6066464) (← links)
- Small Point-Sets Supporting Graph Stories (Q6141788) (← links)
- Small point-sets supporting graph stories (Q6172204) (← links)