Peter Eades

Peter Eades, Giuseppe Liotta: Right angle crossing graphs and 1-planarity. Discrete Applied Mathematics 161(7-8): 961-969 (2013)

Hooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: Circular Graph Drawings with Large Crossing Angles. WALCOM 2013: 298-309

Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama: Order Preserving Matching. CoRR abs/1302.4064 (2013)

Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta: Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics 160(1-2): 132-139 (2012)

Hooman Reisi Dehkordi, Peter Eades: Every outer-1-Plane Graph has a Right Angle Crossing Drawing. Int. J. Comput. Geometry Appl. 22(6): 543-558 (2012)

Seok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon: Fáry's Theorem for 1-Planar Graphs. COCOON 2012: 335-346

Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki: Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). Graph Drawing 2012: 339-345

Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: StreamEB: Stream Edge Bundling. Graph Drawing 2012: 400-413

Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: On the Faithfulness of Graph Visualizations. Graph Drawing 2012: 566-568

Hui Liu, Peter Eades, Seok-Hee Hong: Visualizing dynamic trajectories in social networks. VL/HCC 2012: 197-204

Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39): 5156-5166 (2011)

Peter Eades, Seok-Hee Hong, Kazuo Misue: Kozo Sugiyama 1945 - 2011. Graph Drawing 2011: 1

Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades: TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. Graph Drawing 2011: 123-135

Peter Eades, Giuseppe Liotta: Right Angle Crossing Graphs and 1-Planarity. Graph Drawing 2011: 148-153

Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta: 2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169

Walter Didimo, Peter Eades, Giuseppe Liotta: A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16): 687-691 (2010)

Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang: Large Crossing Angles in Circular Layouts. Graph Drawing 2010: 397-399

Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin: Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. VL/HCC 2010: 176-183

Peter Eades, Weidong Huang, Seok-Hee Hong: A Force-Directed Method for Large Crossing Angle Graph Drawing. CoRR abs/1012.4559 (2010)

Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong: Issues for the Evaluation of Ambient Displays. IJACI 1(2): 59-69 (2009)

Weidong Huang, Peter Eades, Seok-Hee Hong: Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization 8(3): 139-152 (2009)

Weidong Huang, Peter Eades, Seok-Hee Hong: A graph reading behavior: Geodesic-path tendency. PacificVis 2009: 137-144

Peter Eades, Seok-Hee Hong, Sheung-Hung Poon: On Rectilinear Drawing of Graphs. Graph Drawing 2009: 232-243

Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217

Peter Eades, Thomas Ertl, Han-Wei Shen (Eds.): IEEE Pacific Visualization Symposium PacificVis 2009, Beijing, China, April 20-23, 2009. IEEE Computer Society 2009, isbn 978-1-4244-4404-5

Hugo A. D. do Nascimento, Peter Eades: User Hints for map labeling. J. Vis. Lang. Comput. 19(1): 39-74 (2008)

Weidong Huang, Seok-Hee Hong, Peter Eades: Effects of Crossing Angles. PacificVis 2008: 41-46

Weidong Huang, Peter Eades, Seok-Hee Hong: Beyond time and error: a cognitive approach to the evaluation of graph drawings. BELIV 2008: 3

Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong: The long-term evaluation of Fisherman in a partial-attention environment. BELIV 2008: 10

Peter Eades: Some Constrained Notions of Planarity. ISAAC 2008: 2

Peter Eades, Patrick Healy: Guest Editor's Foreword. J. Graph Algorithms Appl. 11(2): 323-324 (2007)

Weidong Huang, Seok-Hee Hong, Peter Eades: Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. J. Graph Algorithms Appl. 11(2): 397-429 (2007)

Christian Müller-Tomfelde, Belinda Kellar, Peter Eades: HxI : An Australian Initiative in ICT-Augmented Human Interactivity. INTERACT (2) 2007: 675-676

Xiaobin Shen, Peter Eades, Seok-Hee Hong, Andrew Vande Moere: Intrusive and Non-intrusive Evaluation of Ambient Displays. Ambient Information Systems 2007

Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica 44(1): 1-32 (2006)

Seok-Hee Hong, Peter Eades: Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Algorithmica 44(1): 67-100 (2006)

Seok-Hee Hong, Brendan D. McKay, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Discrete & Computational Geometry 36(2): 283-311 (2006)

Weidong Huang, Seok-Hee Hong, Peter Eades: How people read sociograms: a questionnaire study. APVIS 2006: 199-206

Weidong Huang, Seok-Hee Hong, Peter Eades: Predicting graph reading performance: a cognitive approach. APVIS 2006: 207-216

