Pages that link to "Item:Q3073681"
From MaRDI portal
The following pages link to Complexity of Finding Non-Planar Rectilinear Drawings of Graphs (Q3073681):
Displayed 5 items.
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings (Q3223969) (← links)
- (Q5111244) (← links)
- Combinatorial properties and recognition of unit square visibility graphs (Q6045782) (← links)