Professor Peter Eades

PhD (Mathematics), ANU, 1977
Research Professor
School of Information Technologies

J12 - The School of Information Technologies
The University of Sydney

Telephone +61 2 9036 9709
Fax +61 2 9351 3838

Website School of Information Technologies

Personal page

Curriculum vitae Curriculum vitae

Biographical details

Professor Peter Eades has been investigating methods for visualization of networks since the 1980s. The algorithms described in his papers on this topic are currently commonly used in diverse software systems, from social networks, biological networks, CASE tools, to security. Peter is currently semi-retired, however he continues to research the mathematics and algorithmics of geometric graphs.

Teaching and supervision

INFO5993 - IT Research Methods

Selected grants

2012

  • Scalable Algorithms for Massive Complex Data Analysis; Hong S, Eades P, Fleischer R, Yen H, Tokuyama T, Park K; DVC International/IPDF Grant.
  • Interacting with Visualizations of Extremely Large Graph Structures on Large Displays; Thomas B, Eades P, Smith R; Australian Research Council (ARC)/Discovery Projects (DP).

2011

  • LNK: 2011/Round1/ARC Linkage Project LP110100519 Visual Interaction Methods for Clustered Graphs; Hong S, Takatsuka M, Hirshorn J, Eades P; Tom Sawyer Software (USA)/Project Support.
  • Algorithms for geometric Turan-type Problems and Network Visualization; Eades P; Australian Research Council (ARC)/Discovery Projects (DP).
  • Visual Analytics for High Volume Multi Attribute Financial Data Streams; Takatsuka M, Eades P, Peat M; Australian Research Council (ARC)/Linkage Projects (LP).
  • Visual Interaction Methods for Clustered Graphs; Eades P, Takatsuka M, Hong S; Australian Research Council (ARC)/Linkage Projects (LP).

2010

  • Analysis and Visualization of Complex Networks; Eades P, Liotta G; DVC Research/International Visiting Research Fellowship (IVRF).
  • Establishment of Research Collaboration on Discovery of New Graph Algorithms; Eades P; DVC International/IPDF Grant.

2009

  • Scalable Visual Analytics for Uncertain Dynamic Networks; Eades P, Hong S; Australian Research Council (ARC)/Discovery Projects (DP).

2006

  • Multimedia Computing, Production, Management and Distribution for HDTV and its Applications; Feng D, Cai T, Wang Z, Everitt D, Eades P, Hoang D; Australian Research Council (ARC)/Linkage Infrastructure, Equipment and Facilities (LIEF).

2005

  • Topological approaches for three dimensional graph drawing; Eades P, Hong S; Australian Research Council (ARC)/Discovery Projects (DP).

2004

  • Linkage 2004 Round Two - New Methods for Interactive Visualization of Large Microarray Data Sets; Eades P, Fung D; Axogenic Pty Ltd/Project Support.
  • NICTA Research - Peter Eades 1/7/03 to 30/6/06; Eades P; NICTA/Research Grant.
  • New Methods for Interactive Visualization of Large Microarray Data Sets; Eades P, Hong S; Australian Research Council (ARC)/Linkage Projects (LP).
  • NICTA Research - Peter Eades 1/7/03 to 30/6/06; Eades P; National ICT Australia/Research Support.

2003

  • Visualising and navigating large multivariate data sets; Eades P; DVC Research/Research and Development Scheme: Research and Development (R&D).
  • Visualisation of market Depth data using BK-Landscape visualisation technique; Eades P, Hale R; Capital Markets CRC/Research Grants.

2002

  • Eye Tracker Usability Laboratory; Kay J, Feng D, Eades P; University of Sydney/Equipment Grant.
  • Visualisation of Financial Data using Graph Visualisation; Eades P, Aitken M; Capital Markets CRC/Research Grants.

2001

  • Graph drawing with fixed node constraints; Eades P, Newton M, Madden B; Australian Research Council (ARC)/Strategic Partnerships with Industry - Research and Training (SPIRT).
  • Drawing graphs symmetrically; Eades P; Australian Research Council (ARC)/Large Research Grants (LRG).

