Pages that link to "Item:Q1628786"
From MaRDI portal
The following pages link to HV-planarity: algorithms and complexity (Q1628786):
Displayed 7 items.
- Drawing two posets (Q831842) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q6039436) (← links)
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time (Q6053468) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)