Authors: Branke, J Leppert, S Middendorf, M Eades, P

Citation: J. Branke et al., Width-restricted layering of acyclic digraphs with consideration of dummy nodes, INF PROCESS, 81(2), 2002, pp. 59-63

Authors: Lai, W Eades, P

Citation: W. Lai et P. Eades, Removing edge-node intersections in drawings of graphs, INF PROCESS, 81(2), 2002, pp. 105-110

Authors: Eades, P Symvonis, A Whitesides, S

Citation: P. Eades et al., Three-dimensional orthogonal graph drawing algorithms, DISCR APP M, 103(1-3), 2000, pp. 55-87

Authors: Hong, SH Eades, P Lee, SH

Citation: Sh. Hong et al., Drawing series parallel digraphs symmetrically, COMP GEOM, 17(3-4), 2000, pp. 165-188

Authors: Eades, P Lin, XM

Citation: P. Eades et Xm. Lin, Spring algorithms and symmetry, THEOR COMP, 240(2), 2000, pp. 379-405

Authors: Huang, ML Eades, P Wang, JH

Citation: Ml. Huang et al., On-line animated visualization of huge graphs using a modified spring algorithm, J VIS LANG, 9(6), 1998, pp. 623-645