2000

  • Clustering methods for graphs; Eades P; Australian Research Council (ARC)/Large Research Grants (LRG).
  • Drawing clustered graphs; Eades P; Australian Research Council (ARC)/Large Research Grants (LRG).
  • Advanced architectures and the techniques for the visualisation of complex systems; Eades P; DSTO Department of Defence/Research Grants.

Selected publications

Download citations: PDF RTF Endnote

Edited Books

  • Eades, P., Ertl, T., Shen, H. (2009). IEEE Pacific Visualization Symposium 2009: Proceedings. United States: (IEEE) Institute of Electrical and Electronics Engineers.

Book Chapters

  • Eades, P., Gutwenger, C., Hong, S., Mutzel, P. (2010). Graph Drawing Algorithms. In Mikhail J Atallah and Marina Blanton (Eds.), Algorithms and Theory of Computation Handbook: Special Topics and Techniques (2nd Ed). United States: CRC Press.
  • Didimo, W., Eades, P., Liotta, G. (2009). Drawing Graphs with Right Angle Crossings. In Gavrilova, Maria~Tòth, Casaba D.~Dehne, Frank~Sack, Jörg-Rüdiger~ (Eds.), Algorithms and Data Structures 11th International Symposium, WADS 2009 Banff, Canada, August 21-23, 2009 Proceedings, (pp. 206-217). Berlin Heidelberg: Springer.
  • Eades, P., Hong, S., Nesbitt, K., Takatsuka, M. (2006). Information Display. In Albert Y Zomaya (Eds.), Handbook of Nature-Inspired and Innovative Computing, (pp. 633-655). New York: Springer Science + Business Media.
  • Murray, C., Friedrich, C., Eades, P. (2004). Hexgraph: Applying Graph Drawing Algorithms To The Game Of Hex. In Guiseppe Liotta (Eds.), Graph drawing : 11th international symposium, GD 2003, Perugia, Italy, September 21-24, 2003 : revised papers, (pp. 494-495). Berlin: Springer.
  • Lai, W., Eades, P., Huang, M. (2003). Flowchart components for program visualization. In Shang (Eds.), Software Visualization: from Theory to Practice, (pp. 59-75). Boston: Springer.
  • Hong, S., Eades, P. (2001). An Algorithm for Finding Three Dimensional Symmetry in Trees. In Patrick Healy & Nikola S Nikolov (Eds.), Graph Drawing: 13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, (pp. 360-371). United States: Springer.
  • Eades, P., Bertault, F. (2001). Drawing Hypergraphs in the Subset Standard (Short Demo Paper). In Patrick Healy & Nikola S Nikolov (Eds.), Graph Drawing: 13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, (pp. 164-169). United States: Springer.

