On Optimal Trees. - Peter Eades; John Staples (J. Algorithms, 1981)

A lower-bound for the number of productions required for a certain class of languages. - Brian Alspach; Peter Eades; Gordon Rose (Discret. Appl. Math., 1983)

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

Some Hamilton Paths and a Minimal Change Algorithm. - Peter Eades; Michael Hickey; Ronald C. Read (J. ACM, 1984)

How to draw a directed graph. - Peter Eades; Xuemin Lin 001 (VL, 1989)

Fixed edge-length graph drawing is NP-hard. - Peter Eades; Nicholas C. Wormald (Discret. Appl. Math., 1990)

Minimum Size h-v Drawings. - Peter Eades; Tao Lin; Xuemin Lin 001 (Advanced Visual Interfaces, 1992)

Performance Guarantees for Motion Planning with Temporal Uncertainty. - Peter Eades; Xuemin Lin 001; Nicholas C. Wormald (Aust. Comput. J., 1993)

Two Tree Drawing Conventions. - Peter Eades; Tao Lin; Xuemin Lin 001 (Int. J. Comput. Geom. Appl., 1993)

A Fast and Effective Heuristic for the Feedback Arc Set Problem. - Peter Eades; Xuemin Lin 001; W. F. Smyth (Inf. Process. Lett., 1993)

The complexity of computing minimum separating polygons. - Peter Eades; David Rappaport (Pattern Recognit. Lett., 1993)

Algorithms for drawing trees (abstract). - Peter Eades (SIGACT News, 1993)

Volume upper bounds for 3D graph drawing. - Robert F. Cohen; Peter Eades; Tao Lin; Frank Ruskey (CASCON, 1994)

The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. - Peter Eades; Sue Whitesides (SCG, 1994)

Integration of Declarative and Algorithmic Approaches for Layout Creation. - Tao Lin; Peter Eades (GD, 1994)

Edge Crossings in Drawings of Bipartite Graphs. - Peter Eades; Nicholas C. Wormald (Algorithmica, 1994)

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

Drawing Graphs in Two Layers. - Peter Eades; Sue Whitesides (Theor. Comput. Sci., 1994)

How to Draw a Planar Clustered Graph. - Qing-Wen Feng; Robert F. Cohen; Peter Eades (COCOON, 1995)

Planarity for Clustered Graphs. - Qing-Wen Feng; Robert F. Cohen; Peter Eades (ESA, 1995)

Drawing Stressed Planar Graphs in Three Dimensions. - Peter Eades; Patrick Garvan (GD, 1995)

Vertex Splitting and Tension-Free Layout - Peter Eades; Candido Ferreira Xavier de Mendonça Neto (GD, 1995)

Graph-Drawing Contest Report. - Peter Eades; Joe Marks (GD, 1995)

Nearest Neighbour Graph Realizability is NP-hard. - Peter Eades; Sue Whitesides (LATIN, 1995)

A heuristic for the feedback arc set problem. - Peter Eades; Xuemin Lin 001 (Australas. J Comb., 1995)

Guest editors' foreword. - Isabel F. Cruz; Peter Eades (J. Vis. Lang. Comput., 1995)

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

Multilevel Visualization of Clustered Graphs. - Peter Eades; Qing-Wen Feng (GD, 1996)

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. - Peter Eades; Qing-Wen Feng; Xuemin Lin 001 (GD, 1996)

Two Algorithms for Three Dimensional Orthogonal Graph Drawing. - Peter Eades; Antonios Symvonis; Sue Whitesides (GD, 1996)

Graph Drawing Methods. - Peter Eades (ICCS, 1996)

The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. - Peter Eades; Sue Whitesides (Algorithmica, 1996)

An Algorithm for Drawing a Hierarchical Graph. - Peter Eades; Xuemin Lin 001; Roberto Tamassia (Int. J. Comput. Geom. Appl., 1996)

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

Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. - Peter Eades; J. Mark Keil; Paul D. Manuel; Mirka Miller (Nord. J. Comput., 1996)

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

Online Animated Graph Drawing for Web Navigation. - Peter Eades; Robert F. Cohen; Mao Lin Huang (GD, 1997)

Drawing Clustered Graphs on an Orthogonal Grid. - Peter Eades; Qing-Wen Feng (GD, 1997)

