| 2008 |
|---|
| 116 | EE | Xiaobin Shen,
Andrew Vande Moere,
Peter Eades,
Seok-Hee Hong:
The long-term evaluation of Fisherman in a partial-attention environment.
BELIV 2008: 10 |
| 115 | EE | Weidong Huang,
Peter Eades,
Seok-Hee Hong:
Beyond time and error: a cognitive approach to the evaluation of graph drawings.
BELIV 2008: 3 |
| 114 | EE | Weidong Huang,
Seok-Hee Hong,
Peter Eades:
Effects of Crossing Angles.
PacificVis 2008: 41-46 |
| 113 | EE | Hugo A. D. do Nascimento,
Peter Eades:
User Hints for map labeling.
J. Vis. Lang. Comput. 19(1): 39-74 (2008) |
| 2007 |
|---|
| 112 | EE | Xiaobin Shen,
Peter Eades,
Seok-Hee Hong,
Andrew Vande Moere:
Intrusive and Non-intrusive Evaluation of Ambient Displays.
Ambient Information Systems 2007 |
| 111 | EE | Christian Müller-Tomfelde,
Belinda Kellar,
Peter Eades:
HxI : An Australian Initiative in ICT-Augmented Human Interactivity.
INTERACT (2) 2007: 675-676 |
| 2006 |
|---|
| 110 | EE | Weidong Huang,
Seok-Hee Hong,
Peter Eades:
How people read sociograms: a questionnaire study.
APVIS 2006: 199-206 |
| 109 | EE | Weidong Huang,
Seok-Hee Hong,
Peter Eades:
Predicting graph reading performance: a cognitive approach.
APVIS 2006: 207-216 |
| 108 | EE | 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 |
| 107 | EE | 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) |
| 106 | EE | Seok-Hee Hong,
Peter Eades:
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs.
Algorithmica 44(1): 67-100 (2006) |
| 105 | EE | 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) |
| 2005 |
|---|
| 104 | EE | Xiaodi Huang,
Peter Eades,
Wei Lai:
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization.
ACSC 2005: 87-96 |
| 103 | EE | Xiaobin Shen,
Peter Eades:
Using MoneyColor to Represent Financial Data.
APVIS 2005: 125-129 |
| 102 | EE | Wanchun Li,
Peter Eades,
Nikola S. Nikolov:
Using Spring Algorithms to Remove Node Overlapping.
APVIS 2005: 131-140 |
| 101 | EE | Adel Ahmed,
Peter Eades:
Automatic Camera Path Generation for Graph Navigation in 3D.
APVIS 2005: 27-32 |
| 100 | EE | Lanbo Zheng,
Le Song,
Peter Eades:
Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters.
APVIS 2005: 33-37 |
| 99 | EE | Weidong Huang,
Peter Eades:
How People Read Graphs.
APVIS 2005: 51-58 |
| 98 | EE | Xiaobin Shen,
Andrew Vande Moere,
Peter Eades:
An intrusive evaluation of peripheral display.
GRAPHITE 2005: 289-292 |
| 97 | EE | Weidong Huang,
Seok-Hee Hong,
Peter Eades:
Layout Effects on Sociogram Perception.
Graph Drawing 2005: 262-273 |
| 96 | EE | Wanchun Li,
Seok-Hee Hong,
Peter Eades:
A Framework for Visualising Large Graphs.
IV 2005: 528-535 |
| 95 | EE | Wanchun Li,
Peter Eades,
Seok-Hee Hong:
Navigating Software Architectures with Constant Visual Complexity.
VL/HCC 2005: 225-232 |
| 94 | EE | Seok-Hee Hong,
Peter Eades:
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs.
Algorithmica 42(2): 159-197 (2005) |
| 93 | EE | Hugo A. D. do Nascimento,
Peter Eades:
User hints: a framework for interactive optimization.
Future Generation Comp. Syst. 21(7): 1171-1191 (2005) |
| 2004 |
|---|
| 92 | EE | Seok-Hee Hong,
Peter Eades:
A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs.
Graph Drawing 2004: 307-317 |
| 91 | EE | Xiaobin Shen,
Peter Eades:
Using MoneyTree To Represent Financial Data.
IV 2004: 285-289 |
| 90 | EE | Seok-Hee Hong,
Peter Eades,
Jonathan Hillman:
Linkless symmetric drawings of series parallel digraphs.
Comput. Geom. 29(3): 191-221 (2004) |
| 2003 |
|---|
| 89 | EE | Hugo A. D. do Nascimento,
Peter Eades:
User Hints for Map Labelling.
ACSC 2003: 339-347 |
| 88 | EE | Colin Murray,
Carsten Friedrich,
Peter Eades:
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex.
Graph Drawing 2003: 494-495 |
| 87 | EE | Franz-Josef Brandenburg,
Ulrik Brandes,
Peter Eades,
Joe Marks:
Graph Drawing Contest Report.
Graph Drawing 2003: 504-508 |
| 86 | EE | Seok-Hee Hong,
Peter Eades:
Symmetric Layout of Disconnected Graphs.
ISAAC 2003: 405-414 |
| 85 | EE | Peter Eades,
Xiaobin Shen:
MoneyTree: Ambient Information Visualization Of Financial Data.
VIP 2003: 15-18 |
| 84 | EE | Seok-Hee Hong,
Peter Eades:
Drawing Trees Symmetrically in Three Dimensions.
Algorithmica 36(2): 153-178 (2003) |
| 83 | EE | Graham Farr,
Peter Eades:
Skewness of Graphs with Small Cutsets.
Graphs and Combinatorics 19(2): 177-194 (2003) |
| 82 | EE | 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) |
| 81 | EE | Hiroshi Nagamochi,
Peter Eades:
An Edge-Splitting Algorithm in Planar Graphs.
J. Comb. Optim. 7(2): 137-159 (2003) |
| 80 | | Xuemin Lin,
Peter Eades:
Towards area requirements for drawing hierarchically planar graphs.
Theor. Comput. Sci. 292(3): 679-695 (2003) |
| 2002 |
|---|
| 79 | | Jesse S. Jin,
Peter Eades,
David Dagan Feng,
Hong Yan:
Visualisation 2002, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2002
Australian Computer Society 2002 |
| 78 | | Hugo A. D. do Nascimento,
Peter Eades:
A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing.
HIS 2002: 634-643 |
| 77 | EE | Tim Dwyer,
Peter Eades:
Visualising a Fund Manager Flow Graph with Columns and Worms.
IV 2002: 147-152 |
| 76 | EE | Seok-Hee Hong,
Brendan D. McKay,
Peter Eades:
Symmetric drawings of triconnected planar graphs.
SODA 2002: 356-365 |
| 75 | EE | Wei Lai,
Peter Eades:
Removing edge-node intersections in drawings of graphs.
Inf. Process. Lett. 81(2): 105-110 (2002) |
| 74 | EE | 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) |
| 73 | EE | Carsten Friedrich,
Peter Eades:
Graph Drawing in Motion.
J. Graph Algorithms Appl. 6(3): 353-370 (2002) |
| 72 | | Ding-Zhu Du,
Peter Eades,
Xuemin Lin:
Foreword.
Theor. Comput. Sci. 289(2): 877 (2002) |
| 2001 |
|---|
| 71 | | David Dagan Feng,
Jesse S. Jin,
Peter Eades,
Hong Yan:
Visualisation 2001, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2001
Australian Computer Society 2001 |
| 70 | | Peter Eades,
Jesse S. Jin:
Visualisation 2000, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2000
Australian Computer Society 2001 |
| 69 | | Peter Eades,
Tim Pattison:
Australasian Symposium on Information Visualisation, InVis.au, Sydney, Australia, 3-4 December 2001
Australian Computer Society 2001 |
| 68 | | Peter Eades,
Tadao Takaoka:
Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings
Springer 2001 |
| 67 | EE | Hugo A. D. do Nascimento,
Peter Eades:
User Hints for Directed Graph Drawing.
Graph Drawing 2001: 205-219 |
| 66 | EE | Petra Mutzel,
Peter Eades:
Graphs in Software Visualization - Introduction.
Software Visualization 2001: 285-294 |
| 2000 |
|---|
| 65 | | Ding-Zhu Du,
Peter Eades,
Vladimir Estivill-Castro,
Xuemin Lin,
Arun Sharma:
Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings
Springer 2000 |
| 64 | EE | François Bertault,
Peter Eades:
Drawing Hypergraphs in the Subset Standard (Short Demo Paper).
Graph Drawing 2000: 164-169 |
| 63 | EE | Aaron J. Quigley,
Peter Eades:
FADE: Graph Drawing, Clustering, and Visual Abstraction.
Graph Drawing 2000: 197-210 |
| 62 | EE | Seok-Hee Hong,
Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Trees.
Graph Drawing 2000: 360-371 |
| 61 | EE | Carsten Friedrich,
Peter Eades:
The Marey Graph Animation Tool Demo.
Graph Drawing 2000: 396-406 |
| 60 | EE | Seok-Hee Hong,
Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs.
ISAAC 2000: 266-277 |
| 59 | EE | François Bertault,
Peter Eades:
Graph Library Design.
SCCC 2000: 144-151 |
| 58 | EE | Hugo A. D. do Nascimento,
Peter Eades:
A System for Graph Clustering Based on User Hints.
VIP 2000: 73-74 |
| 57 | | Seok-Hee Hong,
Peter Eades,
Sang Ho Lee:
Drawing series parallel digraphs symmetrically.
Comput. Geom. 17(3-4): 165-188 (2000) |
| 56 | | Peter Eades,
Antonios Symvonis,
Sue Whitesides:
Three-dimensional orthogonal graph drawing algorithms.
Discrete Applied Mathematics 103(1-3): 55-87 (2000) |
| 55 | EE | Peter Eades,
Mao Lin Huang:
Navigating Clustered Graphs Using Force-Directed Methods.
J. Graph Algorithms Appl. 4(3): 157-181 (2000) |
| 54 | EE | Peter Eades,
Xuemin Lin:
Spring algorithms and symmetry.
Theor. Comput. Sci. 240(2): 379-405 (2000) |
| 1999 |
|---|
| 53 | | Giuseppe Di Battista,
Peter Eades,
Roberto Tamassia,
Ioannis G. Tollis:
Graph Drawing: Algorithms for the Visualization of Graphs
Prentice-Hall 1999 |
| 52 | EE | Xuemin Lin,
Peter Eades:
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs.
COCOON 1999: 92-102 |
| 51 | EE | Peter Eades,
Qing-Wen Feng,
Hiroshi Nagamochi:
Drawing Clustered Graphs on an Orthogonal Grid.
J. Graph Algorithms Appl. 3(4): 3-29 (1999) |
| 1998 |
|---|
| 50 | EE | Wei Lai,
Peter Eades:
Routing Drawings in Diagram Displays.
APCHI 1998: 291-297 |
| 49 | EE | 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 |
| 48 | EE | Mao Lin Huang,
Peter Eades:
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs.
Graph Drawing 1998: 374-383 |
| 47 | EE | Peter Eades,
Joe Marks,
Petra Mutzel,
Stephen C. North:
Graph-Drawing Contest Report.
Graph Drawing 1998: 423-435 |
| 46 | EE | Hiroshi Nagamochi,
Peter Eades:
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs.
IPCO 1998: 96-111 |
| 45 | EE | Seok-Hee Hong,
Peter Eades,
Sang Ho Lee:
Finding Planar Geometric Automorphisms in Planar Graphs.
ISAAC 1998: 277-286 |
| 44 | EE | 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) |
| 43 | | 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) |
| 1997 |
|---|
| 42 | | Peter Eades,
Xuemin Lin:
Spring Algorithms and Symmetry.
COCOON 1997: 202-211 |
| 41 | | Peter Eades,
Qing-Wen Feng:
Drawing Clustered Graphs on an Orthogonal Grid.
Graph Drawing 1997: 146-157 |
| 40 | | Xuemin Lin,
Peter Eades:
Area Requirements for Drawing Hierarchically Planar Graphs.
Graph Drawing 1997: 219-229 |
| 39 | | Peter Eades,
Robert F. Cohen,
Mao Lin Huang:
Online Animated Graph Drawing for Web Navigation.
Graph Drawing 1997: 330-335 |
| 38 | | Peter Eades,
Joe Marks,
Stephen C. North:
Graph-Drawing Contest Report.
Graph Drawing 1997: 438-445 |
| 37 | | Peter Eades,
Michael E. Houle,
Richard Webber:
Finding the Best Viewpoints for Three-Dimensional Graph Drawings.
Graph Drawing 1997: 87-98 |
| 36 | | Robert F. Cohen,
Peter Eades,
Tao Lin,
Frank Ruskey:
Three-Dimensional Graph Drawing.
Algorithmica 17(2): 199-208 (1997) |
| 1996 |
|---|
| 35 | | Peter Eades,
Qing-Wen Feng:
Multilevel Visualization of Clustered Graphs.
Graph Drawing 1996: 101-112 |
| 34 | | Peter Eades,
Qing-Wen Feng,
Xuemin Lin:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.
Graph Drawing 1996: 113-128 |
| 33 | | Peter Eades,
Joe Marks,
Stephen C. North:
Graph-Drawing Contest Report.
Graph Drawing 1996: 129-138 |
| 32 | | Peter Eades,
Antonios Symvonis,
Sue Whitesides:
Two Algorithms for Three Dimensional Orthogonal Graph Drawing.
Graph Drawing 1996: 139-154 |
| 31 | | Peter Eades:
Graph Drawing Methods.
ICCS 1996: 40-49 |
| 30 | | Peter Eades,
Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard.
Algorithmica 16(1): 60-82 (1996) |
| 29 | EE | 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) |
| 28 | | Peter Eades,
Xuemin Lin,
Roberto Tamassia:
An Algorithm for Drawing a Hierarchical Graph.
Int. J. Comput. Geometry Appl. 6(2): 145-156 (1996) |
| 27 | | 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) |
| 26 | EE | Peter Eades,
Sue Whitesides:
The Logic Engine and the Realization Problem for Nearest Neighbor Graphs.
Theor. Comput. Sci. 169(1): 23-37 (1996) |
| 1995 |
|---|
| 25 | | John Staples,
Peter Eades,
Naoki Katoh,
Alistair Moffat:
Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings
Springer 1995 |
| 24 | | Qing-Wen Feng,
Robert F. Cohen,
Peter Eades:
How to Draw a Planar Clustered Graph.
COCOON 1995: 21-30 |
| 23 | | Qing-Wen Feng,
Robert F. Cohen,
Peter Eades:
Planarity for Clustered Graphs.
ESA 1995: 213-226 |
| 22 | | Peter Eades,
Candido Ferreira Xavier de Mendonça Neto:
Vertex Splitting and Tension-Free Layout
Graph Drawing 1995: 202-211 |
| 21 | | Peter Eades,
Patrick Garvan:
Drawing Stressed Planar Graphs in Three Dimensions.
Graph Drawing 1995: 212-223 |
| 20 | | Peter Eades,
Joe Marks:
Graph-Drawing Contest Report.
Graph Drawing 1995: 224-233 |
| 19 | | Peter Eades,
Sue Whitesides:
Nearest Neighbour Graph Realizability is NP-hard.
LATIN 1995: 245-256 |
| 18 | | Kazuo Misue,
Peter Eades,
Wei Lai,
Kozo Sugiyama:
Layout Adjustment and the Mental Map.
J. Vis. Lang. Comput. 6(2): 183-210 (1995) |
| 17 | | Isabel F. Cruz,
Peter Eades:
Guest editors' foreword.
J. Vis. Lang. Comput. 6(3): 213-215 (1995) |
| 1994 |
|---|
| 16 | EE | Robert F. Cohen,
Peter Eades,
Tao Lin,
Frank Ruskey:
Volume upper bounds for 3D graph drawing.
CASCON 1994: 11 |
| 15 | | Robert F. Cohen,
Peter Eades,
Tao Lin,
Frank Ruskey:
Three-Dimensional Graph Drawing.
Graph Drawing 1994: 1-11 |
| 14 | | Peter Eades,
Joe Marks:
Graph Drawing Contest Report.
Graph Drawing 1994: 143-146 |
| 13 | | Tao Lin,
Peter Eades:
Integration of Declarative and Algorithmic Approaches for Layout Creation.
Graph Drawing 1994: 376-387 |
| 12 | EE | Peter Eades,
Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.
Symposium on Computational Geometry 1994: 49-56 |
| 11 | | Peter Eades,
Nicholas C. Wormald:
Edge Crossings in Drawings of Bipartite Graphs.
Algorithmica 11(4): 379-403 (1994) |
| 10 | | Giuseppe Di Battista,
Peter Eades,
Roberto Tamassia,
Ioannis G. Tollis:
Algorithms for Drawing Graphs: an Annotated Bibliography.
Comput. Geom. 4: 235-282 (1994) |
| 9 | | Peter Eades,
Sue Whitesides:
Drawing Graphs in Two Layers.
Theor. Comput. Sci. 131(2): 361-374 (1994) |
| 1993 |
|---|
| 8 | | Peter Eades,
Xuemin Lin,
Nicholas C. Wormald:
Performance Guarantees for Motion Planning with Temporal Uncertainty.
Australian Computer Journal 25(1): 21-28 (1993) |
| 7 | | 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) |
| 6 | | Peter Eades,
Tao Lin,
Xuemin Lin:
Two Tree Drawing Conventions.
Int. J. Comput. Geometry Appl. 3(2): 133-153 (1993) |
| 5 | EE | Peter Eades,
David Rappaport:
The complexity of computing minimum separating polygons.
Pattern Recognition Letters 14(9): 715-718 (1993) |
| 1992 |
|---|
| 4 | | Peter Eades,
Tao Lin,
Xuemin Lin:
Minimum Size h-v Drawings.
Advanced Visual Interfaces 1992: 386-394 |
| 1984 |
|---|
| 3 | | 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) |
| 2 | EE | Peter Eades,
Michael Hickey,
Ronald C. Read:
Some Hamilton Paths and a Minimal Change Algorithm.
J. ACM 31(1): 19-29 (1984) |
| 1981 |
|---|
| 1 | | Peter Eades,
John Staples:
On Optimal Trees.
J. Algorithms 2(4): 369-384 (1981) |
