Pages that link to "Item:Q1363779"
From MaRDI portal
The following pages link to Triangulating planar graphs while minimizing the maximum degree (Q1363779):
Displaying 22 items.
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area (Q452455) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- On partitioning the edges of 1-plane graphs (Q501676) (← links)
- One strike against the min-max degree triangulation problem (Q685602) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- A force-directed algorithm that preserves edge-crossing properties (Q1607039) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- A new algorithm for embedding plane graphs at fixed vertex locations (Q2121749) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Dual circumference and collinear sets (Q2679595) (← links)
- Triangulating Planar Graphs While Keeping the Pathwidth Small (Q2827827) (← links)
- (Q3611292) (← links)
- (Q4414480) (← links)
- (Q4792367) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q5056168) (← links)
- The Stub Resolution of 1-planar Graphs (Q5084699) (← links)
- (Q5088959) (← links)
- (Q5088963) (← links)