Pages that link to "Item:Q2123284"
From MaRDI portal
The following pages link to Planar rectilinear drawings of outerplanar graphs in linear time (Q2123284):
Displaying 14 items.
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- Embedding rectilinear graphs in linear time (Q1111399) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
- Computing β-Drawings of 2-Outerplane Graphs in Linear Time (Q5452155) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711541) (← links)
- Rectilinear planarity of partial 2-trees (Q6117043) (← links)
- Testing upward planarity of partial 2-trees (Q6117044) (← links)
- Rectilinear Planarity of Partial 2-Trees (Q6141789) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6618248) (← links)
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth (Q6618262) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6623586) (← links)
- Unit-length rectangular drawings of graphs (Q6636988) (← links)
- Splitting plane graphs to outerplanarity (Q6636997) (← links)