Peter Eades

According to our database1, Peter Eades authored at least 175 papers between 1981 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Gap-planar graphs.
Theor. Comput. Sci., 2018

Polyline Drawings with Topological Constraints.
CoRR, 2018

The Weighted Barycenter Drawing Recognition Problem.
CoRR, 2018

Turning Cliques into Paths to Achieve Planarity.
CoRR, 2018

BC Tree-Based Proxy Graphs for Visualization of Big Graphs.
Proceedings of the IEEE Pacific Visualization Symposium, 2018

2017
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
IEEE Trans. Vis. Comput. Graph., 2017

Shape-Based Quality Metrics for Large Graph Visualization.
J. Graph Algorithms Appl., 2017

Drawing Big Graphs using Spectral Sparsification.
CoRR, 2017

Gap-planar Graphs.
CoRR, 2017

Towards Faithful Graph Visualizations.
CoRR, 2017

Drawing Big Graphs Using Spectral Sparsification.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Gap-Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

BJR-Tree: Fast Skyline Computation Algorithm for Serendipitous Searching Problems.
Proceedings of the 2017 IEEE International Conference on Data Science and Advanced Analytics, 2017

dNNG: Quality metrics and layout for neighbourhood faithfulness.
Proceedings of the 2017 IEEE Pacific Visualization Symposium, 2017

2016
Circular right-angle crossing drawings in linear time.
Theor. Comput. Sci., 2016

Simultaneous Orthogonal Planarity.
CoRR, 2016

Simultaneous Orthogonal Planarity.
Proceedings of the Graph Drawing and Network Visualization, 2016

Effects of curves on graph perception.
Proceedings of the 2016 IEEE Pacific Visualization Symposium, 2016

2015
Straight-line Drawability of a Planar Graph Plus an Edge.
CoRR, 2015

A Linear-Time Algorithm for Testing Outer-1-Planarity.
Algorithmica, 2015

Straight-Line Drawability of a Planar Graph Plus an Edge.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Shape-Based Quality Metrics for Large Graph Visualization.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
Larger crossing angles make graphs easier to read.
J. Vis. Lang. Comput., 2014

Order-preserving matching.
Theor. Comput. Sci., 2014

2-Layer Right Angle Crossing Drawings.
Algorithmica, 2014

Spatial augmented reality - A tool for 3D data visualization.
Proceedings of the 2014 IEEE VIS International Workshop on 3DVis, 2014

GION: Interactively Untangling Large Graphs on Wall-Sized Displays.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

2013
Symmetric Graph Drawing.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Improving multiple aesthetics produces better graph drawings.
J. Vis. Lang. Comput., 2013

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system.
Theor. Comput. Sci., 2013

Right angle crossing graphs and 1-planarity.
Discrete Applied Mathematics, 2013

Order Preserving Matching
CoRR, 2013

Circular Graph Drawings with Large Crossing Angles.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

A Linear-Time Algorithm for Testing Outer-1-Planarity.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

On the faithfulness of graph visualizations.
Proceedings of the IEEE Pacific Visualization Symposium, 2013

2012
Every outer-1-Plane Graph has a Right Angle Crossing Drawing.
Int. J. Comput. Geometry Appl., 2012

Bounds on the crossing resolution of complete geometric graphs.
Discrete Applied Mathematics, 2012

Visualizing dynamic trajectories in social networks.
Proceedings of the 2012 IEEE Symposium on Visual Languages and Human-Centric Computing, 2012

On the Faithfulness of Graph Visualizations.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

StreamEB: Stream Edge Bundling.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract).
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Fáry's Theorem for 1-Planar Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Drawing graphs with right angle crossings.
Theor. Comput. Sci., 2011

2-Layer Right Angle Crossing Drawings.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Right Angle Crossing Graphs and 1-Planarity.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Kozo Sugiyama 1945 - 2011.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
A characterization of complete bipartite RAC graphs.
Inf. Process. Lett., 2010

A Force-Directed Method for Large Crossing Angle Graph Drawing
CoRR, 2010

Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics.
Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing, 2010

Large Crossing Angles in Circular Layouts.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
Measuring effectiveness of graph visualizations: A cognitive load perspective.
Information Visualization, 2009

Issues for the Evaluation of Ambient Displays.
IJACI, 2009

Drawing Graphs with Right Angle Crossings.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

On Rectilinear Drawing of Graphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

A graph reading behavior: Geodesic-path tendency.
Proceedings of the IEEE Pacific Visualization Symposium PacificVis 2009, 2009