Journals

  • Eades, P., Hong, S., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theoretical Computer Science, 513, 65-76. [More Information]
  • Huang, W., Eades, P., Hong, S., Lin, C. (2013). Improving multiple aesthetics produces better graph drawings. Journal of Visual Languages and Computing, 24(4), 262-272. [More Information]
  • Eades, P., Liotta, G. (2013). Right angle crossing graphs and 1-planarity. Discrete Applied Mathematics, 161(7-8), 961-969. [More Information]
  • Di Giacomo, E., Didimo, W., Eades, P., Hong, S., Liotta, G. (2012). Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics, 160(1-2), 132-139. [More Information]
  • Hong, S., Eades, P., Liotta, G., Poon, S. (2012). Fary's theorem for 1-planar graphs. Lecture Notes in Computer Science (LNCS), 7434, 335-346.
  • Didimo, W., Eades, P., Liotta, G. (2011). Drawing graphs with right angle crossing. Theoretical Computer Science, 412(39), 5156-5166. [More Information]
  • Nguyen, Q., Eades, P., Hong, S., Huang, W. (2011). Large crossing angles in circular layouts. Lecture Notes in Computer Science (LNCS), 6502, 397-399. [More Information]
  • Shen, X., Vande Moere, A., Eades, P., Hong, S. (2009). Issues for the Evaluation of Ambient Displays. International Journal of Ambient Computing and Intelligence, 1(2 (April- June)), 59-69.
  • Huang, W., Eades, P., Hong, S. (2009). Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization, 8(3), L169-152. [More Information]
  • do Nascimento, H., Eades, P. (2008). User Hints for Map Labeling. Journal of Visual Languages and Computing, 19(1), 39-74.
  • Huang, W., Hong, S., Eades, P. (2007). Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualisation. Journal of Graph Algorithms and Applications, 11(2), 397-429.
  • Hong, S., McKay, B., Eades, P. (2006). A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs. Discrete and Computational Geometry, 36(2), 283-311. [More Information]
  • Hong, S., Eades, P. (2006). Drawing planar graphs symmetrically, III: Oneconnected planar graphs. Algorithmica: an international journal in computer science, 44(1), 67-100. [More Information]
  • Huang, W., Hong, S., Eades, P. (2006). Layout effects on sociogram perception. Lecture Notes in Computer Science (LNCS), 3843, 262-273.
  • Eades, P., Feng, Q., Lin, X., Nagamochi, H. (2006). Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica: an international journal in computer science, 44(1), 1-32. [More Information]
  • Hong, S., Eades, P. (2005). A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Lecture Notes in Computer Science (LNCS), 3383, 307-317. [More Information]
  • Hong, S., Eades, P. (2005). Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica: an international journal in computer science, 42(2), 159-197. [More Information]
  • do Nascimento, H., Eades, P. (2005). User hints: a framework for interactive optimization. Future Generation Computer Systems: the international journal of grid computing: theory, methods and applications, 21(7), 1177-1191. [More Information]
  • Hong, S., Eades, P., Hillman, J. (2004). Linkless Symmetric Drawings Of Series Parallel Digraphs. Computational Geometry, 29(3), 191-221. [More Information]
  • Nagamochi, H., Eades, P. (2003). An edge-splitting algorithm in planar graphs. Journal of Combinatorial Optimization, 7(2), 137-159.
  • Hong, S., Eades, P. (2003). Drawing trees symmetrically in three dimensions. Algorithmica: an international journal in computer science, 36(2), 153-178. [More Information]
  • Huang, M., Eades, P., Lai, W. (2003). On-line visualization and navigation of the global web structure. International Journal Of Software Engineering And Knowledge Engineering, 13(1), 27-52.
  • Farr, G., Eades, P. (2003). Skewness of graphs with small cutsets. Graphs and Combinatorics, 19(2), 177-194.
  • Lin, X., Eades, P. (2003). Towards area requirements for drawing hierarchically planar graphs. Theoretical Computer Science, 292(3), 679-695.
  • Lai, W., Eades, P. (2002). Removing edge-node intersections in drawings of graphs. Information Processing Letters, 81(2), 105-110.

