Peter Eades – CV

Academic qualifications

PhD – Mathematics, Australian National University, 1977

(Thesis: On the Existence of Orthogonal Designs)

BA (Hons) – Mathematics, Australian National University, 1974

Current Positions

Professor of Software Technology, School of Information Technology, University of Sydney (2000 – current)
Program Leader, IMAGEN Program, National ICT Australia Ltd (July 2003 – current)

Previous positions

Professor of Computer Science, the University of Newcastle (1992 – 1999)
Various academic positions at the University of Queensland (1978 – 1991)
Postdoctoral fellow, University of Waterloo (1977)
Research student, Australian National University (1974 – 1977)
Programmer-in-training, Department of Trade (1974)
Visiting positions (mostly sabbaticals) at Louisiana State University (1981), McGill University (1983, 1985, 1987), Fujitsu Laboratories Japan (1991), University of Chile (1995), and the University of Limerick (1999)

Top

Teaching Experience

Undergraduate subjects:

Introduction to Computer Science (1st year)	Systems Programming (2nd year)
Assembly Language (2nd year)	Computer Logic (Introductory Hardware, 2nd year)
Data Structures (2nd year, 3rd year)	Theory of Computation (2nd year, 3rd year)
Computer Graphics (3rd year)	Operating Systems (3rd year)
Data Security (3rd year)	Graphic User Interfaces (3rd year)
Complexity Theory (3rd year)	Software Engineering (3rd year)
Advanced Software Engineering (4th year)	User Interface Design (3rd year)
Program Analysis and Software Re-engineering (4th year)

Graduate subjects:

Advanced Graphics	Cryptographic systems
Data Structures	Graph Algorithms
Information Visualisation	Research Communication
Reverse Engineering of Software	Computational Geometry
Combinatorics	Information Visualisation

Curriculum design:

Bachelor of Engineering (Software Engineering) at the University of Newcastle.

Research students:

Current students: Principle supervisor

Robert Shen, Visualisation in the periphery (PhD, expected completion 2008)
Weidong (Tony) Huang, Topological Methods for Three-Dimensional Graph Drawing (PhD, expected completion 2007)
Damian Merrick, Learning Rapid Morphogenesis (PhD, expected completion 2007)
Colin Murray, Haptic Graph Editing (PhD, expected completion 2007)
Adel Ahmed, Navigation of Large Datasets in 3D Space (PhD, expected completion 2007)
Lanbo Zheng, Crossing minimisation problems in 2-cluster bipartite graphs (PhD, expected completion 2006)
Wanchun (Paul) Li, Clustered Graph Visualisation (Masters, expected completion February 2005)

Current students: Associate supervisor

Yan Zhang, Middleware and Security (PhD, expected completion 2007)
Le Song, Dynamic Neural Assembly Analysis for Brain-Computer Interface (PhD, expected completion 2007)
Kathryn Kasmarik, Motivated Agents (PhD, expected completion 2007)
Ying Xin Wu, Self-organising Maps (PhD, expected completion 2007)
Ben Yip, Eye contact correction in video conference (PhD, expected completion 2007)
Kelvin Cheng, Interactive techniques with large screens (PhD, expected completion 2006)

Students - completed

Yan Liu, A Framework to Predict the Performance of Component-based Applications (PhD 2004)
Tim Dwyer, Two and a Half Dimensional Visualisation of Related Networks (PhD, under examination 2004)
Kevin Pulo, Smooth Structured Zooming in Clustered Graphs (PhD, under examination 2004)
Keith Nesbitt, Multi-sensory Display of Abstract Data (PhD 2002)
Hugo do Nascimento, User Hints for Optimization Processes (PhD 2002)
Carsten Friedrich, Animation in Relational Information Visualisation (PhD 2002, best thesis award)
Aaron Quigley, Large Scale Relational Information Visualisation, Clustering, and Abstraction (PhD 2001)
Mao Lin Huang, Online Graph Drawing (PhD 1999)
Brian Regan, Three-dimensional graph drawing for memorable graphs (PhD 2002)
Richard Webber, Viewing techniques for information visualisation (PhD 1999)
Patrick Garvan, Low genus drawings of graphs in three dimensions. (PhD 1998)
Wendy Feng, Algorithms for drawing clustered graphs (PhD, 1997, best thesis award)
Deithelm Ostry, Some three-dimensional graph drawing algorithms. (Masters, 1997)
Paul Manuel, Sequential and parallel algorithms on balanced graphs (PhD 1996)
Xavier Mendonca, A layout system for information system diagrams (PhD 1995)
Wei Lai, Building interactive diagram applications (PhD 1994)
Xuemin Lin, Analysis of algorithms for drawing graphs (PhD 1993)
David Kelly, A View to Graph Layout Problems (MSc, 1988)
Michael Hickey, Induction Algorithms (PhD, 1985)