Finding the Best Viewpoints for Three-Dimensional Graph Drawings. - Peter Eades; Michael E. Houle; Richard Webber (GD, 1997)

Graph-Drawing Contest Report. - Peter Eades; Joe Marks; Stephen C. North (GD, 1997)

Area Requirements for Drawing Hierarchically Planar Graphs. - Xuemin Lin 001; Peter Eades (GD, 1997)

Three-Dimensional Graph Drawing. - Robert F. Cohen; Peter Eades; Tao Lin; Frank Ruskey (Algorithmica, 1997)

Routing Drawings in Diagram Displays. - Wei Lai; Peter Eades (APCHI, 1998)

Graph-Drawing Contest Report. - Peter Eades; Joe Marks; Petra Mutzel; Stephen C. North (GD, 1998)

Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. - Seok-Hee Hong 001; Peter Eades; Aaron J. Quigley; Sang Ho Lee (GD, 1998)

A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. - Mao Lin Huang; Peter Eades (GD, 1998)

Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. - Hiroshi Nagamochi; Peter Eades (IPCO, 1998)

Finding Planar Geometric Automorphisms in Planar Graphs. - Seok-Hee Hong 001; Peter Eades; Sang Ho Lee (ISAAC, 1998)

WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping. - Mao Lin Huang; Peter Eades; Robert F. Cohen (Comput. Networks, 1998)

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

Graph Drawing Algorithms. - Peter Eades; Petra Mutzel (Algorithms and Theory of Computation Handbook, 1999)

Graph Drawing: Algorithms for the Visualization of Graphs - Giuseppe Di Battista; Peter Eades; Roberto Tamassia; Ioannis G. Tollis (Prentice-Hall, 1999)

Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. - Xuemin Lin 001; Peter Eades (COCOON, 1999)

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

A Multi-agent Approach using A-Teams for Graph Drawing. - Hugo A. D. do Nascimento; Peter Eades; Candido Ferreira Xavier de Mendonça Neto (IS, 2000)

Drawing Hypergraphs in the Subset Standard (Short Demo Paper). - François Bertault; Peter Eades (GD, 2000)

The Marey Graph Animation Tool Demo. - Carsten Friedrich; Peter Eades (GD, 2000)

An Algorithm for Finding Three Dimensional Symmetry in Trees. - Seok-Hee Hong 001; Peter Eades (GD, 2000)

FADE: Graph Drawing, Clustering, and Visual Abstraction. - Aaron J. Quigley; Peter Eades (GD, 2000)

An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. - Seok-Hee Hong 001; Peter Eades (ISAAC, 2000)

Graph Library Design. - François Bertault; Peter Eades (SCCC, 2000)

A System for Graph Clustering Based on User Hints. - Hugo A. D. do Nascimento; Peter Eades (VIP, 2000)

Drawing series parallel digraphs symmetrically. - Seok-Hee Hong 001; Peter Eades; Sang Ho Lee (Comput. Geom., 2000)

Three-dimensional orthogonal graph drawing algorithms. - Peter Eades; Antonios Symvonis; Sue Whitesides (Discret. Appl. Math., 2000)

Navigating Clustered Graphs Using Force-Directed Methods. - Peter Eades; Mao Lin Huang (J. Graph Algorithms Appl., 2000)

Spring algorithms and symmetry. - Peter Eades; Xuemin Lin 001 (Theor. Comput. Sci., 2000)

Graphs in Software Visualization - Introduction. - Petra Mutzel; Peter Eades (Software Visualization, 2001)

User Hints for Directed Graph Drawing. - Hugo A. D. do Nascimento; Peter Eades (GD, 2001)

A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing. - Hugo A. D. do Nascimento; Peter Eades (HIS, 2002)

Visualising a Fund Manager Flow Graph with Columns and Worms. - Tim Dwyer; Peter Eades (IV, 2002)

Symmetric drawings of triconnected planar graphs. - Seok-Hee Hong 001; Brendan D. McKay; Peter Eades (SODA, 2002)

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

Removing edge-node intersections in drawings of graphs. - Wei Lai; Peter Eades (Inf. Process. Lett., 2002)

Graph Drawing in Motion. - Carsten Friedrich; Peter Eades (J. Graph Algorithms Appl., 2002)

Foreword. - Ding-Zhu Du; Peter Eades; Xuemin Lin 001 (Theor. Comput. Sci., 2002)