Conferences

  • Hong, S., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). A Linear-Time Algorithm for Testing Outer-1-Planarity. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
  • Dekhordi, H., Nguyen, Q., Eades, P., Hong, S. (2013). Circular graph drawings with large crossing angles. 7th International Workshop on Algorithms and Computation (WALCOM 2013), Berlin: Springer. [More Information]
  • Nguyen, Q., Eades, P., Hong, S. (2013). On the Faithfulness of Graph Visualizations. IEEE Symposium on Pacific Visualization 2013, Sydney, Australia: IEEE Xplore. [More Information]
  • Nguyen, Q., Eades, P., Hong, S. (2013). On the Faithfulness of Graph Visualizations. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Nguyen, Q., Eades, P., Hong, S. (2013). StreamEB: Stream Edge Bundling. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Eades, P., Hong, S., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time (Extended Abstract). 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Eades, P., Klein, K. (2013). The graph landscape - A visualization of graph properties. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer.
  • Eades, P., Liotta, G. (2012). Right Angle Crossing Graphs and 1-Planarity. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer.
  • Nguyen, Q., Hong, S., Eades, P. (2012). TGI-EB: A New Framework for Edge Bundling integrating Topology, Geometry and Importance. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer.
  • Liu, H., Eades, P., Hong, S. (2012). Visualizing Dynamic Trajectories in Social Networks. 2012 IEEE Symposium on Visual Languages and Human-Centric Computing, Los Alamitos: IEEE Computer Society. [More Information]
  • Di Giacomo, E., Didimo, W., Eades, P., Liotta, G. (2011). 2-Layer Right Angle Crossing Drawings. 22nd International Workshop on Combinatorial Algorithms, Heidelberg, Germany: Springer Verlag. [More Information]
  • Huang, W., Eades, P., Hong, S., Lin, C. (2010). Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. 2010 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2010), USA: (IEEE) Institute of Electrical and Electronics Engineers. [More Information]
  • Eades, P., Hong, S., Poon, S. (2010). On Rectilinear Drawing of Graphs. 17th International Symposium on Graph Drawing (GD 2009), Germany: Springer.
  • Huang, W., Eades, P., Hong, S. (2009). A Graph Reading Behavior: Geodesic-Path Tendency. IEEE Pacific Visualization Symposium - PacificVis 2009, United States: (IEEE) Institute of Electrical and Electronics Engineers. [More Information]
  • Huang, W., Eades, P., Hong, S. (2008). Beyond Time and Error: A Cognitive Approach to the Evaluation of Graph Drawings. 2008 Conference on BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM).
  • Huang, W., Hong, S., Eades, P. (2008). Effects of Crossing Angles. IEEE Pacific Visualization Symposium 2008, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Eades, P. (2008). Some Constrained Notions of Planarity. 19th International Symposium on Algorithms and Computation ISAAC 2008, Berlin: Springer.
  • Shen, X., Vande Moere, A., Eades, P., Hong, S. (2008). The Long-Term Evaluation of Fisherman in a Partial-Attention Environment. 2008 Conference on BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM).
  • Müller-Tomfelde, C., Kellar, B., Eades, P. (2007). HxI : An Australian Initiative in ICT-Augmented Human Interactivity. The 11th IFIP TC 13 International Conference on Human-Computer Interaction (INTERACT 2007), Germany: Springer.
  • Shen, X., Eades, P., Hong, S., Vande Moere, A. (2007). Intrusive and Non-intrusive Evaluation of Ambient Displays. 1st International Workshop at Pervasive 2007 on Designing and Evaluating Ambient Information Systems, The 5th International Conference on Pervasive Computing, online: CEUR-WS.
  • Huang, W., Hong, S., Eades, P. (2006). How People Read Sociograms: A Questionnaire Study. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Huang, W., Hong, S., Eades, P. (2006). Layout effects on sociogram perception. Graph Drawing 13th International Symposium, GD 2005, Berlin: Springer.
  • Huang, W., Hong, S., Eades, P. (2006). Predicting Graph Reading Performance: A Cognitive Approach. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Chen, F., Close, B., Eades, P., Epps, J., Hutterer, P., Lichman, S., Takatsuka, M., Thomas, B., Wu, M. (2006). ViCAT: Visualization and Interaction on a Collaborative Access Table. TableTop: First IEEE International Workshop on Horizontal Interactive Human-Computer Systems 2006, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Li, W., Hong, S., Eades, P. (2005). A Framework for Visualising Large Graphs. Ninth International Conference on Information Visualisation (IV05), Piscataway NJ: (IEEE) Institute of Electrical and Electronics Engineers.
  • Shen, X., Vande Moere, A., Eades, P. (2005). An Intrusive Evaluation of Peripheral Display. 3rd International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia - Graphite 2005, New York, NY, USA: Association for Computing Machinery (ACM).
  • Ahmed, A., Eades, P. (2005). Automatic Camera Path Generation for Graph Navigation in 3D. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Zheng, L., Song, L., Eades, P. (2005). Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Huang, W., Eades, P. (2005). How People Read Graphs. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Li, W., Eades, P., Hong, S. (2005). Navigating Software Architectures with Constant Visual Complexity. 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC05), California, USA: (IEEE) Institute of Electrical and Electronics Engineers. [More Information]
  • Shen, X., Eades, P. (2005). Using MoneyColor to Represent Financial Data. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Li, W., Eades, P., Nikolov, N. (2005). Using Spring Algorithms to Remove Node Overlapping. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Eades, P., Shen, X. (2004). Money Tree: Ambient Information Visualization Of Financial Data. Pan-Sydney Area Workshop on Visual Information Processing (VIP2003), Australia: Australian Computer Society.
  • Shen, X., Eades, P. (2004). Using Money Tree To Represent Financial Data. Eighth International Conference on Information Visualisation (IV 2004), Los Alamitos, CA, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Eades, P. (2003). Drawing disconnected graphs symmetrically. Japan-Korea Joint Workshop on Algorithms and Computations (WACC), Japan: National University of Singapore.
  • Pulo, K., Eades, P., Takatsuka, M. (2003). Smooth structural zooming of h-v inclusion tree layouts. Coordinated and Multiple Views in Exploratory Visualization, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Eades, P. (2003). Symmetric layout of disconnected graphs. 14th Annual International Symposium on Algorithms and Computation ISAAC 2003. Springer.
  • Do Nascimento, H., Eades, P. (2003). User hints for map labelling. 26th Australasian Computer Science Conference, Sydney: Australian Computer Science Society.
  • Do Nascimento, H., Eades, P. (2002). A Focus and Constraint based Genetic Algorithm for Interactive Directed Graph Drawing. Hybrid Intelligent Systems 2002, The Netherlands: IOS Press.
  • Hong, S., McKay, B., Eades, P. (2002). Symmetric drawings of triconnected planar graphs. thirteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia: Society for Industrial and Applied Mathematics (SIAM).
  • Do Nascimento, H., Eades, P. (2002). User Hints for Directed Graph Drawing. 9th International Symposium, GD 2001, Germany: Springer.
  • Dwyer, T., Eades, P. (2002). Visualising a Fund Manager Flow Graph with Columns and Worms. Sixth International Conference on Information Visualisation, Los Alamitos, California: (IEEE) Institute of Electrical and Electronics Engineers.
  • Do Nascimento, H., Eades, P. (2001). A System for Graph Clustering based on User Hints. Pan-Sydney Workshop on Visual Information Processing, Sydney: Australian Computer Society.
  • Do Nascimento, H., Eades, P. (2001). Interactive Graph Clustering based on User Hints. Second International Workshop on Soft Computing Applied to Software Engineering, : UNSW Australian Defence Force Academy.