Top

Professional Activities

Professional Society Membership:

Association for Computing Machinery	IEEE Computer Society
Australian Computer Society (Fellow)	Australian Mathematics Society

Other professional affiliations:

CM CRC (Capital Markets CRC): Visualisation Research Director, 2001 – present.

ARC Research Network in Enterprise Information Infrastructure – Steering Committee

University responsibilities:

Chair of Software Technology, University of Sydney, 2000–present
Reviewer for Computer Science Department, University of Auckland, 2004
Head of School of Information Technologies, University of Sydney, 2002–2003
Chair of the Department Research Committee, Basser Department of Computer Science, University of Sydney, 2000–2001
Reviewer for the Computer Science degrees at the University of New England, 2000
Head of the Department of Computer Science and Software Engineering at the University of Newcastle from 1992 until 1997 and during 1999
Assistant Dean for Information Technology for the Faculty of Engineering, University of Newcastle, 1997–1998
Reviewer for the Honours degrees in Computer Science at the University of Western Australia 1995, and for Griffith University in 1996.
Examiner of many PhD and research masters degrees

Editorial:

Editorial Board, Journal of Graph Algorithms and Applications
Editorial Board, Information Visualization

Refereeing

Algorithmica	Information Visualisation
Acta Informatica	Communications of the ACM
SIAM Journal on Optimisation	Theoretical Computer Science
SIAM Journal of Computing	Journal of Algorithms
IEEE Transactions on Graphics	Software Practice and Experience
Man and Cybernetics	IEEE Transactions on Systems
BIT	IEEE Journal of Robotics and Automation
Information Processing Letters	International Journal of Computational Geometry and Applications
Australian Computer Journal	Information and Control
Discrete Mathematics	The Visual Computer
Utilitas Mathematica	Discrete Applied Mathematics
Ars Combinatoria	Journal of the Australian Mathematical Society
Various conference proceedings

Conference Organisation

Graph Drawing Conference: Steering committee since 1992, Chair 2005 Program Committee , 1998, 1994, 1992
Australian Symposium on Information Visualization, organiser and PC Chair, 2001
Australian Workshop on Combinatorial Algorithms (AWOCA): Organiser and Program Committee,2003-2004, 1994-1997, 1989-1992
International Symposium on Algorithms and Computation (ISAAC), Steering Committee since 1993, Program Committee 2001, 1997 (PC Co-chair); 1995, 1994, 1992 (PC Chair)
Computing: The Australian Theory Conference (CATS), Steering Committee 1996-1998, Program Committee chair 1996
Australian Software Visualisation Workshop, Organiser 1997, 1995, Chair 1999

Seminars and invited talks

