The following pages link to Peter Eades (Q391974):
Displayed 50 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)
- Bounds on the crossing resolution of complete geometric graphs (Q765347) (← links)
- A characterization of complete bipartite RAC graphs (Q765516) (← links)
- A lower-bound for the number of productions required for a certain class of languages (Q1054160) (← links)
- An algorithm for generating subsets of fixed size with a strong minimal change property (Q1060849) (← links)
- Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
- Drawing graphs in two layers (Q1331939) (← links)
- Algorithms for drawing graphs: An annotated bibliography (Q1337400) (← links)
- The logic engine and the realization problem for nearest neighbor graphs (Q1349880) (← links)
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings (Q1350939) (← links)
- Drawing trees symmetrically in three dimensions (Q1400891) (← links)
- Skewness of graphs with small cutsets (Q1401554) (← links)
- An edge-splitting algorithm in planar graphs (Q1402535) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Spring algorithms and symmetry (Q1575440) (← links)
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes (Q1603521) (← links)
- Removing edge-node intersections in drawings of graphs (Q1603534) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- The weighted barycenter drawing recognition problem (Q1725791) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- Drawing series parallel digraphs symmetrically (Q1841117) (← links)
- Towards area requirements for drawing hierarchically planar graphs (Q1870562) (← links)
- Linkless symmetric drawings of series parallel digraphs (Q1886237) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Right angle crossing graphs and 1-planarity (Q1949102) (← links)
- A quality metric for visualization of clusters in graphs (Q2206839) (← links)
- Multi-level graph drawing using infomap clustering (Q2206845) (← links)
- Polyline drawings with topological constraints (Q2290634) (← links)
- Order-preserving matching (Q2437748) (← links)
- Drawing planar graphs symmetrically. II: Biconnected planar graphs (Q2483999) (← links)
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs (Q2492625) (← links)
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs (Q2492626) (← links)
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs (Q2505225) (← links)
- A Linear-Time Algorithm for Testing Outer-1-Planarity (Q2867645) (← links)
- Fáry’s Theorem for 1-Planar Graphs (Q2914338) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Some Hamilton Paths and a Minimal Change Algorithm (Q3028353) (← links)
- (Q3043717) (← links)
- (Q3048846) (← links)
- (Q3048853) (← links)
- 2-Layer Right Angle Crossing Drawings (Q3111648) (← links)
- TWO TREE DRAWING CONVENTIONS (Q3136721) (← links)
- (Q3154375) (← links)
- Drawing Graphs with Right Angle Crossings (Q3183456) (← links)