Fang Chen, Peter Eades, Julien Epps, Serge Lichman, Benjamin Close, Peter Hutterer, Masa Takatsuka, Bruce H. Thomas, Mike Wu: ViCAT: Visualisation and Interaction on a Collaborative Access Table. Tabletop 2006: 59-62

Seok-Hee Hong, Peter Eades: Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica 42(2): 159-197 (2005)

Hugo A. D. do Nascimento, Peter Eades: User hints: a framework for interactive optimization. Future Generation Comp. Syst. 21(7): 1171-1191 (2005)

Xiaodi Huang, Peter Eades, Wei Lai: A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization. ACSC 2005: 87-96

Adel Ahmed, Peter Eades: Automatic Camera Path Generation for Graph Navigation in 3D. APVIS 2005: 27-32

Lanbo Zheng, Le Song, Peter Eades: Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. APVIS 2005: 33-37

Weidong Huang, Peter Eades: How People Read Graphs. APVIS 2005: 51-58

Xiaobin Shen, Peter Eades: Using MoneyColor to Represent Financial Data. APVIS 2005: 125-129

Wanchun Li, Peter Eades, Nikola S. Nikolov: Using Spring Algorithms to Remove Node Overlapping. APVIS 2005: 131-140

Weidong Huang, Seok-Hee Hong, Peter Eades: Layout Effects on Sociogram Perception. Graph Drawing 2005: 262-273

Xiaobin Shen, Andrew Vande Moere, Peter Eades: An intrusive evaluation of peripheral display. GRAPHITE 2005: 289-292

Wanchun Li, Seok-Hee Hong, Peter Eades: A Framework for Visualising Large Graphs. IV 2005: 528-535

Wanchun Li, Peter Eades, Seok-Hee Hong: Navigating Software Architectures with Constant Visual Complexity. VL/HCC 2005: 225-232

Seok-Hee Hong, Peter Eades, Jonathan Hillman: Linkless symmetric drawings of series parallel digraphs. Comput. Geom. 29(3): 191-221 (2004)

Seok-Hee Hong, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Graph Drawing 2004: 307-317

Xiaobin Shen, Peter Eades: Using MoneyTree To Represent Financial Data. IV 2004: 285-289

Seok-Hee Hong, Peter Eades: Drawing Trees Symmetrically in Three Dimensions. Algorithmica 36(2): 153-178 (2003)

Graham Farr, Peter Eades: Skewness of Graphs with Small Cutsets. Graphs and Combinatorics 19(2): 177-194 (2003)

Mao Lin Huang, Peter Eades, Wei Lai: On-Line Visualization and Navigation of the Global Web Structure. International Journal of Software Engineering and Knowledge Engineering 13(1): 27-52 (2003)

Hiroshi Nagamochi, Peter Eades: An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim. 7(2): 137-159 (2003)

Xuemin Lin, Peter Eades: Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. 292(3): 679-695 (2003)

Hugo A. D. do Nascimento, Peter Eades: User Hints for Map Labelling. ACSC 2003: 339-347

Colin Murray, Carsten Friedrich, Peter Eades: HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. Graph Drawing 2003: 494-495

Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks: Graph Drawing Contest Report. Graph Drawing 2003: 504-508

Seok-Hee Hong, Peter Eades: Symmetric Layout of Disconnected Graphs. ISAAC 2003: 405-414

Peter Eades, Xiaobin Shen: MoneyTree: Ambient Information Visualization Of Financial Data. VIP 2003: 15-18

Jürgen Branke, Stefan Leppert, Martin Middendorf, Peter Eades: Width-restricted layering of acyclic digraphs with consideration of dummy nodes. Inf. Process. Lett. 81(2): 59-63 (2002)

Wei Lai, Peter Eades: Removing edge-node intersections in drawings of graphs. Inf. Process. Lett. 81(2): 105-110 (2002)

Carsten Friedrich, Peter Eades: Graph Drawing in Motion. J. Graph Algorithms Appl. 6(3): 353-370 (2002)

Ding-Zhu Du, Peter Eades, Xuemin Lin: Foreword. Theor. Comput. Sci. 289(2): 877 (2002)

Hugo A. D. do Nascimento, Peter Eades: A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing. HIS 2002: 634-643

Tim Dwyer, Peter Eades: Visualising a Fund Manager Flow Graph with Columns and Worms. IV 2002: 147-152

Seok-Hee Hong, Brendan D. McKay, Peter Eades: Symmetric drawings of triconnected planar graphs. SODA 2002: 356-365

Jesse S. Jin, Peter Eades, David Dagan Feng, Hong Yan (Eds.): Visualisation 2002, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2002. CRPIT 22, Australian Computer Society 2002, isbn 1-920682-01-5