The Australian National University	The University of Sydney
The University of Melbourne	The Royal Melbourne Institute of Technology
The University of Western Australia	The University of Adelaide
Curtin University of Technology	Griffith University
The University of New England	The University of Queensland
CSIRO Division of Computing Research (Canberra)	Telecom Research Laboratories (Melbourne)
Queen's University (Ontario)	Memorial University of Newfoundland
The University of Waterloo	The University of Ottawa
Carleton University	The University of Toronto
Simon Fraser University	McGill University
The University of Saskatchewan	McMaster University
Brown University	Vandebilt University
Bucknell University	Georgetown University
The State University of New York at Albany	The University of Nebraska at Omaha
The University of Virginia	Florida International University
Louisiana State University	The University of Illinois at Urbana-Champaign
The University of Texas at Dallas	The University of Auckland
The University of Canterbury (Christchurch)	The Laboratoire Structures Discretes (Grenoble)
INRIA Nancy	The Universita di Roma (la Sapienza)
The University of Limerick	The University of Karlsruhe
The University of Passau	The University of Cologne
The Max Planck Institute (Saarbrucken)	The University of Limerick
University College Dublin	The University of Tohoku
The University of Tokyo	The Osaka Electro-Communication University
The University of Kyoto	Fudan University
Shandong University (China)	The University of Chile
The International Institute for Advanced Study in Social Information Science (Fujitsu Limited) in Numazu, Japan	The University of Campinas (Brazil)

Top

Research

Recent research interests:

Graph drawing, networks and related combinatorial structures; information visualisation; software visualisation; algorithms; and program analysis.

Major grants since 1994:

Topological Approaches for Three-Dimensional Graph Drawing, supported by an ARC Discovery Grant, about $150,000, 2005-2008.
New Methods for Interactive Visualisation of Large Microarray Data Sets, supported by an ARC Linkage Grant, Axogenic Pty Ltd, about $90,000, 2004-2007
Graph drawing with fixed node constraints, supported by an Australian Research Council SPIRT Grant, Tom Sawyer Software, and Newton Green Technologies, 2001-2003, about $100,000.
Symmetric Graph Drawing, supported by an Australian Research Council Large Grant, 2001-2003, $160,000.
Clustering Methods for Graphs, supported by an Australian Research Council Large Grant, 2000-2002, $168,000.
Drawing Clustered Graphs, supported by the Australian Research Council, 1998-2000, $150,000.
Higher Dimensional Visualisation of Relations, 1992-1999. Supported by the Australian Research Council (1997-1999, $180,000, joint with Robert Cohen); by an APA (Industry) (1994-1997, $57,000); by IBM ($28,000), and several minor grants.
Towards Reverse Engineering by Visual Interactive Semantics (joint project with Monash University). Supported by the Australian Research Council 1996–1998, $160,000.
Graphical Presentation and Manipulation of Software Documents (joint project with the University of Queensland). Supported by the Australian Research Council 1994–1996, $150,000.
Generating Geometrically Intelligent Graphic User Interfaces. Supported by the Australian Research Council, 1992–1994, $108,000.
Graph Drawing. Supported by Fujitsu Laboratories Japan, 1993 - 1998, JY5,000,000.

Download

Top

Publications since 1994

Book:

G. Di Battista, Peter Eades, Roberto Tamassia and I. Tollis, Graph drawing: algorithms for the visualisation of graphs, Prentice Hall 1998.

Edited books and conference proceedings:

J. Jin, P. Eades, D. Feng and H. Yan, "Visualisation 2002", Vol. 22, (Selected papers from the Pan Sydney Area Workshop on Visual Information Processing), Conferences in Research and Practice in Information Technology (Australian Computer Society) 2002 ISSN 1445-1336, ISBN 1-920682-01-5.

D. Feng, J. Jin, P. Eades and H. Yan, "Visualisation 2001", Vol. 11, (Selected papers from the Pan Sydney Area Workshop on Visual Information Processing), Conferences in Research and Practice in Information Technology (Australian Computer Society) 2001 ISSN 1445-1336, ISBN 0-909-92589-5.

P. Eades and T. Pattison, "Information Visualisation 2001", Vol. 9, Australian Symposium on Information Visualisation, Conferences in Research and Practice in Information Technology, (Australian Computer Society) 2000 ISSN 1445-1336, ISBN 0-909925-87-9.

P. Eades and J. Jin, "Visualisation 2000", Vol. 2, (Selected papers from the Pan Sydney Area Workshop on Visual Information Processing), Conferences in Research and Practice in Information Technology (Australian Computer Society) 2000 ISSN 1445-1336, ISBN 0-909-92580-1.

T. Takaoka and P. Eades, "Algorithms and Computation", Proceedings of ISAAC2001, Springer Lecture notes in Computer Science 2223.