2013

  • Eades, P., Hong, S., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theoretical Computer Science, 513, 65-76. [More Information]
  • Hong, S., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). A Linear-Time Algorithm for Testing Outer-1-Planarity. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
  • Dekhordi, H., Nguyen, Q., Eades, P., Hong, S. (2013). Circular graph drawings with large crossing angles. 7th International Workshop on Algorithms and Computation (WALCOM 2013), Berlin: Springer. [More Information]
  • Huang, W., Eades, P., Hong, S., Lin, C. (2013). Improving multiple aesthetics produces better graph drawings. Journal of Visual Languages and Computing, 24(4), 262-272. [More Information]
  • Nguyen, Q., Eades, P., Hong, S. (2013). On the Faithfulness of Graph Visualizations. IEEE Symposium on Pacific Visualization 2013, Sydney, Australia: IEEE Xplore. [More Information]
  • Nguyen, Q., Eades, P., Hong, S. (2013). On the Faithfulness of Graph Visualizations. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Eades, P., Liotta, G. (2013). Right angle crossing graphs and 1-planarity. Discrete Applied Mathematics, 161(7-8), 961-969. [More Information]
  • Nguyen, Q., Eades, P., Hong, S. (2013). StreamEB: Stream Edge Bundling. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Eades, P., Hong, S., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time (Extended Abstract). 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
  • Eades, P., Klein, K. (2013). The graph landscape - A visualization of graph properties. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer.

