The following pages link to (Q4796197):
Displaying 8 items.
- Algorithms for multi-level graph planarity testing and layout (Q596102) (← links)
- Characterization of unlabeled level planar trees (Q924090) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- Minimum-Layer Drawings of Trees (Q3078403) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