P. Eades and T. Pattisson, "Information Visualization 2001", The Australian Symposium on Information Visualisation, Conferences in Research and Practice in Information Technology 9 (Australian Computer Society) 2001.

D-Z. Du, P. Eades, V. Estivill-Castro, X. Lin and A. Sharma (Eds), "Computing and Combinatorics", Proceedings of COCOON 2000, Springer Lecture Notes in Computer Science Vol. 1858 (2000).

P. Eades and K. Zhang (editors), "Software Visualisation", World Scientific, 1996.

P. Eades and K. Zhang (editors), Special Issue on Software Visualization, Australian Computer Journal 28 (1), (1996).

P. Eades and K. Zhang (editors), Special Issue on Software Visualization, Australian Computer Journal 27 (4), (1995).

M. Houle and P. Eades (editors), "CATS96" (Computing: The Australian Theory Symposium) Proceedings, Australian Computer Science Communications, 18 (3), 1996.

P. Eades and I. Cruz (editors), Special Issue on Graph Visualization, Journal of Visual Languages and Computing, 6 (3) 1995.

J. Staples, P. Eades, N. Katoh and A. Moffat (editors), Algorithms and Computation, Lecture Notes in Computer Science 1004, Springer, 1995.

Top

Journals and Book Chapters:

P. Eades, S. Hong, "Chapter 46: Drawing Graphs", Handbook of Data Structures and Applications, D. Mehta and S. Sahni (editors), 46:1-22, CRC Press, 2004

P. Eades, S. Hong, K. Nesbitt, M. Takatsuka, "Visualisation", Handbook of Innovative Computing, A. Zomaya et al (editor), Springer-Verlag, To appear.

S. Hong, P. Eades, "Drawing Planar Graphs Symmetrically II: Biconnected Graphs", Algorithmica, to appear.

S. Hong, P Eades, "Drawing Planar Graphs Symmetrically III: Oneconnected Graphs", Algorithmica, to appear.

S Hong, P Eades, J Hillman, "Linkless Symmetric Drawings of Series Parallel Digraphs", Computational Geometry: Theory and Applications, 29 (3), pp. 191-222, 2004.

S. Hong, P Eades, "Drawing Trees Symmetrically in Three Dimensions", Algorithmica, Vol. 26, No. 2, pp. 153-178, 2003

H. Nagamochi, P. Eades, "An edge-splitting algorithm in planar graphs", J. Combinatorial Optimization 7, 137 – 159, 2003.

G. Farr and P. Eades, "Skewness of graphs with small cutsets", Graphs and Combinatorics, 19 (2) , 177-194 (2003).

Xuemin Lin, Peter Eades: "Towards area requirements for drawing hierarchically planar graphs", Theoretical Computer Science, 292(3): 679-695 (2003).

Mao Lin Huang, Wei Lai, and Peter Eades, "Flowchart Components for Program Visualisation", Chapter 3 of Software Visualization – From Theory to Practice (ed. Kang Zhang), 59 – 75, Kluwer, 2003. ISBN 1-4020-7448-4.

Mao Lin Huang and Peter Eades, "On-line Visualization and Navigation of the Global Web Structure", International Journal of Software Engineering and Knowledge Engineering 13 (1), 27-52, 2003. ISSN 0218-1940.

P. Mutzel and P. Eades, "Graphs in Software Visualisation", Chapter 4 of Software Visual-isation (ed. S. Deihl), Lecture Notes in Computer Science Volume 2269, p. 285-285, 2002.

Wei Lai and P. Eades, "Removing edge-node intersections in drawings of graphs", Information Processing Letters 81 (2002), 105-110.

Carsten Friedrich and Peter Eades, "Graph Drawing in Motion", Journal of Graph Algorithms and Applications 6 (3) 353-370, 2002.

J. Branke, S. Leppert, M. Middendorf and P. Eades, "Width-restricted layering of acyclic digraphs with consideration of dummy edges", Information Processing Letters 81 (2), 2002, pp 59-63. ISSN 0020-0190.