User Hints for Map Labelling. - Hugo A. D. do Nascimento; Peter Eades (ACSC, 2003)

Graph Drawing Contest Report. - Franz-Josef Brandenburg; Ulrik Brandes; Peter Eades; Joe Marks (GD, 2003)

HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. - Colin Murray; Carsten Friedrich; Peter Eades (GD, 2003)

Symmetric Layout of Disconnected Graphs. - Seok-Hee Hong 001; Peter Eades (ISAAC, 2003)

MoneyTree: Ambient Information Visualization Of Financial Data. - Peter Eades; Xiaobin Shen 001 (VIP, 2003)

Drawing Trees Symmetrically in Three Dimensions. - Seok-Hee Hong 001; Peter Eades (Algorithmica, 2003)

Skewness of Graphs with Small Cutsets. - Graham Farr; Peter Eades (Graphs Comb., 2003)

On-Line Visualization and Navigation of the Global Web Structure. - Mao Lin Huang; Peter Eades; Wei Lai (Int. J. Softw. Eng. Knowl. Eng., 2003)

An Edge-Splitting Algorithm in Planar Graphs. - Hiroshi Nagamochi; Peter Eades (J. Comb. Optim., 2003)

Towards area requirements for drawing hierarchically planar graphs. - Xuemin Lin 001; Peter Eades (Theor. Comput. Sci., 2003)

A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. - Seok-Hee Hong 001; Peter Eades (GD, 2004)

Using MoneyTree To Represent Financial Data. - Xiaobin Shen 001; Peter Eades (IV, 2004)

Linkless symmetric drawings of series parallel digraphs. - Seok-Hee Hong 001; Peter Eades; Jonathan Hillman (Comput. Geom., 2004)

Drawing Graphs. - Peter Eades; Seok-Hee Hong 001 (Handbook of Data Structures and Applications, 2004)

A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization. - Xiaodi Huang; Peter Eades; Wei Lai (ACSC, 2005)

Automatic Camera Path Generation for Graph Navigation in 3D. - Adel Ahmed; Peter Eades (APVIS, 2005)

How People Read Graphs. - Weidong Huang 001; Peter Eades (APVIS, 2005)

Using Spring Algorithms to Remove Node Overlapping. - Wanchun Li; Peter Eades; Nikola S. Nikolov (APVIS, 2005)

Using MoneyColor to Represent Financial Data. - Xiaobin Shen 001; Peter Eades (APVIS, 2005)

Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. - Lanbo Zheng; Le Song; Peter Eades (APVIS, 2005)

Layout Effects on Sociogram Perception. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (GD, 2005)

An intrusive evaluation of peripheral display. - Xiaobin Shen 001; Andrew Vande Moere; Peter Eades (GRAPHITE, 2005)

A Framework for Visualising Large Graphs. - Wanchun Li; Seok-Hee Hong 001; Peter Eades (IV, 2005)

Navigating Software Architectures with Constant Visual Complexity. - Wanchun Li; Peter Eades; Seok-Hee Hong 001 (VL/HCC, 2005)

Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. - Seok-Hee Hong 001; Peter Eades (Algorithmica, 2005)

User hints: a framework for interactive optimization. - Hugo A. D. do Nascimento; Peter Eades (Future Gener. Comput. Syst., 2005)

Information Display. - Peter Eades; Seok-Hee Hong 001; Keith Nesbitt; Masahiro Takatsuka (Handbook of Nature-Inspired and Innovative Computing, 2006)

How people read sociograms: a questionnaire study. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (APVIS, 2006)

Predicting graph reading performance: a cognitive approach. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (APVIS, 2006)

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

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

Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. - Seok-Hee Hong 001; Peter Eades (Algorithmica, 2006)

A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. - Seok-Hee Hong 001; Brendan D. McKay; Peter Eades (Discret. Comput. Geom., 2006)

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

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

Guest Editor's Foreword. - Peter Eades; Patrick Healy (J. Graph Algorithms Appl., 2007)

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

Effects of Crossing Angles. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (PacificVis, 2008)

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

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

Some Constrained Notions of Planarity. - Peter Eades (ISAAC, 2008)

User Hints for map labeling. - Hugo A. D. do Nascimento; Peter Eades (J. Vis. Lang. Comput., 2008)