Petra Mutzel, Peter Eades: Graphs in Software Visualization - Introduction. Software Visualization 2001: 285-294

Hugo A. D. do Nascimento, Peter Eades: User Hints for Directed Graph Drawing. Graph Drawing 2001: 205-219

Peter Eades, Tim Pattison (Eds.): Australasian Symposium on Information Visualisation, InVis.au, Sydney, Australia, 3-4 December 2001. CRPIT 9, Australian Computer Society 2001, isbn 0-909-92587-9

Peter Eades, Tadao Takaoka (Eds.): Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings. Lecture Notes in Computer Science 2223, Springer 2001, isbn 3-540-42985-9

Peter Eades, Jesse S. Jin (Eds.): Visualisation 2000, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2000. CRPIT 2, Australian Computer Society 2001, isbn 0-909-92580-1

David Dagan Feng, Jesse S. Jin, Peter Eades, Hong Yan (Eds.): Visualisation 2001, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2001. CRPIT 11, Australian Computer Society 2001, isbn 0-909-92589-5

Seok-Hee Hong, Peter Eades, Sang Ho Lee: Drawing series parallel digraphs symmetrically. Comput. Geom. 17(3-4): 165-188 (2000)

Peter Eades, Antonios Symvonis, Sue Whitesides: Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathematics 103(1-3): 55-87 (2000)

Peter Eades, Mao Lin Huang: Navigating Clustered Graphs Using Force-Directed Methods. J. Graph Algorithms Appl. 4(3): 157-181 (2000)

Peter Eades, Xuemin Lin: Spring algorithms and symmetry. Theor. Comput. Sci. 240(2): 379-405 (2000)

Hugo A. D. do Nascimento, Peter Eades, Candido Ferreira Xavier de Mendonça Neto: A Multi-agent Approach using A-Teams for Graph Drawing. ISCA Conference on Intelligent Systems 2000: 39-42

François Bertault, Peter Eades: Drawing Hypergraphs in the Subset Standard (Short Demo Paper). Graph Drawing 2000: 164-169

Aaron J. Quigley, Peter Eades: FADE: Graph Drawing, Clustering, and Visual Abstraction. Graph Drawing 2000: 197-210

Seok-Hee Hong, Peter Eades: An Algorithm for Finding Three Dimensional Symmetry in Trees. Graph Drawing 2000: 360-371

Carsten Friedrich, Peter Eades: The Marey Graph Animation Tool Demo. Graph Drawing 2000: 396-406

Seok-Hee Hong, Peter Eades: An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. ISAAC 2000: 266-277

François Bertault, Peter Eades: Graph Library Design. SCCC 2000: 144-151

Hugo A. D. do Nascimento, Peter Eades: A System for Graph Clustering Based on User Hints. VIP 2000: 73-74

Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma (Eds.): Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Lecture Notes in Computer Science 1858, Springer 2000, isbn 3-540-67787-9

Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall 1999, isbn 0-13-301615-3

Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi: Drawing Clustered Graphs on an Orthogonal Grid. J. Graph Algorithms Appl. 3(4): 3-29 (1999)

Xuemin Lin, Peter Eades: Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON 1999: 92-102

Mao Lin Huang, Peter Eades, Robert F. Cohen: WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping. Computer Networks 30(1-7): 638-642 (1998)

Mao Lin Huang, Peter Eades, Junhu Wang: On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm. J. Vis. Lang. Comput. 9(6): 623-645 (1998)

Wei Lai, Peter Eades: Routing Drawings in Diagram Displays. APCHI 1998: 291-297

Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee: Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. Graph Drawing 1998: 198-209

Mao Lin Huang, Peter Eades: A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. Graph Drawing 1998: 374-383

Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1998: 423-435

Hiroshi Nagamochi, Peter Eades: Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. IPCO 1998: 96-111

Seok-Hee Hong, Peter Eades, Sang Ho Lee: Finding Planar Geometric Automorphisms in Planar Graphs. ISAAC 1998: 277-286

Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997)

Peter Eades, Xuemin Lin: Spring Algorithms and Symmetry. COCOON 1997: 202-211

Peter Eades, Michael E. Houle, Richard Webber: Finding the Best Viewpoints for Three-Dimensional Graph Drawings. Graph Drawing 1997: 87-98

Peter Eades, Qing-Wen Feng: Drawing Clustered Graphs on an Orthogonal Grid. Graph Drawing 1997: 146-157

Xuemin Lin, Peter Eades: Area Requirements for Drawing Hierarchically Planar Graphs. Graph Drawing 1997: 219-229

Peter Eades, Robert F. Cohen, Mao Lin Huang: Online Animated Graph Drawing for Web Navigation. Graph Drawing 1997: 330-335

