Graph drawing: algorithms for the visualization of graphs GD Battista, P Eades, R Tamassia, IG Tollis Prentice Hall PTR, 1998 | 3272 | 1998 |

A heuristic for graph drawing P Eades Congressus numerantium 42, 149-160, 1984 | 2098 | 1984 |

Algorithms for drawing graphs: an annotated bibliography G Di Battista, P Eades, R Tamassia, IG Tollis Computational Geometry 4 (5), 235-282, 1994 | 1446 | 1994 |

Layout adjustment and the mental map K Misue, P Eades, W Lai, K Sugiyama Journal of Visual Languages & Computing 6 (2), 183-210, 1995 | 768 | 1995 |

Edge crossings in drawings of bipartite graphs P Eades, NC Wormald Algorithmica 11 (4), 379-403, 1994 | 403 | 1994 |

Multilevel visualization of clustered graphs P Eades, QW Feng International symposium on graph drawing, 101-112, 1996 | 330 | 1996 |

Preserving the mental map of a diagram P Eades, W Lai, K Misue, K Sugiyama Technical Report IIAS-RR-91-16E, Fujitsu Laboratories, 1991 | 318 | 1991 |

How to draw a directed graph P Eades, L Xuemin 1989 IEEE Workshop on Visual Languages, 13, 14, 15, 16, 17-13, 14, 15, 16, 17, 1989 | 304 | 1989 |

Handbook of data structures and applications DP Mehta, S Sahni Taylor & Francis, 2018 | 292 | 2018 |

Drawing free trees P Eades International Institute for Advanced Study of Social Information Science …, 1991 | 259 | 1991 |

Fade: Graph drawing, clustering, and visual abstraction A Quigley, P Eades International Symposium on Graph Drawing, 197-210, 2000 | 257 | 2000 |

A fast and effective heuristic for the feedback arc set problem P Eades, X Lin, WF Smyth Information Processing Letters 47 (6), 319-323, 1993 | 256 | 1993 |

Navigating clustered graphs using force-directed methods P Eades, ML Huang Graph Algorithms And Applications 2, 191-215, 2004 | 221 | 2004 |

Measuring effectiveness of graph visualizations: A cognitive load perspective W Huang, P Eades, SH Hong Information Visualization 8 (3), 139-152, 2009 | 214 | 2009 |

Straight-line drawing algorithms for hierarchical graphs and clustered graphs P Eades, QW Feng, X Lin International Symposium on Graph Drawing, 113-128, 1996 | 211* | 1996 |

Planarity for clustered graphs QW Feng, RF Cohen, P Eades European Symposium on Algorithms, 213-226, 1995 | 195 | 1995 |

Three-dimensional graph drawing RF Cohen, P Eades, T Lin, F Ruskey Algorithmica 17 (2), 199-208, 1997 | 179 | 1997 |

Heuristics for reducing crossings in 2-layered networks P Eades, D Kelly Ars Combin 21 (1), 89, 1986 | 176 | 1986 |

On-line animated visualization of huge graphs using a modified spring algorithm ML Huang, P Eades, J Wang Journal of Visual Languages & Computing 9 (6), 623-645, 1998 | 158 | 1998 |

Effects of crossing angles W Huang, SH Hong, P Eades 2008 IEEE Pacific Visualization Symposium, 41-46, 2008 | 135 | 2008 |