P. Eades and M. L. Huang, "Navigating Clustered Graphs using Force-Directed Methods", Journal of Graph Algorithms and Applications Vol. 4, no. 3, pp. 157-181, 2000.

Peter Eades, Xuemin Lin, "Spring algorithms and symmetry", Theoretical Computer Science 240(2): 379-405 (2000)

S-H. Hong, P. Eades, and S-H. Lee, "Drawing series-parallel digraphs symmetrically", Computational Geometry 17 (2000), 165–188.

P. Eades, A. Symvonis and S. Whitesides, "Three-Dimensional Orthogonal Graph Drawing Algorithms", Discrete Applied Mathematics, 103 (2000), 55–87.

P. Eades, Q-W. Feng, and H. Nagamochi, "Drawing clustered graphs on an orthogonal grid", Journal of Graph Algorithms and Applications vol. 3 (4) (1999), 3-29.

M. L. Huang, P. Eades, and J. Wang, "On-line animated visualization of huge graphs using a modified spring algorithm", Journal of Visual Languages and Computing 9 (1998), 623-645.

P. Eades and P. Mutzel, "Graph Drawing Algorithms", Chapter 9 of the Handbook on Algorithms and Theory of Computation (Ed. M. Attallah), CRC Press 1998.

M. L. Huang, P. Eades and R. F. Cohen, "WebOFDAV—navigating and visualising the Web online with animated context swapping", Computer Networks and ISDN Systems, 30 (1998), 638-642.

R. Cohen, P. Eades, T. Lin and F. Ruskey, "Three-Dimensional Graph Drawing", Algorithmica 17 (2) (1996), 199-208.

P. Eades, C. Stirk and S. Whitesides, "The Techniques of Komolgorov and Bardzin for Three Dimensional Orthogonal Graph Drawings", Information Processing Letters 60, (2) (1996), 97-103.

P. Eades, X. Lin and R. Tamassia, "An algorithm for drawing a hierarchical graph", Inter-national Journal of Computational Geometry and Applications, 6 (2) (1996), 145-155.

P. Eades, M. Keil, P. Manuel and M. Miller, "Two minimum dominating sets with minimum intersection in chordal graphs", Nordic Journal of Computing, 3 (1996), 220-237.

Peter Eades and Sue Whitesides, "The logic engine and the realization problem for nearest neighbor graphs", Theoretical Computer Science 169 (1) (1996), 23-37.

P. Eades and T. Lin, "Layout creation methods for software visualisation", Software Visualization, World Scientific 1996, 64-86.

W. Lai and P. Eades, "Structural modeling of flowcharts", Software Visualization, World Scientific 1996, 228-233.

P. Eades and S. Whitesides, "The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard", Algorithmica 16 (1) 1996, 60-82.

P. Eades, Wei Lai, K. Misue and K. Sugiyama, "Layout Adjustment and the Mental Map", Journal of Visual Languages and Computing 6, (1995), 183-210.

P. Eades and X. Lin, "A New Heuristic for the Feedback Arc Set Problem", Australian Journal of Combinatorics, 12, 1995, 15-26.

P. Eades and S. Whitesides, "Drawing Graphs in Two Layers", Theoretical Computer Science 131, 1994, 361-374.

G. Di Battista, Peter Eades, Roberto Tamassia and I. Tollis, "Algorithms for Automatic Graph Drawing: An Annotated Bibliography", Computational Geometry: Theory and Applications 4 (1994), 235 282.

P. Eades and N. Wormald, "Edge Crossings in Drawings of Bipartite Graphs", Algorithmica 11 (1994), 379-403.

Top

Refereed conference proceedings:

L. Zheng, L. Song and P Eades, "Crossing Minimisation Problems of Drawing Bipartite Graphs in Two Clusters", Proceedings of APVIS 2005 (Asia Pacific Symposium on Information Visualisation 2005), to be published by Australian Computer Society Inc, Conferences in Research and Practice in Information Technology, Vol. 45, 2005.

A. F. Ahmed and P. Eades, "Automatic Camera Path Generation for Graph Navigation in 3D, Proceedings of APVIS 2005 (Asia Pacific Symposium on Information Visualisation 2005), to be published by Australian Computer Society Inc, Conferences in Research and Practice in Information Technology, Vol. 45, 2005.