2012

  • Di Giacomo, E., Didimo, W., Eades, P., Hong, S., Liotta, G. (2012). Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics, 160(1-2), 132-139. [More Information]
  • Hong, S., Eades, P., Liotta, G., Poon, S. (2012). Fary's theorem for 1-planar graphs. Lecture Notes in Computer Science (LNCS), 7434, 335-346.
  • Eades, P., Liotta, G. (2012). Right Angle Crossing Graphs and 1-Planarity. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer.
  • Nguyen, Q., Hong, S., Eades, P. (2012). TGI-EB: A New Framework for Edge Bundling integrating Topology, Geometry and Importance. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer.
  • Liu, H., Eades, P., Hong, S. (2012). Visualizing Dynamic Trajectories in Social Networks. 2012 IEEE Symposium on Visual Languages and Human-Centric Computing, Los Alamitos: IEEE Computer Society. [More Information]

2011

  • Di Giacomo, E., Didimo, W., Eades, P., Liotta, G. (2011). 2-Layer Right Angle Crossing Drawings. 22nd International Workshop on Combinatorial Algorithms, Heidelberg, Germany: Springer Verlag. [More Information]
  • Didimo, W., Eades, P., Liotta, G. (2011). Drawing graphs with right angle crossing. Theoretical Computer Science, 412(39), 5156-5166. [More Information]
  • Nguyen, Q., Eades, P., Hong, S., Huang, W. (2011). Large crossing angles in circular layouts. Lecture Notes in Computer Science (LNCS), 6502, 397-399. [More Information]

2010

  • Eades, P., Gutwenger, C., Hong, S., Mutzel, P. (2010). Graph Drawing Algorithms. In Mikhail J Atallah and Marina Blanton (Eds.), Algorithms and Theory of Computation Handbook: Special Topics and Techniques (2nd Ed). United States: CRC Press.
  • Huang, W., Eades, P., Hong, S., Lin, C. (2010). Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. 2010 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2010), USA: (IEEE) Institute of Electrical and Electronics Engineers. [More Information]
  • Eades, P., Hong, S., Poon, S. (2010). On Rectilinear Drawing of Graphs. 17th International Symposium on Graph Drawing (GD 2009), Germany: Springer.

2009

  • Huang, W., Eades, P., Hong, S. (2009). A Graph Reading Behavior: Geodesic-Path Tendency. IEEE Pacific Visualization Symposium - PacificVis 2009, United States: (IEEE) Institute of Electrical and Electronics Engineers. [More Information]
  • Didimo, W., Eades, P., Liotta, G. (2009). Drawing Graphs with Right Angle Crossings. In Gavrilova, Maria~Tòth, Casaba D.~Dehne, Frank~Sack, Jörg-Rüdiger~ (Eds.), Algorithms and Data Structures 11th International Symposium, WADS 2009 Banff, Canada, August 21-23, 2009 Proceedings, (pp. 206-217). Berlin Heidelberg: Springer.
  • Eades, P., Ertl, T., Shen, H. (2009). IEEE Pacific Visualization Symposium 2009: Proceedings. United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Shen, X., Vande Moere, A., Eades, P., Hong, S. (2009). Issues for the Evaluation of Ambient Displays. International Journal of Ambient Computing and Intelligence, 1(2 (April- June)), 59-69.
  • Huang, W., Eades, P., Hong, S. (2009). Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization, 8(3), L169-152. [More Information]

2008

  • Huang, W., Eades, P., Hong, S. (2008). Beyond Time and Error: A Cognitive Approach to the Evaluation of Graph Drawings. 2008 Conference on BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM).
  • Huang, W., Hong, S., Eades, P. (2008). Effects of Crossing Angles. IEEE Pacific Visualization Symposium 2008, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Eades, P. (2008). Some Constrained Notions of Planarity. 19th International Symposium on Algorithms and Computation ISAAC 2008, Berlin: Springer.
  • Shen, X., Vande Moere, A., Eades, P., Hong, S. (2008). The Long-Term Evaluation of Fisherman in a Partial-Attention Environment. 2008 Conference on BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM).
  • do Nascimento, H., Eades, P. (2008). User Hints for Map Labeling. Journal of Visual Languages and Computing, 19(1), 39-74.