A graph reading behavior: Geodesic-path tendency. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001 (PacificVis, 2009)

On Rectilinear Drawing of Graphs. - Peter Eades; Seok-Hee Hong 001; Sheung-Hung Poon (GD, 2009)

Issues for the Evaluation of Ambient Displays. - Xiaobin Shen 001; Andrew Vande Moere; Peter Eades; Seok-Hee Hong 001 (Int. J. Ambient Comput. Intell., 2009)

Measuring effectiveness of graph visualizations: A cognitive load perspective. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001 (Inf. Vis., 2009)

Large Crossing Angles in Circular Layouts. - Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001; Weidong Huang 001 (GD, 2010)

Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001; Chun-Cheng Lin (VL/HCC, 2010)

A Force-Directed Method for Large Crossing Angle Graph Drawing - Peter Eades; Weidong Huang 001; Seok-Hee Hong 001 (CoRR, 2010)

A characterization of complete bipartite RAC graphs. - Walter Didimo; Peter Eades; Giuseppe Liotta (Inf. Process. Lett., 2010)

Kozo Sugiyama 1945 - 2011. - Peter Eades; Seok-Hee Hong 001; Kazuo Misue (GD, 2011)

TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. - Quan Hoang Nguyen 001; Seok-Hee Hong 001; Peter Eades (GD, 2011)

Drawing graphs with right angle crossings. - Walter Didimo; Peter Eades; Giuseppe Liotta (Theor. Comput. Sci., 2011)

How to Draw a Graph, Revisited. - Peter Eades; Seok-Hee Hong 001 (Expanding the Frontiers of Visual Analytics and Visualization, 2012)

Fáry's Theorem for 1-Planar Graphs. - Seok-Hee Hong 001; Peter Eades; Giuseppe Liotta; Sheung-Hung Poon (COCOON, 2012)

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

StreamEB: Stream Edge Bundling. - Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001 (GD, 2012)

On the Faithfulness of Graph Visualizations. - Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001 (GD, 2012)

Visualizing dynamic trajectories in social networks. - Hui Liu; Peter Eades; Seok-Hee Hong 001 (VL/HCC, 2012)

Bounds on the crossing resolution of complete geometric graphs. - Emilio Di Giacomo; Walter Didimo; Peter Eades; Seok-Hee Hong 001; Giuseppe Liotta (Discret. Appl. Math., 2012)

Every outer-1-Plane Graph has a Right Angle Crossing Drawing. - Hooman Reisi Dehkordi; Peter Eades (Int. J. Comput. Geom. Appl., 2012)

Circular Graph Drawings with Large Crossing Angles. - Hooman Reisi Dehkordi; Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001 (WALCOM, 2013)

Right angle crossing graphs and 1-planarity. - Peter Eades; Giuseppe Liotta (Discret. Appl. Math., 2013)

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. - Peter Eades; Seok-Hee Hong 001; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (Theor. Comput. Sci., 2013)

Improving multiple aesthetics produces better graph drawings. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001; Chun-Cheng Lin (J. Vis. Lang. Comput., 2013)

Symmetric Graph Drawing. - Peter Eades; Seok-Hee Hong 001 (Handbook of Graph Drawing and Visualization, 2013)

GION: Interactively Untangling Large Graphs on Wall-Sized Displays. - Michael R. Marner; Ross T. Smith; Bruce H. Thomas; Karsten Klein 001; Peter Eades; Seok-Hee Hong 001 (GD, 2014)

Spatial augmented reality - A tool for 3D data visualization. - Bruce H. Thomas; Michael R. Marner; Ross T. Smith; Neven Abdelaziz Mohamed ElSayed; G. Stewart Von Itzstein; Karsten Klein 001; Matt Adcock; Peter Eades; Andrew Irlitti; Joanne E. Zucco; Timothy M. Simon; James Baumeister; et al. (3DVis@IEEE VIS, 2014)

2-Layer Right Angle Crossing Drawings. - Emilio Di Giacomo; Walter Didimo; Peter Eades; Giuseppe Liotta (Algorithmica, 2014)

Order-preserving matching. - Jinil Kim; Peter Eades; Rudolf Fleischer; Seok-Hee Hong 001; Costas S. Iliopoulos; Kunsoo Park; Simon J. Puglisi; Takeshi Tokuyama (Theor. Comput. Sci., 2014)