W. Li P. Eades and N. Nikolov, "Using Spring Algorithms to Remove Node Overlapping", Proceedings of APVIS 2005 (Asia Pacific Symposium on Information Visualisation 2005), to be published by Australian Computer Society Inc, Conferences in Research and Practice in Information Technology, Vol. 45, 2005.

X. Shen and P. Eades, "Using Money Colour to Represent Financial Data", Proceedings of APVIS 2005 (Asia Pacific Symposium on Information Visualisation 2005), to be published by Australian Computer Society Inc, Conferences in Research and Practice in Information Technology, Vol. 45, 2005.

W. Huang and P. Eades, "How People Read Graphs", Proceedings of APVIS 2005 (Asia Pacific Symposium on Information Visualisation 2005), to be published by Australian Computer Society Inc, Conferences in Research and Practice in Information Technology, Vol. 45, 2005.

S. Hong and P. Eades, "Symmetric Layout of Disconnected Graphs", Algorithms and Computations, Proceedings of ISAAC 2003 (Algorithms and Computations), Lecture Notes in Computer Science, Springer-Verlag, pp. 405-414, 2003.

S. Hong and P Eades, "Drawing Disconnected Graphs Symmetrically", Proceedings of WAAC (Japan-Korea Workshop on Algorithms and Computation), pp. 276-278, 2003