2007

  • Huang, W., Hong, S., Eades, P. (2007). Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualisation. Journal of Graph Algorithms and Applications, 11(2), 397-429.
  • Müller-Tomfelde, C., Kellar, B., Eades, P. (2007). HxI : An Australian Initiative in ICT-Augmented Human Interactivity. The 11th IFIP TC 13 International Conference on Human-Computer Interaction (INTERACT 2007), Germany: Springer.
  • Shen, X., Eades, P., Hong, S., Vande Moere, A. (2007). Intrusive and Non-intrusive Evaluation of Ambient Displays. 1st International Workshop at Pervasive 2007 on Designing and Evaluating Ambient Information Systems, The 5th International Conference on Pervasive Computing, online: CEUR-WS.

2006

  • Hong, S., McKay, B., Eades, P. (2006). A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs. Discrete and Computational Geometry, 36(2), 283-311. [More Information]
  • Hong, S., Eades, P. (2006). Drawing planar graphs symmetrically, III: Oneconnected planar graphs. Algorithmica: an international journal in computer science, 44(1), 67-100. [More Information]
  • Huang, W., Hong, S., Eades, P. (2006). How People Read Sociograms: A Questionnaire Study. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Eades, P., Hong, S., Nesbitt, K., Takatsuka, M. (2006). Information Display. In Albert Y Zomaya (Eds.), Handbook of Nature-Inspired and Innovative Computing, (pp. 633-655). New York: Springer Science + Business Media.
  • Huang, W., Hong, S., Eades, P. (2006). Layout effects on sociogram perception. Lecture Notes in Computer Science (LNCS), 3843, 262-273.
  • Huang, W., Hong, S., Eades, P. (2006). Layout effects on sociogram perception. Graph Drawing 13th International Symposium, GD 2005, Berlin: Springer.
  • Huang, W., Hong, S., Eades, P. (2006). Predicting Graph Reading Performance: A Cognitive Approach. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Eades, P., Feng, Q., Lin, X., Nagamochi, H. (2006). Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica: an international journal in computer science, 44(1), 1-32. [More Information]
  • Chen, F., Close, B., Eades, P., Epps, J., Hutterer, P., Lichman, S., Takatsuka, M., Thomas, B., Wu, M. (2006). ViCAT: Visualization and Interaction on a Collaborative Access Table. TableTop: First IEEE International Workshop on Horizontal Interactive Human-Computer Systems 2006, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.

2005

  • Li, W., Hong, S., Eades, P. (2005). A Framework for Visualising Large Graphs. Ninth International Conference on Information Visualisation (IV05), Piscataway NJ: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Eades, P. (2005). A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Lecture Notes in Computer Science (LNCS), 3383, 307-317. [More Information]
  • Shen, X., Vande Moere, A., Eades, P. (2005). An Intrusive Evaluation of Peripheral Display. 3rd International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia - Graphite 2005, New York, NY, USA: Association for Computing Machinery (ACM).
  • Ahmed, A., Eades, P. (2005). Automatic Camera Path Generation for Graph Navigation in 3D. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Zheng, L., Song, L., Eades, P. (2005). Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Hong, S., Eades, P. (2005). Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica: an international journal in computer science, 42(2), 159-197. [More Information]
  • Huang, W., Eades, P. (2005). How People Read Graphs. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Li, W., Eades, P., Hong, S. (2005). Navigating Software Architectures with Constant Visual Complexity. 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC05), California, USA: (IEEE) Institute of Electrical and Electronics Engineers. [More Information]
  • do Nascimento, H., Eades, P. (2005). User hints: a framework for interactive optimization. Future Generation Computer Systems: the international journal of grid computing: theory, methods and applications, 21(7), 1177-1191. [More Information]
  • Shen, X., Eades, P. (2005). Using MoneyColor to Represent Financial Data. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Li, W., Eades, P., Nikolov, N. (2005). Using Spring Algorithms to Remove Node Overlapping. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).

2004

  • Murray, C., Friedrich, C., Eades, P. (2004). Hexgraph: Applying Graph Drawing Algorithms To The Game Of Hex. In Guiseppe Liotta (Eds.), Graph drawing : 11th international symposium, GD 2003, Perugia, Italy, September 21-24, 2003 : revised papers, (pp. 494-495). Berlin: Springer.
  • Hong, S., Eades, P., Hillman, J. (2004). Linkless Symmetric Drawings Of Series Parallel Digraphs. Computational Geometry, 29(3), 191-221. [More Information]
  • Eades, P., Shen, X. (2004). Money Tree: Ambient Information Visualization Of Financial Data. Pan-Sydney Area Workshop on Visual Information Processing (VIP2003), Australia: Australian Computer Society.
  • Shen, X., Eades, P. (2004). Using Money Tree To Represent Financial Data. Eighth International Conference on Information Visualisation (IV 2004), Los Alamitos, CA, USA: (IEEE) Institute of Electrical and Electronics Engineers.

