2023

• Meidiana, A., Hong, S., Eades, P. (2023). Shape-Faithful Graph Drawings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), : Springer Verlag.
• Meidiana, A., Hong, S., Cai, S., Torkel, M., Eades, P. (2023). SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing. IEEE Transactions on Visualization and Computer Graphics. [More Information]

2022

• Meidiana, A., Hong, S., Eades, P., Keim, D. (2022). Automorphism Faithfulness Metrics for Symmetric Graph Drawings. IEEE Transactions on Visualization and Computer Graphics. [More Information]

2021

• Hu, J., Chu, T., Hong, S., Chen, J., Meidiana, A., Torkel, M., Eades, P., Ma, K. (2021). BC tree-based spectral sampling for big complex network visualization. Applied Network Science, 6(1), 60. [More Information]
• Hu, J., Hong, S., Chen, J., Torkel, M., Eades, P., Ma, K. (2021). Connectivity-Based Spectral Sampling for Big Complex Network Visualization. 9th International Conference on Complex Networks and Their Applications (COMPLEX NETWORKS 2020), Cham: Springer Nature. [More Information]
• Hong, S., Eades, P., Torkel, M. (2021). GDot: Drawing Graphs with Dots and Circles. 14th IEEE Pacific Visualization Symposium (PacificVis 2021), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hong, S., Eades, P., Torkel, M., Wood, J., Park, K. (2021). Louvain-based Multi-level Graph Drawing. 14th IEEE Pacific Visualization Symposium (PacificVis 2021), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Meidiana, A., Hong, S., Cai, S., Torkel, M., Eades, P. (2021). Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing. 14th IEEE Pacific Visualization Symposium (PacificVis 2021), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]

2020

• Kotlarek, J., Kwon, O., Ma, K., Eades, P., Kerren, A., Klein, K., Schreiber, F. (2020). A Study of Mental Maps in Immersive Network Visualization. 13th IEEE Pacific Visualization Symposium (PacificVis 2020), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hong, S., Eades, P., Torkel, M., Huang, W., Cifuentes, C. (2020). Dynamic Graph Map Animation. 13th IEEE Pacific Visualization Symposium (PacificVis 2020), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Angelini, P., Eades, P., Hong, S., Klein, K., Kobourov, S., Liotta, G., Navarra, A., Tappini, A. (2020). Graph planarity by replacing cliques with paths. Algorithms, 13(8), 1-10. [More Information]
• Meidiana, A., Hong, S., Eades, P. (2020). New Quality Metrics for Dynamic Graph Drawing. 28th International Symposium on GraphDrawing and Network Visualization, GD 2020, Cham: Springer Nature Switzerland. [More Information]
• Di Giacomo, E., Eades, P., Liotta, G., Meijer, H., Montecchiani, F. (2020). Polyline drawings with topological constraints. Theoretical Computer Science, 809, 250-264. [More Information]
• Meidiana, A., Hong, S., Eades, P., Keim, D. (2020). Quality Metrics for Symmetric Graph Drawings. 13th IEEE Pacific Visualization Symposium (PacificVis 2020), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hu, J., Hong, S., Eades, P. (2020). Spectral Vertex Sampling for Big Complex Graphs. 8th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2019, Cham: Springer. [More Information]
• Meidiana, A., Hong, S., Torkel, M., Cai, S., Eades, P. (2020). Sublinear Time Force Computation for Big Complex Network Visualization. Computer Graphics Forum, 39(3), 579-591. [More Information]

2019

• Meidiana, A., Hong, S., Eades, P., Keim, D. (2019). A Quality Metric for Visualization of Clusters in Graphs. 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), Cham: Springer. [More Information]
• Seto, A., Shurbevski, A., Nagamochi, H., Eades, P. (2019). Acute constraints in straight-line drawings of planar graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E102-A(9), 994-1001. [More Information]
• Koizumi, K., Eades, P., Hiraki, K., Inaba, M. (2019). BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure. International Journal of Data Science and Analytics, 7(1), 17-34. [More Information]
• Hong, S., Eades, P., Torkel, M., Wang, Z., Chae, M., Hong, S., Langerenken, D., Chafi, H. (2019). Multi-level Graph Drawing Using Infomap Clustering. 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), Cham: Springer. [More Information]
• Meidiana, A., Hong, S., Huang, J., Eades, P., Ma, K. (2019). Topology-Based Spectral Sparsification. 9th IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV 2019), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]