Peter Eades, Joe Marks, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1997: 438-445

Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. Algorithmica 16(1): 60-82 (1996)

Peter Eades, Xuemin Lin, Roberto Tamassia: An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geometry Appl. 6(2): 145-156 (1996)

Peter Eades, Charles Stirk, Sue Whitesides: The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. Inf. Process. Lett. 60(2): 97-103 (1996)

Peter Eades, M. Keil, Paul D. Manuel, Mirka Miller: Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nord. J. Comput. 3(3): 220-237 (1996)

Peter Eades, Sue Whitesides: The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. Theor. Comput. Sci. 169(1): 23-37 (1996)

Peter Eades, Qing-Wen Feng: Multilevel Visualization of Clustered Graphs. Graph Drawing 1996: 101-112

Peter Eades, Qing-Wen Feng, Xuemin Lin: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Graph Drawing 1996: 113-128

Peter Eades, Joe Marks, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1996: 129-138

Peter Eades, Antonios Symvonis, Sue Whitesides: Two Algorithms for Three Dimensional Orthogonal Graph Drawing. Graph Drawing 1996: 139-154

Peter Eades: Graph Drawing Methods. ICCS 1996: 40-49

Kazuo Misue, Peter Eades, Wei Lai, Kozo Sugiyama: Layout Adjustment and the Mental Map. J. Vis. Lang. Comput. 6(2): 183-210 (1995)

Isabel F. Cruz, Peter Eades: Guest editors' foreword. J. Vis. Lang. Comput. 6(3): 213-215 (1995)

Qing-Wen Feng, Robert F. Cohen, Peter Eades: How to Draw a Planar Clustered Graph. COCOON 1995: 21-30

Qing-Wen Feng, Robert F. Cohen, Peter Eades: Planarity for Clustered Graphs. ESA 1995: 213-226

Peter Eades, Candido Ferreira Xavier de Mendonça Neto: Vertex Splitting and Tension-Free Layout. Graph Drawing 1995: 202-211

Peter Eades, Patrick Garvan: Drawing Stressed Planar Graphs in Three Dimensions. Graph Drawing 1995: 212-223

Peter Eades, Joe Marks: Graph-Drawing Contest Report. Graph Drawing 1995: 224-233

Peter Eades, Sue Whitesides: Nearest Neighbour Graph Realizability is NP-hard. LATIN 1995: 245-256

John Staples, Peter Eades, Naoki Katoh, Alistair Moffat (Eds.): Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings. Lecture Notes in Computer Science 1004, Springer 1995, isbn 3-540-60573-8

Peter Eades, Nicholas C. Wormald: Edge Crossings in Drawings of Bipartite Graphs. Algorithmica 11(4): 379-403 (1994)

Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. 4: 235-282 (1994)

Peter Eades, Sue Whitesides: Drawing Graphs in Two Layers. Theor. Comput. Sci. 131(2): 361-374 (1994)

Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Volume upper bounds for 3D graph drawing. CASCON 1994: 11

Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. Symposium on Computational Geometry 1994: 49-56

Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Graph Drawing 1994: 1-11

Peter Eades, Joe Marks: Graph Drawing Contest Report. Graph Drawing 1994: 143-146

Tao Lin, Peter Eades: Integration of Declarative and Algorithmic Approaches for Layout Creation. Graph Drawing 1994: 376-387

Peter Eades, Xuemin Lin, Nicholas C. Wormald: Performance Guarantees for Motion Planning with Temporal Uncertainty. Australian Computer Journal 25(1): 21-28 (1993)

Peter Eades, Tao Lin, Xuemin Lin: Two Tree Drawing Conventions. Int. J. Comput. Geometry Appl. 3(2): 133-153 (1993)

Peter Eades, Xuemin Lin, W. F. Smyth: A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47(6): 319-323 (1993)

Peter Eades, David Rappaport: The complexity of computing minimum separating polygons. Pattern Recognition Letters 14(9): 715-718 (1993)

Peter Eades, Tao Lin, Xuemin Lin: Minimum Size h-v Drawings. Advanced Visual Interfaces 1992: 386-394

Peter Eades, Nicholas C. Wormald: Fixed edge-length graph drawing is NP-hard. Discrete Applied Mathematics 28(2): 111-134 (1990)

Peter Eades, Brendan D. McKay: An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property. Inf. Process. Lett. 19(3): 131-133 (1984)

Peter Eades, Michael Hickey, Ronald C. Read: Some Hamilton Paths and a Minimal Change Algorithm. J. ACM 31(1): 19-29 (1984)

Peter Eades, John Staples: On Optimal Trees. J. Algorithms 2(4): 369-384 (1981)