2008
User Hints for map labeling.
J. Vis. Lang. Comput., 2008

Some Constrained Notions of Planarity.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

The long-term evaluation of Fisherman in a partial-attention environment.
Proceedings of the BELIV 2008, 2008

Beyond time and error: a cognitive approach to the evaluation of graph drawings.
Proceedings of the BELIV 2008, 2008

Effects of Crossing Angles.
Proceedings of the IEEE VGTC Pacific Visualization Symposium 2008, 2008

2007
Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization.
J. Graph Algorithms Appl., 2007

Guest Editor's Foreword.
J. Graph Algorithms Appl., 2007

Intrusive and Non-intrusive Evaluation of Ambient Displays.
Proceedings of the 1st International Workshop on Ambient Information Systems, 2007

HxI : An Australian Initiative in ICT-Augmented Human Interactivity.
Proceedings of the Human-Computer Interaction, 2007

2006
A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs.
Discrete & Computational Geometry, 2006

Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs.
Algorithmica, 2006

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.
Algorithmica, 2006

ViCAT: Visualisation and Interaction on a Collaborative Access Table.
Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (Tabletop 2006), 2006

Predicting graph reading performance: a cognitive approach.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

How people read sociograms: a questionnaire study.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

Information Display.
Proceedings of the Handbook of Nature-Inspired and Innovative Computing, 2006

2005
User hints: a framework for interactive optimization.
Future Generation Comp. Syst., 2005

Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs.
Algorithmica, 2005

Navigating Software Architectures with Constant Visual Complexity.
Proceedings of the 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2005), 2005

A Framework for Visualising Large Graphs.
Proceedings of the 9th International Conference on Information Visualisation, 2005

An intrusive evaluation of peripheral display.
Proceedings of the 3rd International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia 2005, Dunedin, New Zealand, November 29, 2005

Layout Effects on Sociogram Perception.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

Using MoneyColor to Represent Financial Data.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

Using Spring Algorithms to Remove Node Overlapping.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

How People Read Graphs.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

Automatic Camera Path Generation for Graph Navigation in 3D.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization.
Proceedings of the Computer Science 2005, 2005

2004
Drawing Graphs.
Proceedings of the Handbook of Data Structures and Applications., 2004

Linkless symmetric drawings of series parallel digraphs.
Comput. Geom., 2004

Using MoneyTree To Represent Financial Data.
Proceedings of the 8th International Conference on Information Visualisation, 2004

A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
Towards area requirements for drawing hierarchically planar graphs.
Theor. Comput. Sci., 2003

An Edge-Splitting Algorithm in Planar Graphs.
J. Comb. Optim., 2003

On-Line Visualization and Navigation of the Global Web Structure.
International Journal of Software Engineering and Knowledge Engineering, 2003

Skewness of Graphs with Small Cutsets.
Graphs and Combinatorics, 2003

Drawing Trees Symmetrically in Three Dimensions.
Algorithmica, 2003

MoneyTree: Ambient Information Visualization Of Financial Data.
Proceedings of the Visual Information Processing 2003, 2003

Symmetric Layout of Disconnected Graphs.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

HexGraph: Applying Graph Drawing Algorithms to the Game of Hex.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Graph Drawing Contest Report.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

User Hints for Map Labelling.
Proceedings of the Computer Science 2003, 2003

2002
Foreword.
Theor. Comput. Sci., 2002

Graph Drawing in Motion.
J. Graph Algorithms Appl., 2002

Removing edge-node intersections in drawings of graphs.
Inf. Process. Lett., 2002

Width-restricted layering of acyclic digraphs with consideration of dummy nodes.
Inf. Process. Lett., 2002

Symmetric drawings of triconnected planar graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Visualising a Fund Manager Flow Graph with Columns and Worms.
Proceedings of the International Conference on Information Visualisation, 2002

A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing.
Proceedings of the Soft Computing Systems - Design, Management and Applications, 2002

2001
User Hints for Directed Graph Drawing.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Graphs in Software Visualization - Introduction.
Proceedings of the Software Visualization, 2001

2000
Spring algorithms and symmetry.
Theor. Comput. Sci., 2000

Navigating Clustered Graphs Using Force-Directed Methods.
J. Graph Algorithms Appl., 2000

Three-dimensional orthogonal graph drawing algorithms.
Discrete Applied Mathematics, 2000

Drawing series parallel digraphs symmetrically.
Comput. Geom., 2000

A System for Graph Clustering Based on User Hints.
Proceedings of the Visualisation 2000, 2000