2018

• Hong, S., Nguyen, Q., Meidiana, A., Li, J., Eades, P. (2018). BC Tree-based Proxy Graphs for Visualization of Big Graphs. 11th IEEE Pacific Visualization Symposium (PacificVis 2018), Piscataway: IEEE Computer Society. [More Information]
• Koizumi, K., Inaba, M., Eades, P., Hiraki, K. (2018). BJR-tree: Fast skyline computation algorithm for serendipitous searching problems. 4th IEEE International Conference on Data Science and Advanced Analytics (DSAA 2017), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Eades, P., Nguyen, Q., Hong, S. (2018). Drawing Big Graphs using Spectral Sparsification. 25th International Symposium on Graph Drawing & Network Visualization, Cham: Springer International Publishing. [More Information]
• Bae, S., Baffier, J., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S., Korman, M., Montecchiani, F., Rutter, I., et al (2018). Gap-planar graphs. 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), Cham: Springer. [More Information]
• Bae, S., Baffier, J., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S., Korman, M., Montecchiani, F., Rutter, I., et al (2018). Gap-planar graphs. Theoretical Computer Science, 745, 36-52. [More Information]
• Di Giacomo, E., Eades, P., Liotta, G., Meijer, H., Montecchiani, F. (2018). Polyline Drawings with Topological Constraints. 29th International Symposium on Algorithms and Computation (ISAAC 2018), Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. [More Information]
• Eades, P., Healy, P., Nikolov, N. (2018). The weighted barycenter drawing recognition problem. 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), Cham: Springer. [More Information]
• Angelini, P., Eades, P., Hong, S., Klein, K., Kobourov, S., Liotta, G., Navarra, A., Tappini, A. (2018). Turning cliques into paths to achieve planarity. 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), Cham: Springer. [More Information]

2017

• Nguyen, Q., Hong, S., Eades, P. (2017). DNNG: Quality metrics and layout for neighbourhood faithfulness. 10th IEEE Pacific Visualization Symposium, PacificVis 2017, Washington, D.C.: IEEE Computer Society. [More Information]
• Nguyen, Q., Hong, S., Eades, P., Meidiana, A. (2017). Proxy graph: Visual quality metrics of big graph sampling. IEEE Transactions on Visualization and Computer Graphics, 23(6), 1600-1611. [More Information]
• Eades, P., Hong, S., Nguyen, A., Klein, K. (2017). Shape-based quality metrics for large graph visualization. Journal of Graph Algorithms and Applications, 21(1), 29-53. [More Information]
• Nguyen, Q., Eades, P., Hong, S. (2017). Which graph layout gives a good shape for large graphs? 25th International Symposium on Graph Drawing & Network Visualization, Cham: Springer International Publishing.

2016

• Dekhordi, H., Eades, P., Hong, S., Nguyen, Q. (2016). Circular right-angle crossing drawings in linear time. Theoretical Computer Science, 639, 26-41. [More Information]
• Huang, W., Eades, P., Hong, S., Duh, H. (2016). Effects of curves on graph perception. 2016 IEEE Pacific Visualization Symposium (PacificVis), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., Di Battista, G., Eades, P., Kindermann, P., Kratochvil, J., Lipp, F., Rutter, I. (2016). Simultaneous orthogonal planarity. 24th International Symposium on Graph Drawing and Network Visualization (GD 2016), Cham: Springer. [More Information]

2015

• Hong, S., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2015). A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica, 72, 1033-1054. [More Information]
• Eades, P., Hong, S., Klein, K., NGUYEN, N. (2015). Shape-Based Quality Metrics for Large Graph Visualization. 23rd International Symposium on Graph Drawing & Network Visualization. Springer. [More Information]
• Eades, P., Hong, S., Liotta,, G., Katoh,, N., Poon,, S. (2015). Straight-line drawability of a planar graph plus an edge. 14th International Symposium, WADS Algorithms and Data Structures, : Springer Verlag.
• Eades, P., Hong, S., Liotta, G., Katoh, N., Poon, S. (2015). Straight-Line Drawability of a Planar Graph Plus an Edge. WADS 2015: Algorithms and Data Structures Symposium. Springer.

2014