P. Eades, X. Shen, "Using MoneyTree to Represent Financial Data", Proceedings of Information Visualisation, Eighth International Conference, (IV'04), IEEE Computer Society, Vol 00, 2004

P. Eades, X. Shen, "Money Tree: Ambient Information Visualisation of Financial Data", Proceedings of Visual Information Processing (VIP2003), Conferences in Research and Practice in Information Technology, M Piccardi et al (eds), Vol. 36, 2004.

S. Hong and P. Eades, "A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Planar Graphs", Proceedings of Graph Drawing 2004, Lecture Notes in Computer Science, Springer-Verlag, to appear.

K. Pulo, P. Eades and M. Takatsuka (2003), "Smooth Structural Zooming of h-v Inclusion Tree Layouts", Proceedings of International Conference on Coordinated & Multiple Views in Exploratory Visualisation (associated with 7th International Conference on Information Visualisation (IV03)), London, July 15, 2003.

Hugo A. D. do Nascimento and Peter Eades, "User Hints for Map Labelling", Computer Science 2003, Australian Computer Science Communications 25 (1), 2003.

Hugo do Nascimento and Peter Eades, "A focus and Constraint Based Genetic Algorithm for Directed Graph Drawing", 2nd International Conference in Hybrid Intelligent Systems (in Chile, Dec 1-4, 2002).

Hugo do Nascimento and Peter Eades, "User Hints for Directed Graph Drawing", Proceedings of the 9th Graph Drawing Conference (GD 2001), Lectures Notes on Computer Science, Vol. 2265, 2002, pp. 205-219.

T. Dwyer and P. Eades, "Visualising a Fund Manager Flow Graph with Columns and Worms", Proceedings of IV2002, IEEE Computer Society Proceedings, pp 147-158, 2002.

Seok-Hee Hong, Brendan McKay and Peter Eades, "Symmetric Drawings of Triconnected Planar Graphs", Proceeding of SODA (ACM-SIAM conference on Discrete Algorithms), pp 356-365, 2002.

H. A. D. do Nascimento and P. Eades, "Interactive graph clustering based on user hints", SCASE2001, Proceedings of the 2^nd International Workshop on Soft Computing Applied to Software Engineering, University of Twente (2001).

H. A. D. do Nascimento and P. Eades, and C. F. X. de Mendonca, "A mulitagent approach using A-teams for graph drawing", Intelligent Systems, Proceedings of the 9^th International ISCA Conference, ISCA (2000), 39–42.

S-H. Hong and P. Eades, "An algorithm for finding three dimensional symmetry in series parallel digraphs", ISAAC2000, Springer Lecture Notes in Computer Science Vol. 1969 (2000), 266–277.

F. Bertault and P. Eades, "Graph Library Design", SCCC 2000, (20^th Conference of the Chilean Computer Science Society), pp 144–151 (IEEE Computer Society) 2000.

F. Bertault and P. Eades, "Drawing hypergraphs in the subset standard", Graph Drawing 2000, Springer Lecture Notes in Computer Science Vol. 1984 (2001), 164-169.

S-H. Hong and P. Eades, "An algorithm for finding three dimensional symmetry in trees", Graph Drawing 2000, Springer Lecture Notes in Computer Science Vol. 1984 (2001), 360–371.

A. S. M. Sajeev, W. Wang, A. Quigley and P. Eades, "Towards visualising size measures for large systems", Proceedings of the Australian Conference on Software Measurement, Sydney 2000, pp195–206.

C. Friedrich and P. Eades, "The Marey graph animation tool demo", Graph Drawing 2000, Springer Lecture Notes in Computer Science Vol. 1984 (2001), 396–406.

A. Quigley and P. Eades, "FADE: Graph drawing, clustering, and visual abstraction", Graph Drawing 2000, Springer Lecture Notes in Computer Science Vol. 1984 (2001), 197-210.

Seok-Hee Hong and Peter Eades, "An Algorithm for Finding Three Dimensional Symmetry in Trees", Proceedings of Korea Information Science Society Spring Conference, 2000 (in Korean).

Seok-Hee Hong and Peter Eades, "How to Find Three Dimension al Symmetry in Series Parallel Digraphs", Proceedings of Korea Information Science Society Spring Conference, 2000 (In Korean).

A. Quigley and P. Eades, ProVEDA: "A scheme for progressive visualisation and exploratory data analysis of clusters", Proceedings of the 3^rd Software Visualisation Workshop (SoftVis99), Sydney, 1999.

W. Lai and P. Eades, "Routing Drawings in Diagram Displays", APCHI98 (Asia-Pacific Computer Human Interaction), Zushi, Japan, 1998.

S.-H. Hong, P. Eades, A. Quigley and S.-H. Lee, "Drawing algorithms for series-parallel digraphs in two and three dimensions", Graph Drawing 98 (ed. S. Whitesides), Springer Lecture Notes in Computer Science 1547 (1998), 198-209.

M. L. Huang and P. Eades, "A fully interactive system for clustering and navigating large graphs", Graph Drawing 98 (ed. S. Whitesides), Springer Lecture Notes in Computer Science 1547 (1998), 374-383.

S.-H. Hong, P. Eades and S.-H. Lee, "Finding planar geometric automorphisms in planar graphs", ISAAC 98: Algorithms and Computation (ed. Chwa and Ibarra), Springer Lecture Notes in Computer Science 1533 (1998), 277-286.

H. Nagamochi and P. Eades, "Edge splitting and edge-connectivity augmentation", in Planar graphs, Integer Programming and Combinatorial Optimisation (IPCO 6) (Eds. Bixby, Boyd and Rios-Mercado), Springer Lecture Notes in Computer Science 1412 (1998), 96-111.

J. Utech, J. Branke, H. Schmeck and P. Eades, "An evolutionary algorithm for drawing directed graphs", CISST’98 (International Conference on Imaging Science, Systems, and Technology) (ed. Arabnia), CSREA Press (1998), 154-160.

P. Eades and W. Feng, "Drawing clustered graphs on an orthogonal grid", Graph Drawing 97, Lecture Notes in Computer Science 1353 (Ed. G. di Battista), 146-157.

P. Eades, R. Cohen and M. Huang, "Online Animated Graph Drawing for Web Navigation", Graph Drawing 97, Lecture Notes in Computer Science 1353 (Ed. G. di Battista), 330-335.

P. Eades, M. Houle and R. Webber, "Finding the best viewpoints for three dimensional graph drawings", Graph Drawing 97, Lecture Notes in Computer Science 1353 (Ed. G. di Battista), 87-98.

X. Lin and P. Eades, "Area requirements for drawing hierarchically planar graphs", Graph Drawing 97,