The following pages link to Peter Eades (Q391974):
Displaying 9 items.
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- Three-dimensional graph drawing (Q675316) (← links)
- A fast and effective heuristic for the feedback arc set problem (Q688447) (← links)
- Drawing graphs with right angle crossings (Q719252) (← links)
- Polyline Drawings with Topological Constraints (Q5091031) (← links)
- Algorithms and Computation (Q5191668) (← links)
- How to draw a planar clustered graph (Q6064010) (← links)