Larger crossing angles make graphs easier to read. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001 (J. Vis. Lang. Comput., 2014)

Straight-Line Drawability of a Planar Graph Plus an Edge. - Peter Eades; Seok-Hee Hong 001; Giuseppe Liotta; Naoki Katoh; Sheung-Hung Poon (WADS, 2015)

A Linear-Time Algorithm for Testing Outer-1-Planarity. - Seok-Hee Hong 001; Peter Eades; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (Algorithmica, 2015)

Effects of curves on graph perception. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001; Henry Been-Lirn Duh (PacificVis, 2016)

Simultaneous Orthogonal Planarity. - Patrizio Angelini; Steven Chaplick; Sabine Cornelsen; Giordano Da Lozzo; Giuseppe Di Battista; Peter Eades; Philipp Kindermann; Jan Kratochvíl; Fabian Lipp; Ignaz Rutter (GD, 2016)

Circular right-angle crossing drawings in linear time. - Hooman Reisi Dehkordi; Peter Eades; Seok-Hee Hong 001; Quan Hoang Nguyen 001 (Theor. Comput. Sci., 2016)

dNNG: Quality metrics and layout for neighbourhood faithfulness. - Quan Hoang Nguyen 001; Seok-Hee Hong 001; Peter Eades (PacificVis, 2017)

BJR-Tree: Fast Skyline Computation Algorithm for Serendipitous Searching Problems. - Kenichi Koizumi; Peter Eades; Kei Hiraki; Mary Inaba (DSAA, 2017)

Drawing Big Graphs Using Spectral Sparsification. - Peter Eades; Quan Hoang Nguyen 001; Seok-Hee Hong 001 (GD, 2017)

Towards Faithful Graph Visualizations. - Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001 (CoRR, 2017)

Shape-Based Quality Metrics for Large Graph Visualization. - Peter Eades; Seok-Hee Hong 001; An Nguyen 001; Karsten Klein 001 (J. Graph Algorithms Appl., 2017)

Proxy Graph: Visual Quality Metrics of Big Graph Sampling. - Quan Hoang Nguyen 001; Seok-Hee Hong 001; Peter Eades; Amyra Meidiana (IEEE Trans. Vis. Comput. Graph., 2017)

Graph Visualization. - Peter Eades; Karsten Klein 001 (Graph Data Management, 2018)

BC Tree-Based Proxy Graphs for Visualization of Big Graphs. - Seok-Hee Hong 001; Quan Hoang Nguyen 001; Amyra Meidiana; Jiaxi Li; Peter Eades (PacificVis, 2018)

Turning Cliques into Paths to Achieve Planarity. - Patrizio Angelini; Peter Eades; Seok-Hee Hong 001; Karsten Klein 001; Stephen G. Kobourov; Giuseppe Liotta; Alfredo Navarra; Alessandra Tappini (GD, 2018)

The Weighted Barycenter Drawing Recognition Problem. - Peter Eades; Patrick Healy; Nikola S. Nikolov (GD, 2018)

Gap-planar graphs. - Sang Won Bae 001; Jean-François Baffier; Jinhee Chun; Peter Eades; Kord Eickmeyer; Luca Grilli 001; Seok-Hee Hong 001; Matias Korman; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (Theor. Comput. Sci., 2018)

Spectral Vertex Sampling for Big Complex Graphs. - Jingming Hu; Seok-Hee Hong 001; Peter Eades (COMPLEX NETWORKS (2), 2019)

Multi-level Graph Drawing Using Infomap Clustering. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel; Ziyang Wang; David Chae; Sungpack Hong; Daniel Langerenken; Hassan Chafi (GD, 2019)

A Quality Metric for Visualization of Clusters in Graphs. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades; Daniel A. Keim (GD, 2019)

Topology-Based Spectral Sparsification. - Amyra Meidiana; Seok-Hee Hong 001; Jiajun Huang; Peter Eades; Kwan-Liu Ma (LDAV, 2019)

A Quality Metric for Symmetric Graph Drawings. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades; Daniel A. Keim (CoRR, 2019)

