Peter Eades - RankMe

228 papers A* 1A 49B 32C 5Misc 6Journal 93Unranked 31

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	GraphTrials: Visual Proofs of Graph Properties. IEEE Trans. Vis. Comput. Graph. Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber
2025	J	`jnl`	Interweaving Mathematics and Art: Drawing Graphs as Celtic Knots and Links With CelticGraph. IEEE Trans. Vis. Comput. Graph. Niklas Gröne, Peter Eades, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Hugo A. D. do Nascimento, Falk Schreiber
2025	J	`jnl`	Introducing fairness in network visualization. Inf. Sci. Peter Eades, Seokhee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli, Stephen K. Wismath
2024	J	`jnl`	Automorphism Faithfulness Metrics for Symmetric Graph Drawings. IEEE Trans. Vis. Comput. Graph. Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim
2024	B	`conf`	Cluster-Faithful Graph Visualization: New Metrics and Algorithms. PacificVis Shijun Cai, Seok-Hee Hong, Amyra Meidiana, Peter Eades, Daniel A. Keim
2024	A	`conf`	GraphTrials: Visual Proofs of Graph Properties. GD Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber
2024	J	`jnl`	GraphTrials: Visual Proofs of Graph Properties. CoRR Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber
2024	J	`jnl`	SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing. IEEE Trans. Vis. Comput. Graph. Amyra Meidiana, Seok-Hee Hong, Shijun Cai, Marnijati Torkel, Peter Eades
2023	—	`conf`	CelticGraph: Drawing Graphs as Celtic Knots and Links. GD (1) Peter Eades, Niklas Gröne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber
2023	J	`jnl`	CelticGraph: Drawing Graphs as Celtic Knots and Links. CoRR Peter Eades, Niklas Gröne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber
2022	—	`conf`	DSS: Drawing Dynamic Graphs with Spectral Sparsification. EuroVis (Short Papers) Amyra Meidiana, Seok-Hee Hong, Yanyi Pu, Justin Lee, Peter Eades, Jinwook Seo
2022	—	`conf`	GDot-i: Interactive System for Dot Paintings of Graphs. EuroVis (Posters) Peter Eades, Seok-Hee Hong, Martin McGrane, Amyra Meidiana
2022	A	`conf`	Shape-Faithful Graph Drawings. GD Amyra Meidiana, Seok-Hee Hong, Peter Eades
2022	J	`jnl`	Shape-Faithful Graph Drawings. CoRR Amyra Meidiana, Seok-Hee Hong, Peter Eades
2022	B	`conf`	dGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization. PacificVis Seok-Hee Hong, Amyra Meidiana, James Wood, Juan Pablo Ataides, Peter Eades, Kunsoo Park
2021	J	`jnl`	BC tree-based spectral sampling for big complex network visualization. Appl. Netw. Sci. Jingming Hu, Tuan Tran Chu, Seok-Hee Hong, Jialu Chen, Amyra Meidiana, Marnijati Torkel, Peter Eades, Kwan-Liu Ma
2021	B	`conf`	GDot: Drawing Graphs with Dots and Circles. PacificVis Seok-Hee Hong, Peter Eades, Marnijati Torkel
2021	B	`conf`	Louvain-based Multi-level Graph Drawing. PacificVis Seok-Hee Hong, Peter Eades, Marnijati Torkel, James Wood, Kunsoo Park
2021	B	`conf`	Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing. PacificVis Amyra Meidiana, Seok-Hee Hong, Shijun Cai, Marnijati Torkel, Peter Eades
2020	B	`conf`	A Study of Mental Maps in Immersive Network Visualization. PacificVis Joseph Kotlarek, Oh-Hyun Kwon, Kwan-Liu Ma, Peter Eades, Andreas Kerren, Karsten Klein, Falk Schreiber
2020	J	`jnl`	A Study of Mental Maps in Immersive Network Visualization. CoRR Joseph Kotlarek, Oh-Hyun Kwon, Kwan-Liu Ma, Peter Eades, Andreas Kerren, Karsten Klein, Falk Schreiber
2020	—	`conf`	Connectivity-Based Spectral Sampling for Big Complex Network Visualization. COMPLEX NETWORKS (1) Jingming Hu, Seok-Hee Hong, Jialu Chen, Marnijati Torkel, Peter Eades, Kwan-Liu Ma
2020	B	`conf`	Dynamic Graph Map Animation. PacificVis Seok-Hee Hong, Peter Eades, Marnijati Torkel, Weidong Huang, Cristina Cifuentes
2020	J	`jnl`	Graph Planarity by Replacing Cliques with Paths. Algorithms Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini
2020	A	`conf`	New Quality Metrics for Dynamic Graph Drawing. GD Amyra Meidiana, Seok-Hee Hong, Peter Eades
2020	J	`jnl`	New Quality Metrics for Dynamic Graph Drawing. CoRR Amyra Meidiana, Seok-Hee Hong, Peter Eades
2020	J	`jnl`	Polyline drawings with topological constraints. Theor. Comput. Sci. Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2020	B	`conf`	Quality Metrics for Symmetric Graph Drawings. PacificVis Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim
2020	J	`jnl`	Sublinear Time Force Computation for Big Complex Network Visualization. Comput. Graph. Forum Amyra Meidiana, Seok-Hee Hong, Marnijati Torkel, Shijun Cai, Peter Eades
2019	J	`jnl`	A Quality Metric for Symmetric Graph Drawings. CoRR Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim
2019	A	`conf`	A Quality Metric for Visualization of Clusters in Graphs. GD Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim
2019	J	`jnl`	A Quality Metric for Visualization of Clusters in Graphs. CoRR Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim
2019	J	`jnl`	Acute Constraints in Straight-Line Drawings of Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades
2019	J	`jnl`	BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure. Int. J. Data Sci. Anal. Kenichi Koizumi, Peter Eades, Kei Hiraki, Mary Inaba
2019	A	`conf`	Multi-level Graph Drawing Using Infomap Clustering. GD Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi
2019	J	`jnl`	Multi-level Graph Drawing using Infomap Clustering. CoRR Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi
2019	—	`conf`	Spectral Vertex Sampling for Big Complex Graphs. COMPLEX NETWORKS (2) Jingming Hu, Seok-Hee Hong, Peter Eades
2019	—	`conf`	Topology-Based Spectral Sparsification. LDAV Amyra Meidiana, Seok-Hee Hong, Jiajun Huang, Peter Eades, Kwan-Liu Ma
2018	B	`conf`	BC Tree-Based Proxy Graphs for Visualization of Big Graphs. PacificVis Seok-Hee Hong, Quan Hoang Nguyen, Amyra Meidiana, Jiaxi Li, Peter Eades
2018	J	`jnl`	Gap-planar graphs. Theor. Comput. Sci. Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2018	—	`ch.`	Graph Visualization. Graph Data Management Peter Eades, Karsten Klein
2018	B	`conf`	Polyline Drawings with Topological Constraints. ISAAC Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2018	J	`jnl`	Polyline Drawings with Topological Constraints. CoRR Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani
2018	A	`conf`	The Weighted Barycenter Drawing Recognition Problem. GD Peter Eades, Patrick Healy, Nikola S. Nikolov
2018	J	`jnl`	The Weighted Barycenter Drawing Recognition Problem. CoRR Peter Eades, Patrick Healy, Nikola S. Nikolov
2018	A	`conf`	Turning Cliques into Paths to Achieve Planarity. GD Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini
2018	J	`jnl`	Turning Cliques into Paths to Achieve Planarity. CoRR Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini
2017	B	`conf`	BJR-Tree: Fast Skyline Computation Algorithm for Serendipitous Searching Problems. DSAA Kenichi Koizumi, Peter Eades, Kei Hiraki, Mary Inaba
2017	A	`conf`	Drawing Big Graphs Using Spectral Sparsification. GD Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong
2017	J	`jnl`	Drawing Big Graphs using Spectral Sparsification. CoRR Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong
2017	A	`conf`	Gap-Planar Graphs. GD Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2017	J	`jnl`	Gap-planar Graphs. CoRR Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2017	J	`jnl`	Proxy Graph: Visual Quality Metrics of Big Graph Sampling. IEEE Trans. Vis. Comput. Graph. Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades, Amyra Meidiana
2017	J	`jnl`	Shape-Based Quality Metrics for Large Graph Visualization. J. Graph Algorithms Appl. Peter Eades, Seok-Hee Hong, An Nguyen, Karsten Klein
2017	J	`jnl`	Towards Faithful Graph Visualizations. CoRR Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong
2017	B	`conf`	dNNG: Quality metrics and layout for neighbourhood faithfulness. PacificVis Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades
2016	J	`jnl`	Circular right-angle crossing drawings in linear time. Theor. Comput. Sci. Hooman Reisi Dehkordi, Peter Eades, Seok-Hee Hong, Quan Hoang Nguyen
2016	B	`conf`	Effects of curves on graph perception. PacificVis Weidong Huang, Peter Eades, Seok-Hee Hong, Henry Been-Lirn Duh
2016	A	`conf`	Simultaneous Orthogonal Planarity. GD Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter
2016	J	`jnl`	Simultaneous Orthogonal Planarity. CoRR Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter
2015	J	`jnl`	A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
2015	A	`conf`	Shape-Based Quality Metrics for Large Graph Visualization. GD Peter Eades, Seok-Hee Hong, Karsten Klein, An Nguyen
2015	B	`conf`	Straight-Line Drawability of a Planar Graph Plus an Edge. WADS Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon
2015	J	`jnl`	Straight-line Drawability of a Planar Graph Plus an Edge. CoRR Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon
2014	J	`jnl`	2-Layer Right Angle Crossing Drawings. Algorithmica Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta
2014	A	`conf`	GION: Interactively Untangling Large Graphs on Wall-Sized Displays. GD Michael R. Marner, Ross T. Smith, Bruce H. Thomas, Karsten Klein, Peter Eades, Seok-Hee Hong
2014	J	`jnl`	Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. Weidong Huang, Peter Eades, Seok-Hee Hong
2014	J	`jnl`	Order-preserving matching. Theor. Comput. Sci. Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama
2014	—	`conf`	Spatial augmented reality - A tool for 3D data visualization. 3DVis@IEEE VIS Bruce H. Thomas, Michael R. Marner, Ross T. Smith, Neven Abdelaziz Mohamed ElSayed, G. Stewart Von Itzstein, Karsten Klein, Matt Adcock, Peter Eades, Andrew Irlitti, Joanne E. Zucco, Timothy M. Simon, James Baumeister, Timothy Suthers
2013	A	`conf`	A Linear-Time Algorithm for Testing Outer-1-Planarity. GD Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
2013	J	`jnl`	A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
2013	B	`conf`	Circular Graph Drawings with Large Crossing Angles. WALCOM Hooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong
2013	J	`jnl`	Improving multiple aesthetics produces better graph drawings. J. Vis. Lang. Comput. Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin
2013	B	`conf`	On the faithfulness of graph visualizations. PacificVis Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong
2013	J	`jnl`	Order Preserving Matching CoRR Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama
2013	J	`jnl`	Right angle crossing graphs and 1-planarity. Discret. Appl. Math. Peter Eades, Giuseppe Liotta
2013	—	`ch.`	Symmetric Graph Drawing. Handbook of Graph Drawing and Visualization Peter Eades, Seok-Hee Hong
2012	J	`jnl`	Bounds on the crossing resolution of complete geometric graphs. Discret. Appl. Math. Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta
2012	J	`jnl`	Every outer-1-Plane Graph has a Right Angle Crossing Drawing. Int. J. Comput. Geom. Appl. Hooman Reisi Dehkordi, Peter Eades
2012	Misc	`conf`	Fáry's Theorem for 1-Planar Graphs. COCOON Seok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon
2012	—	`ch.`	How to Draw a Graph, Revisited. Expanding the Frontiers of Visual Analytics and Visualization Peter Eades, Seok-Hee Hong
2012	A	`conf`	On the Faithfulness of Graph Visualizations. GD Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong
2012	A	`conf`	StreamEB: Stream Edge Bundling. GD Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong
2012	A	`conf`	Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). GD Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki
2012	B	`conf`	Visualizing dynamic trajectories in social networks. VL/HCC Hui Liu, Peter Eades, Seok-Hee Hong
2011	C	`conf`	2-Layer Right Angle Crossing Drawings. IWOCA Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta
2011	J	`jnl`	Drawing graphs with right angle crossings. Theor. Comput. Sci. Walter Didimo, Peter Eades, Giuseppe Liotta
2011	A	`conf`	Kozo Sugiyama 1945 - 2011. GD Peter Eades, Seok-Hee Hong, Kazuo Misue
2011	A	`conf`	Right Angle Crossing Graphs and 1-Planarity. GD Peter Eades, Giuseppe Liotta
2011	A	`conf`	TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. GD Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades
2010	J	`jnl`	A Force-Directed Method for Large Crossing Angle Graph Drawing CoRR Peter Eades, Weidong Huang, Seok-Hee Hong
2010	J	`jnl`	A characterization of complete bipartite RAC graphs. Inf. Process. Lett. Walter Didimo, Peter Eades, Giuseppe Liotta
2010	B	`conf`	Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. VL/HCC Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin
2010	A	`conf`	Large Crossing Angles in Circular Layouts. GD Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang
2009	B	`conf`	A graph reading behavior: Geodesic-path tendency. PacificVis Weidong Huang, Peter Eades, Seok-Hee Hong
2009	B	`conf`	Drawing Graphs with Right Angle Crossings. WADS Walter Didimo, Peter Eades, Giuseppe Liotta
2009	B	`ed.`	IEEE Pacific Visualization Symposium PacificVis 2009, Beijing, China, April 20-23, 2009 PacificVis Peter Eades, Thomas Ertl, Han-Wei Shen
2009	J	`jnl`	Issues for the Evaluation of Ambient Displays. Int. J. Ambient Comput. Intell. Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong
2009	J	`jnl`	Measuring effectiveness of graph visualizations: A cognitive load perspective. Inf. Vis. Weidong Huang, Peter Eades, Seok-Hee Hong
2009	A	`conf`	On Rectilinear Drawing of Graphs. GD Peter Eades, Seok-Hee Hong, Sheung-Hung Poon
2008	—	`conf`	Beyond time and error: a cognitive approach to the evaluation of graph drawings. BELIV Weidong Huang, Peter Eades, Seok-Hee Hong
2008	B	`conf`	Effects of Crossing Angles. PacificVis Weidong Huang, Seok-Hee Hong, Peter Eades
2008	B	`conf`	Some Constrained Notions of Planarity. ISAAC Peter Eades
2008	—	`conf`	The long-term evaluation of BELIV Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong
2008	J	`jnl`	User Hints for map labeling. J. Vis. Lang. Comput. Hugo A. D. do Nascimento, Peter Eades
2007	J	`jnl`	Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. J. Graph Algorithms Appl. Weidong Huang, Seok-Hee Hong, Peter Eades
2007	J	`jnl`	Guest Editor's Foreword. J. Graph Algorithms Appl. Peter Eades, Patrick Healy
2007	—	`conf`	HxI : An Australian Initiative in ICT-Augmented Human Interactivity. INTERACT (2) Christian Müller-Tomfelde, Belinda Kellar, Peter Eades
2007	—	`conf`	Intrusive and Non-intrusive Evaluation of Ambient Displays. Ambient Information Systems Xiaobin Shen, Peter Eades, Seok-Hee Hong, Andrew Vande Moere
2006	J	`jnl`	A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Discret. Comput. Geom. Seok-Hee Hong, Brendan D. McKay, Peter Eades
2006	J	`jnl`	Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Algorithmica Seok-Hee Hong, Peter Eades
2006	—	`conf`	How people read sociograms: a questionnaire study. APVIS Weidong Huang, Seok-Hee Hong, Peter Eades
2006	—	`ch.`	Information Display. Handbook of Nature-Inspired and Innovative Computing Peter Eades, Seok-Hee Hong, Keith Nesbitt, Masahiro Takatsuka
2006	—	`conf`	Predicting graph reading performance: a cognitive approach. APVIS Weidong Huang, Seok-Hee Hong, Peter Eades
2006	J	`jnl`	Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi
2006	—	`conf`	ViCAT: Visualisation and Interaction on a Collaborative Access Table. Tabletop Fang Chen, Peter Eades, Julien Epps, Serge Lichman, Benjamin Close, Peter Hutterer, Masahiro Takatsuka, Bruce H. Thomas, Mike Wu
2005	C	`conf`	A Framework for Visualising Large Graphs. IV Wanchun Li, Seok-Hee Hong, Peter Eades
2005	—	`conf`	A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization. ACSC Xiaodi Huang, Peter Eades, Wei Lai
2005	—	`conf`	An intrusive evaluation of peripheral display. GRAPHITE Xiaobin Shen, Andrew Vande Moere, Peter Eades
2005	—	`conf`	Automatic Camera Path Generation for Graph Navigation in 3D. APVIS Adel Ahmed, Peter Eades
2005	—	`conf`	Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. APVIS Lanbo Zheng, Le Song, Peter Eades
2005	J	`jnl`	Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica Seok-Hee Hong, Peter Eades
2005	—	`conf`	How People Read Graphs. APVIS Weidong Huang, Peter Eades
2005	A	`conf`	Layout Effects on Sociogram Perception. GD Weidong Huang, Seok-Hee Hong, Peter Eades
2005	B	`conf`	Navigating Software Architectures with Constant Visual Complexity. VL/HCC Wanchun Li, Peter Eades, Seok-Hee Hong
2005	J	`jnl`	User hints: a framework for interactive optimization. Future Gener. Comput. Syst. Hugo A. D. do Nascimento, Peter Eades
2005	—	`conf`	Using MoneyColor to Represent Financial Data. APVIS Xiaobin Shen, Peter Eades
2005	—	`conf`	Using Spring Algorithms to Remove Node Overlapping. APVIS Wanchun Li, Peter Eades, Nikola S. Nikolov
2004	A	`conf`	A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. GD Seok-Hee Hong, Peter Eades
2004	—	`ch.`	Drawing Graphs. Handbook of Data Structures and Applications Peter Eades, Seok-Hee Hong
2004	J	`jnl`	Linkless symmetric drawings of series parallel digraphs. Comput. Geom. Seok-Hee Hong, Peter Eades, Jonathan Hillman
2004	C	`conf`	Using MoneyTree To Represent Financial Data. IV Xiaobin Shen, Peter Eades
2003	J	`jnl`	An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim. Hiroshi Nagamochi, Peter Eades
2003	J	`jnl`	Drawing Trees Symmetrically in Three Dimensions. Algorithmica Seok-Hee Hong, Peter Eades
2003	A	`conf`	Graph Drawing Contest Report. GD Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks
2003	A	`conf`	HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. GD Colin Murray, Carsten Friedrich, Peter Eades
2003	—	`conf`	MoneyTree: Ambient Information Visualization Of Financial Data. VIP Peter Eades, Xiaobin Shen
2003	J	`jnl`	On-Line Visualization and Navigation of the Global Web Structure. Int. J. Softw. Eng. Knowl. Eng. Mao Lin Huang, Peter Eades, Wei Lai
2003	J	`jnl`	Skewness of Graphs with Small Cutsets. Graphs Comb. Graham Farr, Peter Eades
2003	B	`conf`	Symmetric Layout of Disconnected Graphs. ISAAC Seok-Hee Hong, Peter Eades
2003	J	`jnl`	Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. Xuemin Lin, Peter Eades
2003	—	`conf`	User Hints for Map Labelling. ACSC Hugo A. D. do Nascimento, Peter Eades
2002	C	`conf`	A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing. HIS Hugo A. D. do Nascimento, Peter Eades
2002	J	`jnl`	Foreword. Theor. Comput. Sci. Ding-Zhu Du, Peter Eades, Xuemin Lin
2002	J	`jnl`	Graph Drawing in Motion. J. Graph Algorithms Appl. Carsten Friedrich, Peter Eades
2002	J	`jnl`	Removing edge-node intersections in drawings of graphs. Inf. Process. Lett. Wei Lai, Peter Eades
2002	A*	`conf`	Symmetric drawings of triconnected planar graphs. SODA Seok-Hee Hong, Brendan D. McKay, Peter Eades
2002	—	`ed.`	Visualisation 2002, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2002 VIP Jesse S. Jin, Peter Eades, David Dagan Feng, Hong Yan
2002	C	`conf`	Visualising a Fund Manager Flow Graph with Columns and Worms. IV Tim Dwyer, Peter Eades
2002	J	`jnl`	Width-restricted layering of acyclic digraphs with consideration of dummy nodes. Inf. Process. Lett. Jürgen Branke, Stefan Leppert, Martin Middendorf, Peter Eades
2001	B	`ed.`	Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings ISAAC Peter Eades, Tadao Takaoka
2001	—	`ed.`	Australasian Symposium on Information Visualisation, InVis.au, Sydney, Australia, 3-4 December 2001 InVis.au Peter Eades, Tim Pattison
2001	—	`conf`	Graphs in Software Visualization - Introduction. Software Visualization Petra Mutzel, Peter Eades
2001	A	`conf`	User Hints for Directed Graph Drawing. GD Hugo A. D. do Nascimento, Peter Eades
2001	—	`ed.`	Visualisation 2000, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2000 VIP Peter Eades, Jesse S. Jin
2001	—	`ed.`	Visualisation 2001, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2001 VIP David Dagan Feng, Jesse S. Jin, Peter Eades, Hong Yan
2000	—	`conf`	A Multi-agent Approach using A-Teams for Graph Drawing. IS Hugo A. D. do Nascimento, Peter Eades, Candido Ferreira Xavier de Mendonça Neto
2000	—	`conf`	A System for Graph Clustering Based on User Hints. VIP Hugo A. D. do Nascimento, Peter Eades
2000	B	`conf`	An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. ISAAC Seok-Hee Hong, Peter Eades
2000	A	`conf`	An Algorithm for Finding Three Dimensional Symmetry in Trees. GD Seok-Hee Hong, Peter Eades
2000	Misc	`ed.`	Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings COCOON Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma
2000	A	`conf`	Drawing Hypergraphs in the Subset Standard (Short Demo Paper). GD François Bertault, Peter Eades
2000	J	`jnl`	Drawing series parallel digraphs symmetrically. Comput. Geom. Seok-Hee Hong, Peter Eades, Sang Ho Lee
2000	A	`conf`	FADE: Graph Drawing, Clustering, and Visual Abstraction. GD Aaron J. Quigley, Peter Eades
2000	—	`conf`	Graph Library Design. SCCC François Bertault, Peter Eades
2000	J	`jnl`	Navigating Clustered Graphs Using Force-Directed Methods. J. Graph Algorithms Appl. Peter Eades, Mao Lin Huang
2000	J	`jnl`	Spring algorithms and symmetry. Theor. Comput. Sci. Peter Eades, Xuemin Lin
2000	A	`conf`	The Marey Graph Animation Tool Demo. GD Carsten Friedrich, Peter Eades
2000	J	`jnl`	Three-dimensional orthogonal graph drawing algorithms. Discret. Appl. Math. Peter Eades, Antonios Symvonis, Sue Whitesides
1999	Misc	`conf`	Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON Xuemin Lin, Peter Eades
1999	J	`jnl`	Drawing Clustered Graphs on an Orthogonal Grid. J. Graph Algorithms Appl. Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi
1999	—	`ch.`	Graph Drawing Algorithms. Algorithms and Theory of Computation Handbook Peter Eades, Petra Mutzel
1999	—	`book`	Graph Drawing: Algorithms for the Visualization of Graphs Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis
1998	A	`conf`	A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. GD Mao Lin Huang, Peter Eades
1998	A	`conf`	Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. GD Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee
1998	B	`conf`	Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. IPCO Hiroshi Nagamochi, Peter Eades
1998	B	`conf`	Finding Planar Geometric Automorphisms in Planar Graphs. ISAAC Seok-Hee Hong, Peter Eades, Sang Ho Lee
1998	A	`conf`	Graph-Drawing Contest Report. GD Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North
1998	J	`jnl`	On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm. J. Vis. Lang. Comput. Mao Lin Huang, Peter Eades, Junhu Wang
1998	—	`conf`	Routing Drawings in Diagram Displays. APCHI Wei Lai, Peter Eades
1998	J	`jnl`	WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping. Comput. Networks Mao Lin Huang, Peter Eades, Robert F. Cohen
1997	A	`conf`	Area Requirements for Drawing Hierarchically Planar Graphs. GD Xuemin Lin, Peter Eades
1997	A	`conf`	Drawing Clustered Graphs on an Orthogonal Grid. GD Peter Eades, Qing-Wen Feng
1997	A	`conf`	Finding the Best Viewpoints for Three-Dimensional Graph Drawings. GD Peter Eades, Michael E. Houle, Richard Webber
1997	A	`conf`	Graph-Drawing Contest Report. GD Peter Eades, Joe Marks, Stephen C. North
1997	A	`conf`	Online Animated Graph Drawing for Web Navigation. GD Peter Eades, Robert F. Cohen, Mao Lin Huang
1997	Misc	`conf`	Spring Algorithms and Symmetry. COCOON Peter Eades, Xuemin Lin
1997	J	`jnl`	Three-Dimensional Graph Drawing. Algorithmica Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
1996	J	`jnl`	An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geom. Appl. Peter Eades, Xuemin Lin, Roberto Tamassia
1996	Misc	`conf`	Graph Drawing Methods. ICCS Peter Eades
1996	A	`conf`	Graph-Drawing Contest Report. GD Peter Eades, Joe Marks, Stephen C. North
1996	A	`conf`	Multilevel Visualization of Clustered Graphs. GD Peter Eades, Qing-Wen Feng
1996	A	`conf`	Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. GD Peter Eades, Qing-Wen Feng, Xuemin Lin
1996	J	`jnl`	The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. Theor. Comput. Sci. Peter Eades, Sue Whitesides
1996	J	`jnl`	The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. Algorithmica Peter Eades, Sue Whitesides
1996	J	`jnl`	The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. Inf. Process. Lett. Peter Eades, Charles Stirk, Sue Whitesides
1996	A	`conf`	Two Algorithms for Three Dimensional Orthogonal Graph Drawing. GD Peter Eades, Antonios Symvonis, Sue Whitesides
1996	J	`jnl`	Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nord. J. Comput. Peter Eades, J. Mark Keil, Paul D. Manuel, Mirka Miller
1995	J	`jnl`	A heuristic for the feedback arc set problem. Australas. J Comb. Peter Eades, Xuemin Lin
1995	B	`ed.`	Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings ISAAC John Staples, Peter Eades, Naoki Katoh, Alistair Moffat
1995	A	`conf`	Drawing Stressed Planar Graphs in Three Dimensions. GD Peter Eades, Patrick Garvan
1995	A	`conf`	Graph-Drawing Contest Report. GD Peter Eades, Joe Marks
1995	J	`jnl`	Guest editors' foreword. J. Vis. Lang. Comput. Isabel F. Cruz, Peter Eades
1995	Misc	`conf`	How to Draw a Planar Clustered Graph. COCOON Qing-Wen Feng, Robert F. Cohen, Peter Eades
1995	J	`jnl`	Layout Adjustment and the Mental Map. J. Vis. Lang. Comput. Kazuo Misue, Peter Eades, Wei Lai, Kozo Sugiyama
1995	B	`conf`	Nearest Neighbour Graph Realizability is NP-hard. LATIN Peter Eades, Sue Whitesides
1995	A	`conf`	Planarity for Clustered Graphs. ESA Qing-Wen Feng, Robert F. Cohen, Peter Eades
1995	A	`conf`	Vertex Splitting and Tension-Free Layout GD Peter Eades, Candido Ferreira Xavier de Mendonça Neto
1994	J	`jnl`	Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis
1994	J	`jnl`	Drawing Graphs in Two Layers. Theor. Comput. Sci. Peter Eades, Sue Whitesides
1994	J	`jnl`	Edge Crossings in Drawings of Bipartite Graphs. Algorithmica Peter Eades, Nicholas C. Wormald
1994	A	`conf`	Graph Drawing Contest Report. GD Peter Eades, Joe Marks
1994	A	`conf`	Integration of Declarative and Algorithmic Approaches for Layout Creation. GD Tao Lin, Peter Eades
1994	—	`conf`	The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. SCG Peter Eades, Sue Whitesides
1994	A	`conf`	Three-Dimensional Graph Drawing. GD Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
1994	—	`conf`	Volume upper bounds for 3D graph drawing. CASCON Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
1993	J	`jnl`	A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. Peter Eades, Xuemin Lin, W. F. Smyth
1993	J	`jnl`	Algorithms for drawing trees (abstract). SIGACT News Peter Eades
1993	J	`jnl`	Performance Guarantees for Motion Planning with Temporal Uncertainty. Aust. Comput. J. Peter Eades, Xuemin Lin, Nicholas C. Wormald
1993	J	`jnl`	The complexity of computing minimum separating polygons. Pattern Recognit. Lett. Peter Eades, David Rappaport
1993	J	`jnl`	Two Tree Drawing Conventions. Int. J. Comput. Geom. Appl. Peter Eades, Tao Lin, Xuemin Lin
1992	B	`conf`	Minimum Size h-v Drawings. Advanced Visual Interfaces Peter Eades, Tao Lin, Xuemin Lin
1990	J	`jnl`	Fixed edge-length graph drawing is NP-hard. Discret. Appl. Math. Peter Eades, Nicholas C. Wormald
1989	—	`conf`	How to draw a directed graph. VL Peter Eades, Xuemin Lin
1984	J	`jnl`	An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property. Inf. Process. Lett. Peter Eades, Brendan D. McKay
1984	J	`jnl`	Some Hamilton Paths and a Minimal Change Algorithm. J. ACM Peter Eades, Michael Hickey, Ronald C. Read
1983	J	`jnl`	A lower-bound for the number of productions required for a certain class of languages. Discret. Appl. Math. Brian Alspach, Peter Eades, Gordon Rose
1981	J	`jnl`	On Optimal Trees. J. Algorithms Peter Eades, John Staples