Peter Eades

Q: What Schools Are Affiliated With Peter Eades

Peter Eades is affiliated with the following schools: University of Queensland, University of Sydney, University of Newcastle , University of Technology Sydney, Australian National University

Peter Eades's AcademicInfluence.com Rankings

Peter Eades

Computer Science

#1058

World Rank

#1096

Historical Rank

Database

#2055

World Rank

#2159

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Peter Eades Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Peter D. Eades is an Australian computer scientist, an emeritus professor in the School of Information Technologies at the University of Sydney, known for his expertise in graph drawing. Eades received his bachelor's degree in mathematics from Australian National University in 1974, and his Ph.D. in mathematics from the same university in 1977 under the supervision of Jennifer Seberry. He then did postdoctoral studies at the University of Waterloo before taking an academic position at the University of Queensland, where he remained until 1991. He was a professor of computer science at the University of Newcastle from 1992 to 1999, and joined the University of Sydney faculty in 2000. As well as his faculty position at Sydney, Eades was also a distinguished researcher at NICTA.

(See a Problem?)

Peter Eades's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A Heuristic for Graph Drawing (1984) (1454)
Algorithms for Drawing Graphs: an Annotated Bibliography (1988) (1043)
Layout Adjustment and the Mental Map (1995) (645)
Multilevel Visualization of Clustered Graphs (1996) (263)
Edge crossings in drawings of bipartite graphs (1994) (233)
How to draw a directed graph (1989) (221)
A Fast and Effective Heuristic for the Feedback Arc Set Problem (1993) (205)
FADE: Graph Drawing, Clustering, and Visual Abstraction (2000) (202)
Measuring Effectiveness of Graph Visualizations: A Cognitive Load Perspective (2009) (191)
On Optimal Trees (1981) (185)
Navigating Clustered Graphs Using Force-Directed Methods (2000) (181)
Planarity for Clustered Graphs (1995) (163)
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs (1996) (149)
Drawing graphs with right angle crossings (2009) (139)
Effects of Crossing Angles (2008) (122)
An Algorithm for Drawing General Undirected Graphs (1984) (121)
A Heuristics for Graph Drawing (1984) (120)
On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm (1998) (112)
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs (1998) (100)
Graph Drawing in Motion (2002) (96)
Drawing Graphs in Two Layers (1994) (94)
How to Draw a Planar Clustered Graph (1995) (92)
Spring algorithms and symmetry (1997) (90)
Order Preserving Matching (2013) (89)
On an edge crossing problem (1986) (87)
Right angle crossing graphs and 1-planarity (2011) (80)
How People Read Graphs (2005) (75)
Fáry's Theorem for 1-Planar Graphs (2012) (75)
The realization problem for Euclidean minimum spanning trees is NP-hard (1994) (68)
An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property (1984) (66)
A graph reading behavior: Geodesic-path tendency (2009) (65)
Drawing Clustered Graphs on an Orthogonal Grid (1997) (64)
Algorithms and Computations (1995) (63)
Using Spring Algorithms to Remove Node Overlapping (2005) (61)
Beyond time and error: a cognitive approach to the evaluation of graph drawings (2008) (60)
Fixed edge-length graph drawing is NP-hard (1990) (59)
Visualising a fund manager flow graph with columns and worms (2002) (58)
Shape-Based Quality Metrics for Large Graph Visualization (2015) (58)
Improving multiple aesthetics produces better graph drawings (2013) (57)
WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping (1998) (56)
Learning via Hilbert Space Embedding of Distributions (2007) (55)
Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization (2007) (53)
Larger crossing angles make graphs easier to read (2014) (53)
Three-dimensional orthogonal graph drawing algorithms (2000) (52)
A Linear-Time Algorithm for Testing Outer-1-Planarity (2013) (51)
Layout Effects on Sociogram Perception (2005) (51)
An efficient heuristic for identifying a maximum weight planar subgraph (1982) (49)
Information Display (2006) (49)
The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings (1996) (48)
Online Animated Graph Drawing for Web Navigation (1997) (47)
On the faithfulness of graph visualizations (2012) (46)
Two Algorithms for Three Dimensional Orthogonal Graph Drawing (1996) (46)
Finding the Best Viewpoints for Three-Dimensional Graph Drawings (1997) (45)
Two Tree Drawing Conventions (1993) (45)
An Algorithm for Drawing a Hierarchical Graph (1996) (45)
Some Hamilton Paths and a Minimal Change Algorithm (1984) (44)
User Hints for Map Labelling (2003) (44)
Drawing Stressed Planar Graphs in Three Dimensions (1995) (37)
Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics (2010) (36)
Integration of Declarative and Algorithmic Approaches for Layout Creation (1994) (36)
Symmetry Finding Algorithms (1988) (36)
Predicting graph reading performance: a cognitive approach (2006) (35)
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (2013) (35)
2-Layer Right Angle Crossing Drawings (2011) (34)
How people read sociograms: a questionnaire study (2006) (33)
Minimum Size h-v Drawings (1992) (33)
An Evolutionary Algorithm for Drawing Directed Graphs (1998) (33)
Vertex Splitting and Tension-Free Layout (1995) (33)
The Marey Graph Animation Tool Demo (2000) (32)
Every outer-1-Plane Graph has a Right Angle Crossing Drawing (2012) (31)
A characterization of complete bipartite RAC graphs (2010) (31)
Graph Drawing Algorithms (1999) (31)
A heuristic for the feedback arc set problem (1995) (30)
Gap-Planar Graphs (2017) (30)
Online Animated Graph Drawing using a Modified Spring Algorithm (1997) (30)
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization (2005) (30)
The Logic Engine and the Realization Problem for Nearest Neighbor Graphs (1996) (29)
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions (1998) (29)
Removing edge-node intersections in drawings of graphs (2002) (28)
Drawing series parallel digraphs symmetrically (2000) (27)
User Hints for Directed Graph Drawing (2001) (27)
StreamEB: Stream Edge Bundling (2012) (26)
ViCAT: visualisation and interaction on a collaborative access table (2006) (25)
TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance (2011) (25)
A Force-Directed Method for Large Crossing Angle Graph Drawing (2010) (25)
Drawing Hypergraphs in the Subset Standard (2000) (24)
Performance Guarantees for Motion Planning with Temporal Uncertainty (1993) (22)
Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters (2005) (21)
Symmetric drawings of triconnected planar graphs (2002) (21)
Proxy Graph: Visual Quality Metrics of Big Graph Sampling (2017) (21)
The complexity of computing minimum separating polygons (1993) (21)
Layout Effects: Comparison of Sociogram Drawing Conventions (2006) (20)
Three-dimensional graph drawing (1994) (19)
Spatial augmented reality — A tool for 3D data visualization (2014) (18)
A Study of Mental Maps in Immersive Network Visualization (2020) (17)
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs (2000) (17)
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs (2004) (17)
User hints: a framework for interactive optimization (2005) (17)
The long-term evaluation of Fisherman in a partial-attention environment (2008) (17)
Automatic Camera Path Generation for Graph Navigation in 3D (2005) (17)
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract) (2012) (17)
An Algorithm for Finding Three Dimensional Symmetry in Trees (2000) (16)
A FAST EFFECTIVE HEURISTIC FOR THE FEEDBACK ARC SET PROBLEM (1993) (16)
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs (2005) (16)
Finding Planar Geometric Automorphisms in Planar Graphs (1998) (16)
A lower-bound for the number of productions required for a certain class of languages (1983) (15)
An intrusive evaluation of peripheral display (2005) (15)
On the existence of orthogonal designs (1978) (15)
Drawing Hypergraphs in the Subset Standard (Short Demo Paper) (2000) (14)
Drawing Trees Symmetrically in Three Dimensions (2003) (14)
GION: Interactively Untangling Large Graphs on Wall-Sized Displays (2014) (14)
Large Crossing Angles in Circular Layouts (2010) (13)
Nearest Neighbour Graph Realizability is NP-hard (1995) (13)
An infinite family of skew-weighing matrices (1976) (13)
Width-restricted layering of acyclic digraphs with consideration of dummy nodes (2002) (13)
Symmetric Layout of Disconnected Graphs (2003) (12)
Issues for the Evaluation of Ambient Displays (2009) (12)
Intrusive and Non-intrusive Evaluation of Ambient Displays (2007) (12)
Navigating software architectures with constant visual complexity (2005) (12)
Bounds on the crossing resolution of complete geometric graphs (2012) (12)
Visual Interface Design for Relational Systems (1990) (12)
Using MoneyColor to Represent Financial Data (2005) (12)
Turning Cliques into Paths to Achieve Planarity (2018) (11)
A Graph Model which Supports Flexible Layout (1996) (11)
Drawing Big Graphs Using Spectral Sparsification (2017) (11)
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs (1998) (11)
Towards area requirements for drawing hierarchically planar graphs (2003) (11)
Towards Faithful Graph Visualizations (2017) (10)
Graph-Drawing Contest Report (1994) (10)
Circular right-angle crossing drawings in linear time (2016) (10)
BC Tree-Based Proxy Graphs for Visualization of Big Graphs (2018) (10)
Straight-Line Drawability of a Planar Graph Plus an Edge (2015) (9)
On-Line Visualization and Navigation of the Global Web Structure (2003) (9)
People Prefer Less Stress and Fewer Crossings (2014) (9)
Circulant (v,k,μ) designs (1980) (9)
Simultaneous Orthogonal Planarity (2016) (9)
A Quality Metric for Visualization of Clusters in Graphs (2019) (9)
On Rectilinear Drawing of Graphs (2009) (9)
People Prefer Less Stress and Fewer Crossings (2014) (9)
MoneyTree: Ambient Information Visualization Of Financial Data (2004) (8)
A System for Graph Clustering Based on User Hints (2000) (8)
A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs (2006) (8)
Effects of curves on graph perception (2016) (8)
Using MoneyTree to represent financial data (2004) (7)
BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure (2019) (7)
The pleasures of entomology : portraits of insects and the people who study them (1985) (7)
Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs (1996) (7)
A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing (2002) (7)
Quality Metrics for Symmetric Graph Drawings * (2020) (6)
Linkless symmetric drawings of series parallel digraphs (2004) (6)
On-line algorithms for cardinality constrained bin packing problems (2001) (6)
Graph Drawing Methods (1996) (6)
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs (1999) (6)
Symmetric Graph Drawing (2013) (6)
Topology-Based Spectral Sparsification (2019) (6)
Volume upper bounds for 3D graph drawing (1994) (6)
Orthogonal Grid Drawing of Clustered Graphs (1996) (5)
Multi-level Graph Drawing using Infomap Clustering (2019) (5)
A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs (2004) (5)
Graphs in Software Visualization - Introduction (2001) (5)
Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001 : proceedings (2001) (5)
Circular Graph Drawings with Large Crossing Angles (2013) (5)
Smooth structural zooming of h-v inclusion tree layouts (2003) (5)
Graph Planarity by Replacing Cliques with Paths (2020) (5)
A framework for visualising large graphs (2005) (4)
New Quality Metrics for Dynamic Graph Drawing (2020) (4)
dNNG: Quality metrics and layout for neighbourhood faithfulness (2017) (4)
An Edge-Splitting Algorithm in Planar Graphs (2003) (4)
Area Requirements for Drawing Hierarchically Planar Graphs (1997) (4)
Sublinear Time Force Computation for Big Complex Network Visualization (2020) (4)
A Multi-agent Approach using A-Teams for Graph Drawing (2000) (3)
Visualizing dynamic trajectories in social networks (2012) (3)
Dynamic Graph Map Animation (2020) (3)
PROVEDA: A scheme for Progressive Visualization and Exploratory Data Analysis of clusters (1999) (3)
Performance of Subset Generating Algorithms (1985) (3)
Skewness of Graphs with Small Cutsets (2003) (3)
Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001) (3)
Spectral Vertex Sampling for Big Complex Graphs (2019) (3)
STRUCTURAL MODELING OF FLOWCHARTS (1996) (3)
Chapter 4 Graphs in Software Visualization (2002) (2)
A note on asymptotic existence results for orthogonal designs (1977) (2)
Straight-line Drawings of 1-planar Graphs (2011) (2)
A Quality Metric for Symmetric Graph Drawings (2019) (2)
BC tree-based spectral sampling for big complex network visualization (2021) (2)
How to Draw a Graph, Revisited (2012) (2)
The Weighted Barycenter Drawing Recognition Problem (2018) (2)
Polyline Drawings with Topological Constraints (2018) (2)
Guest editors' foreword (1995) (2)
Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2000) (2)
Some remarks on the permanents of circulant (0,1) matrices (1982) (2)
Regularity and optimality for trees (1981) (2)
Some asymptotic results for orthogonal designs: II (1976) (2)
Software Visualization (1996) (2)
Graph Visualization (2018) (2)
2-Layer Right Angle Crossing Drawings (2012) (1)
Routing drawings in diagram displays (1998) (1)
Graph library design (2000) (1)
Algorithms for drawing trees (abstract) (1993) (1)
Connectivity-Based Spectral Sampling for Big Complex Network Visualization (2020) (1)
BJR-Tree: Fast Skyline Computation Algorithm for Serendipitous Searching Problems (2017) (1)
An algorithm for orthogonal designs (1975) (1)
Proceedings of the 12th International Symposium on Algorithms and Computation (1995) (1)
Three-Dimensional Graph Drawing 1 (1997) (1)
Flowchart Components for Program Visualization (2003) (1)
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex (2003) (1)
Some Constrained Notions of Planarity (2008) (1)
What is a good diagram? (Revisited) (2014) (1)
GDot: Drawing Graphs with Dots and Circles (2021) (1)
Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing (2021) (1)
Integral quadratic forms and orthogonal designs (1981) (1)
Stress Echo Image Acquisition Quality is Dramatically Improved by a Novel Image Audit Program (2016) (0)
Automorphism Faithfulness Metrics for Symmetric Graph Drawings. (2022) (0)
Visualisation 2000, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2000 (2001) (0)
Sublinear Time Force Computation (2020) (0)
Louvain-based Multi-level Graph Drawing (2021) (0)
International Journal of Computational Geometry & Applications C World Scientiic Publishing Company an Algorithm for Drawing a Hierarchical Graph (1995) (0)
Problems on planarisation for sparse graphs (1997) (0)
IEEE Pacific Visualization Symposium PacificVis 2009, Beijing, China, April 20-23, 2009 (2009) (0)
Journal of Visual Languages and Computing Special Issue on Graph Visualization Guest Editors' Foreword Randomized Graph Drawing with Heavy-duty Preprocessing (2007) (0)
Computing and Combinatorics: 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings (2000) (0)
Acute Constraints in Straight-Line Drawings of Planar Graphs (2019) (0)
Visualisation 2002, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2002 (2002) (0)
Implementation of Continuous Echo Quality Assurance Program: Insights From a 3-Year Experience at a Large, Multi-Site, Australian Private Practice (2016) (0)
LAYOUT CREATION METHODS FOR SOFTWARE VISUALISATION (1996) (0)
Visualisation 2001, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2001 (2001) (0)
BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure (2018) (0)
Theoretical Computer Science: Foreword (2002) (0)
On-line scheduling a batch processing system to minimize total weighted job completion time (2001) (0)
Some new constructions for orthogonal designs using circulants (1977) (0)
Algorithms and Computation (2001) (0)
Which Graph Layout Gives a Good Shape for Large Graphs (2017) (0)
Drawing Graphs (2004) (0)
Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9 (2001) (0)
GDot-i: Interactive System for Dot Paintings of Graphs (2022) (0)
Kozo Sugiyama 1945 - 2011 (2011) (0)
An improvement for an algorithm for finding a minimum feedback An improvement for an algorithm for finding a minimum feedback An improvement for an algorithm for finding a minimum feedback An improvement for an algorithm for finding a minimum feedback (1999) (0)
Software Visualization (Dagstuhl Seminar 01211) (2021) (0)
Quality Assurance of Transthoracic Aortic Dimensions in Adults – Excellent Performance, but Room for Improvement (2019) (0)
On circulant codes with prescribed distances (1977) (0)
Foreword (2002) (0)
Australasian Symposium on Information Visualisation, InVis.au, Sydney, Australia, 3-4 December 2001 (2001) (0)
Weekly Anonymised Sonographer Performance League Table is a Simple and Effective Communication Tool to Improve Compliance with the Recording of Non-invasive Blood Pressure at the Time of Performing an Echocardiography (2016) (0)
dGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization (2022) (0)
Computing and Combinatorics (2000) (0)
STREAM EB : STREAM EDGE BUNDLING TECHNICAL REPORT 689 (2012) (0)
Shape-Faithful Graph Drawings (2022) (0)
Towards Area Requirements for Drawing (1998) (0)
SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing (2023) (0)
DSS: Drawing Dynamic Graphs with Spectral Sparsification (2022) (0)
What is a Good Diagram ? ( Revisited ) ( Invited Keynote ) (2014) (0)
Image Audit as A Part of a Quality Assurance Program is Feasible in a Large, Busy Australian Private Practice Across Multiple Sites, and Produces a Measurable Improvement in Study Quality (2016) (0)
Tripods do not pack densely (2000) (0)
PERFORMANCE GUARANTEES FOR A PLOTTER OPTIMIZATION HEURISTIC. (1987) (0)
The Graph Landscape - a Visualisation of Graph Properties (2013) (0)
HxI : An Australian Initiative in ICT-Augmented Human Interactivity (2007) (0)
An improvement for an algorithm for finding a minimum feedback arc set for planar graphs (1999) (0)
A Bonus for the Marker (1967) (0)

This paper list is powered by the following services:

Other Resources About Peter Eades

en.wikipedia.org

What Schools Are Affiliated With Peter Eades?

Peter Eades is affiliated with the following schools:

Peter Eades's Academic­Influence.com Rankings