Peter D. Eades (born 8 January 1952)[1] is an Australian computer scientist, an emeritus professor in the School of Information Technologies at the University of Sydney, known for his expertise in graph drawing.
Eades received his bachelor's degree in mathematics from Australian National University in 1974, and his Ph.D. in mathematics from the same university in 1977 under the supervision of Jennifer Seberry.[2] He then did postdoctoral studies at the University of Waterloo before taking an academic position at the University of Queensland, where he remained until 1991. He was a professor of computer science at the University of Newcastle from 1992 to 1999, and joined the University of Sydney faculty in 2000. As well as his faculty position at Sydney, Eades was also a distinguished researcher at NICTA.[3][4]
Eades is the co-author (with Giuseppe Di Battista, Roberto Tamassia, and Ioannis G. Tollis) of the book Graph drawing: Algorithms for the visualization of graphs,[5] and of the associated survey "Algorithms for drawing graphs: an annotated bibliography".[6] He has also written many highly cited research papers in graph drawing, on topics including spring algorithms,[7] performance speed up with N-body methods,[8] maintenance of the "mental map" in dynamically changing drawings,[9] heuristics for reducing the number of edge crossings in layered graph drawings,[10] and visual display of clustering information in graphs.[11] He was the keynote speaker at the 12th IEEE Symposium on Information Visualization in 2006,[4] was one of three invited speakers at the 19th International Symposium on Algorithms and Computation in 2008,[12] and was one of two invited speakers at the 18th International Symposium on Graph Drawing in 2010.[13] He has been the doctoral advisor of over 30 graduate students.[3]
A workshop in honor of Eades' 60th birthday was held in 2012, as part of the International Symposium on Graph Drawing.[14]
References
edit- ^ Birthdate as stated in introductory remarks by Seok-Hee Hong at Workshop on Theory and Applications of Graph Drawing.
- ^ Peter D. Eades at the Mathematics Genealogy Project
- ^ a b Curriculum vitae, Univ. of Sydney, retrieved 2011-11-09.
- ^ a b Keynote Speaker, InfoVis 2006, retrieved 2011-11-09.
- ^ Prentice Hall, 1999, ISBN 0-13-301615-3.
- ^ Computational Geometry: Theory and Practice 4 (5): 235–282, 1994, doi:10.1016/0925-7721(94)00014-X.
- ^ Eades, Peter (1984), "A heuristic for graph drawing", Congressus Numerantium, 42 (11): 149–160.
- ^ Quigley, Aaron; Eades, Peter (2001), "FADE: Graph Drawing, Clustering, and Visual Abstraction", Proceedings of the 8th International Symposium on Graph Drawing (PDF), pp. 197–210, ISBN 3-540-41554-8.
- ^ Misue, Kazuo; Eades, Peter; Lai, Wei; Sugiyama, Kozo (1995), "Layout adjustment and the mental map", Journal of Visual Languages & Computing, 6 (2): 183–210, doi:10.1006/jvlc.1995.1010.
- ^ Eades, Peter; Wormald, Nicholas C. (1994), "Edge crossings in drawings of bipartite graphs", Algorithmica, 11 (4): 379–403, doi:10.1007/BF01187020, MR 1264270, S2CID 22476033.
- ^ Eades, Peter; Feng, Qing-Wen (1997), "Multilevel visualization of clustered graphs", Graph Drawing, Lecture Notes in Computer Science, vol. 1190, Springer-Verlag, pp. 101–112, doi:10.1007/3-540-62495-3_41, ISBN 978-3-540-62495-0. Eades, Peter; Feng, Qing-Wen; Lin, Xuemin (1997), "Straight-line drawing algorithms for hierarchical graphs and clustered graphs", Graph Drawing, Lecture Notes in Computer Science, vol. 1190, Springer-Verlag, pp. 113–128, doi:10.1007/3-540-62495-3_42, ISBN 978-3-540-62495-0.
- ^ ISAAC 2008 program, retrieved 2011-11-09.
- ^ Invited speakers, GD 2010, retrieved 2011-11-09.
- ^ Workshop on Theory and Practice of Graph Drawing on the occasion of the 60th birthday of Peter Eades, Univ. of Sydney, retrieved 2012-08-13.
External links
edit- Home page at the University of Sydney
- List of publications in DBLP