• Di Giacomo, E., Didimo, W., Eades, P., Liotta, G. (2014). 2-Layer Right Angle Crossing Drawings. Algorithmica, 68(4), 954-997. [More Information]
• Marner, M., Smith, R., Thomas, B., Klein, K., Eades, P., Hong, S. (2014). GION: Interactively Untangling Large Graphs on Wall-Sized Displays. 22nd International Symposium on Graph Drawing (GD 2014), Berlin: Springer. [More Information]
• Huang, W., Eades, P., Hong, S. (2014). Larger crossing angles make graphs easier to read. Journal of Visual Languages and Computing, 25(4), 452-465. [More Information]
• Kim, J., Eades, P., Fleischer, R., Hong, S., Iliopoulos, C., Park, K., Puglisi, S., Tokuyama, T. (2014). Order-preserving matching. Theoretical Computer Science, 525, 68-79. [More Information]
• Chimani, M., Eades, P., Eades, P., Hong, S., Huang, W., Klein, K., Marner, M., Smith, R., Thomas, B. (2014). People prefer less stress and fewer crossings. Lecture Notes in Computer Science (LNCS), 8871, 523-524.

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: Institute of Electrical and Electronics Engineers (IEEE). [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]
• Dehkordi, H., Eades, P. (2012). Every Outer-1-Plane graph has a right angle crossing drawing. International Journal of Computational Geometry and Applications, 22(6), 543-557. [More Information]
• Hong, S., Eades, P., Liotta, G., Poon, S. (2012). Fary's theorem for 1-planar graphs. 18th Annual International Conference on Computing and Combinatorics (COCOON 2012), Berlin: Springer. [More Information]
• Eades, P., Liotta, G. (2012). Right Angle Crossing Graphs and 1-Planarity. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer. [More Information]
• 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. [More Information]
• 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. 18th International Symposium on Graph Drawing (GD 2010), Berlin: Springer. [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. [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: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Eades, P., Hong, S., Poon, S. (2010). On Rectilinear Drawing of Graphs. 17th International Symposium on Graph Drawing (GD 2009), Germany: Springer. [More Information]

2009

• Huang, W., Eades, P., Hong, S. (2009). A Graph Reading Geodesic-Path Tendency. IEEE Pacific Visualization Symposium - PacificVis 2009, United States: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Didimo, W., Eades, P., Liotta, G. (2009). Drawing Graphs with Right Angle Crossings. In Dehne, F; Gavrilova, M; Sack, J.R; Toth, C.D. (Eds.), Algorithms and Data Structures 11th International Symposium, WADS 2009 Banff, Canada, August 21-23, 2009 Proceedings, (pp. 206-217). Berlin Heidelberg: Springer. [More Information]
• Eades, P., Ertl, T., Shen, H. (2009). IEEE Pacific Visualization Symposium 2009: Proceedings. United States: Institute of Electrical and Electronics Engineers (IEEE).
• 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. [More Information]
• 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 (BELIV08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM). [More Information]
• Huang, W., Hong, S., Eades, P. (2008). Effects of Crossing Angles. IEEE Pacific Visualization Symposium 2008, United States: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Eades, P. (2008). Some Constrained Notions of Planarity. 19th International Symposium on Algorithms and Computation ISAAC 2008, Berlin: Springer. [More Information]
• 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 (BELIV08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM). [More Information]
• do Nascimento, H., Eades, P. (2008). User Hints for Map Labeling. Journal of Visual Languages and Computing, 19(1), 39-74. [More Information]

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. [More Information]
• 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, 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. [More Information]
• 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. [More Information]
• 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, 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: Institute of Electrical and Electronics Engineers (IEEE).

2005

• Li, W., Hong, S., Eades, P. (2005). A Framework for Visualising Large Graphs. Ninth International Conference on Information Visualisation (IV05), Piscataway NJ: Institute of Electrical and Electronics Engineers (IEEE). [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]
• 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). [More Information]
• Hong, S., Eades, P. (2005). Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica, 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). [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• do Nascimento, H., Eades, P. (2005). User hints: a framework for interactive optimization. Future Generation Computer Systems, 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: Theory and Applications, 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: Institute of Electrical and Electronics Engineers (IEEE).

2003

• Nagamochi, H., Eades, P. (2003). An edge-splitting algorithm in planar graphs. Journal of Combinatorial Optimization, 7(2), 137-159. [More Information]
• 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, 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. [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• 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. [More Information]
• 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. [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE).

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.