Acute Constraints in Straight-Line Drawings of Planar Graphs. - Akane Seto; Aleksandar Shurbevski; Hiroshi Nagamochi; Peter Eades (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure. - Kenichi Koizumi; Peter Eades; Kei Hiraki; Mary Inaba (Int. J. Data Sci. Anal., 2019)

Dynamic Graph Map Animation. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel; Weidong Huang 001; Cristina Cifuentes (PacificVis, 2020)

A Study of Mental Maps in Immersive Network Visualization. - Joseph Kotlarek; Oh-Hyun Kwon; Kwan-Liu Ma; Peter Eades; Andreas Kerren; Karsten Klein 001; Falk Schreiber (PacificVis, 2020)

Quality Metrics for Symmetric Graph Drawings. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades; Daniel A. Keim (PacificVis, 2020)

Connectivity-Based Spectral Sampling for Big Complex Network Visualization. - Jingming Hu; Seok-Hee Hong 001; Jialu Chen; Marnijati Torkel; Peter Eades; Kwan-Liu Ma (COMPLEX NETWORKS (1), 2020)

New Quality Metrics for Dynamic Graph Drawing. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades (GD, 2020)

Graph Planarity by Replacing Cliques with Paths. - Patrizio Angelini; Peter Eades; Seok-Hee Hong 001; Karsten Klein 001; Stephen G. Kobourov; Giuseppe Liotta; Alfredo Navarra; Alessandra Tappini (Algorithms, 2020)

Sublinear Time Force Computation for Big Complex Network Visualization. - Amyra Meidiana; Seok-Hee Hong 001; Marnijati Torkel; Shijun Cai; Peter Eades (Comput. Graph. Forum, 2020)

Polyline drawings with topological constraints. - Emilio Di Giacomo; Peter Eades; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani (Theor. Comput. Sci., 2020)

GDot: Drawing Graphs with Dots and Circles. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel (PacificVis, 2021)

Louvain-based Multi-level Graph Drawing. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel; James Wood; Kunsoo Park (PacificVis, 2021)

Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing. - Amyra Meidiana; Seok-Hee Hong 001; Shijun Cai; Marnijati Torkel; Peter Eades (PacificVis, 2021)

BC tree-based spectral sampling for big complex network visualization. - Jingming Hu; Tuan Tran Chu; Seok-Hee Hong 001; Jialu Chen; Amyra Meidiana; Marnijati Torkel; Peter Eades; Kwan-Liu Ma (Appl. Netw. Sci., 2021)

dGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization. - Seok-Hee Hong 001; Amyra Meidiana; James Wood; Juan Pablo Ataides; Peter Eades; Kunsoo Park (PacificVis, 2022)

Shape-Faithful Graph Drawings. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades (GD, 2022)

GDot-i: Interactive System for Dot Paintings of Graphs. - Peter Eades; Seok-Hee Hong 001; Martin McGrane; Amyra Meidiana (EuroVis (Posters), 2022)

DSS: Drawing Dynamic Graphs with Spectral Sparsification. - Amyra Meidiana; Seok-Hee Hong 001; Yanyi Pu; Justin Lee; Peter Eades; Jinwook Seo (EuroVis (Short Papers), 2022)

CelticGraph: Drawing Graphs as Celtic Knots and Links. - Peter Eades; Niklas Gröne; Karsten Klein 001; Patrick Eades; Leo Schreiber; Ulf Hailer; Falk Schreiber (GD (1), 2023)

GraphTrials: Visual Proofs of Graph Properties. - Henry Förster; Felix Klesen; Tim Dwyer; Peter Eades; Seok-Hee Hong 001; Stephen G. Kobourov; Giuseppe Liotta; Kazuo Misue; Fabrizio Montecchiani; Alexander Pastukhov; Falk Schreiber (GD, 2024)

Cluster-Faithful Graph Visualization: New Metrics and Algorithms. - Shijun Cai; Seok-Hee Hong 001; Amyra Meidiana; Peter Eades; Daniel A. Keim (PacificVis, 2024)

SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing. - Amyra Meidiana; Seok-Hee Hong 001; Shijun Cai; Marnijati Torkel; Peter Eades (IEEE Trans. Vis. Comput. Graph., 2024)

Automorphism Faithfulness Metrics for Symmetric Graph Drawings. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades; Daniel A. Keim (IEEE Trans. Vis. Comput. Graph., 2024)

Introducing fairness in network visualization. - Peter Eades; Seokhee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli; Stephen K. Wismath (Inf. Sci., 2025)