Graph Library Design.
Proceedings of the 20st International Conference of the Chilean Computer Science Society (SCCC 2000), 2000

An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

FADE: Graph Drawing, Clustering, and Visual Abstraction.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

An Algorithm for Finding Three Dimensional Symmetry in Trees.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

The Marey Graph Animation Tool Demo.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

Drawing Hypergraphs in the Subset Standard (Short Demo Paper).
Proceedings of the Graph Drawing, 8th International Symposium, 2000

A Multi-agent Approach using A-Teams for Graph Drawing.
Proceedings of the ISCA 9th International Conference on Intelligent Systems, 2000

1999
Drawing Clustered Graphs on an Orthogonal Grid.
J. Graph Algorithms Appl., 1999

Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Graph Drawing: Algorithms for the Visualization of Graphs
Prentice-Hall, ISBN: 0-13-301615-3, 1999

1998
On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm.
J. Vis. Lang. Comput., 1998

WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping.
Computer Networks, 1998

Finding Planar Geometric Automorphisms in Planar Graphs.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

A Fully Animated Interactive System for Clustering and Navigating Huge Graphs.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Graph-Drawing Contest Report.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Routing Drawings in Diagram Displays.
Proceedings of the Third Asian Pacific Computer and Human Interaction, 1998

1997
Three-Dimensional Graph Drawing.
Algorithmica, 1997

Area Requirements for Drawing Hierarchically Planar Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Graph-Drawing Contest Report.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Finding the Best Viewpoints for Three-Dimensional Graph Drawings.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Drawing Clustered Graphs on an Orthogonal Grid.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Online Animated Graph Drawing for Web Navigation.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Spring Algorithms and Symmetry.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
The Logic Engine and the Realization Problem for Nearest Neighbor Graphs.
Theor. Comput. Sci., 1996

Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs.
Nord. J. Comput., 1996

The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings.
Inf. Process. Lett., 1996

An Algorithm for Drawing a Hierarchical Graph.
Int. J. Comput. Geometry Appl., 1996

The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard.
Algorithmica, 1996

Graph Drawing Methods.
Proceedings of the Conceptual Structures: Knowledge Representation as Interlingua, 1996

Two Algorithms for Three Dimensional Orthogonal Graph Drawing.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Graph-Drawing Contest Report.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Multilevel Visualization of Clustered Graphs.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995
Layout Adjustment and the Mental Map.
J. Vis. Lang. Comput., 1995

Guest editors' foreword.
J. Vis. Lang. Comput., 1995

A heuristic for the feedback arc set problem.
Australasian J. Combinatorics, 1995

Nearest Neighbour Graph Realizability is NP-hard.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Graph-Drawing Contest Report.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Vertex Splitting and Tension-Free Layout
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Drawing Stressed Planar Graphs in Three Dimensions.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

Planarity for Clustered Graphs.
Proceedings of the Algorithms, 1995

How to Draw a Planar Clustered Graph.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Drawing Graphs in Two Layers.
Theor. Comput. Sci., 1994

Algorithms for Drawing Graphs: an Annotated Bibliography.
Comput. Geom., 1994

Edge Crossings in Drawings of Bipartite Graphs.
Algorithmica, 1994

Integration of Declarative and Algorithmic Approaches for Layout Creation.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Graph Drawing Contest Report.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Three-Dimensional Graph Drawing.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Volume upper bounds for 3D graph drawing.
Proceedings of the 1994 Conference of the Centre for Advanced Studies on Collaborative Research, October 31, 1994

1993
The complexity of computing minimum separating polygons.
Pattern Recognition Letters, 1993

A Fast and Effective Heuristic for the Feedback Arc Set Problem.
Inf. Process. Lett., 1993

Two Tree Drawing Conventions.
Int. J. Comput. Geometry Appl., 1993

Performance Guarantees for Motion Planning with Temporal Uncertainty.
Australian Computer Journal, 1993

1992
Minimum Size h-v Drawings.
Proceedings of the Advanced Visual Interfaces - Proceedings of the International Workshop, 1992

1990
Fixed edge-length graph drawing is NP-hard.
Discrete Applied Mathematics, 1990

1989
How to draw a directed graph.
Proceedings of the IEEE Workshop on Visual Languages, 1989

1984
Some Hamilton Paths and a Minimal Change Algorithm.
J. ACM, 1984

An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property.
Inf. Process. Lett., 1984

1983
A lower-bound for the number of productions required for a certain class of languages.
Discrete Applied Mathematics, 1983

1981
On Optimal Trees.
J. Algorithms, 1981


  Loading...