2003

  • Nagamochi, H., Eades, P. (2003). An edge-splitting algorithm in planar graphs. Journal of Combinatorial Optimization, 7(2), 137-159.
  • Hong, S., Eades, P. (2003). Drawing disconnected graphs symmetrically. Japan-Korea Joint Workshop on Algorithms and Computations (WACC), Japan: National University of Singapore.
  • Hong, S., Eades, P. (2003). Drawing trees symmetrically in three dimensions. Algorithmica: an international journal in computer science, 36(2), 153-178. [More Information]
  • Lai, W., Eades, P., Huang, M. (2003). Flowchart components for program visualization. In Shang (Eds.), Software Visualization: from Theory to Practice, (pp. 59-75). Boston: Springer.
  • Huang, M., Eades, P., Lai, W. (2003). On-line visualization and navigation of the global web structure. International Journal Of Software Engineering And Knowledge Engineering, 13(1), 27-52.
  • Farr, G., Eades, P. (2003). Skewness of graphs with small cutsets. Graphs and Combinatorics, 19(2), 177-194.
  • Pulo, K., Eades, P., Takatsuka, M. (2003). Smooth structural zooming of h-v inclusion tree layouts. Coordinated and Multiple Views in Exploratory Visualization, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Eades, P. (2003). Symmetric layout of disconnected graphs. 14th Annual International Symposium on Algorithms and Computation ISAAC 2003. Springer.
  • Lin, X., Eades, P. (2003). Towards area requirements for drawing hierarchically planar graphs. Theoretical Computer Science, 292(3), 679-695.
  • Do Nascimento, H., Eades, P. (2003). User hints for map labelling. 26th Australasian Computer Science Conference, Sydney: Australian Computer Science Society.

2002

  • Do Nascimento, H., Eades, P. (2002). A Focus and Constraint based Genetic Algorithm for Interactive Directed Graph Drawing. Hybrid Intelligent Systems 2002, The Netherlands: IOS Press.
  • Lai, W., Eades, P. (2002). Removing edge-node intersections in drawings of graphs. Information Processing Letters, 81(2), 105-110.
  • Hong, S., McKay, B., Eades, P. (2002). Symmetric drawings of triconnected planar graphs. thirteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia: Society for Industrial and Applied Mathematics (SIAM).
  • Do Nascimento, H., Eades, P. (2002). User Hints for Directed Graph Drawing. 9th International Symposium, GD 2001, Germany: Springer.
  • Dwyer, T., Eades, P. (2002). Visualising a Fund Manager Flow Graph with Columns and Worms. Sixth International Conference on Information Visualisation, Los Alamitos, California: (IEEE) Institute of Electrical and Electronics Engineers.

2001

  • Do Nascimento, H., Eades, P. (2001). A System for Graph Clustering based on User Hints. Pan-Sydney Workshop on Visual Information Processing, Sydney: Australian Computer Society.
  • Hong, S., Eades, P. (2001). An Algorithm for Finding Three Dimensional Symmetry in Trees. In Patrick Healy & Nikola S Nikolov (Eds.), Graph Drawing: 13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, (pp. 360-371). United States: Springer.
  • Eades, P., Bertault, F. (2001). Drawing Hypergraphs in the Subset Standard (Short Demo Paper). In Patrick Healy & Nikola S Nikolov (Eds.), Graph Drawing: 13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, (pp. 164-169). United States: Springer.
  • Do Nascimento, H., Eades, P. (2001). Interactive Graph Clustering based on User Hints. Second International Workshop on Soft Computing Applied to Software Engineering, : UNSW Australian Defence Force Academy.

For support on your academic profile contact .