default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Eades
Person information
- affiliation: University of Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j72]Amyra Meidiana
, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
Automorphism Faithfulness Metrics for Symmetric Graph Drawings. IEEE Trans. Vis. Comput. Graph. 30(7): 3241-3255 (2024)- [j71]Amyra Meidiana, Seok-Hee Hong, Shijun Cai, Marnijati Torkel, Peter Eades:
SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing. IEEE Trans. Vis. Comput. Graph. 30(7): 3386-3399 (2024) - [c120]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:
GraphTrials: Visual Proofs of Graph Properties. GD 2024: 16:1-16:18 - [c119]Shijun Cai, Seok-Hee Hong, Amyra Meidiana, Peter Eades, Daniel A. Keim:
Cluster-Faithful Graph Visualization: New Metrics and Algorithms. PacificVis 2024: 192-201 - [i18]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:
GraphTrials: Visual Proofs of Graph Properties. CoRR abs/2409.02907 (2024) - 2023
- [c118]Peter Eades, Niklas Gröne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber:
CelticGraph: Drawing Graphs as Celtic Knots and Links. GD (1) 2023: 18-35 - [i17]Peter Eades, Niklas Gröne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber:
CelticGraph: Drawing Graphs as Celtic Knots and Links. CoRR abs/2309.02852 (2023) - 2022
- [c117]Seok-Hee Hong, Amyra Meidiana, James Wood, Juan Pablo Ataides, Peter Eades, Kunsoo Park:
dGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization. PacificVis 2022: 51-60 - [c116]Amyra Meidiana, Seok-Hee Hong, Peter Eades:
Shape-Faithful Graph Drawings. GD 2022: 93-108 - [c115]Peter Eades, Seok-Hee Hong, Martin McGrane, Amyra Meidiana:
GDot-i: Interactive System for Dot Paintings of Graphs. EuroVis (Posters) 2022: 5-6 - [c114]Amyra Meidiana, Seok-Hee Hong, Yanyi Pu, Justin Lee, Peter Eades, Jinwook Seo:
DSS: Drawing Dynamic Graphs with Spectral Sparsification. EuroVis (Short Papers) 2022: 55-59 - [i16]Amyra Meidiana, Seok-Hee Hong, Peter Eades:
Shape-Faithful Graph Drawings. CoRR abs/2208.14095 (2022) - 2021
- [j70]Jingming Hu, Tuan Tran Chu, Seok-Hee Hong, Jialu Chen, Amyra Meidiana, Marnijati Torkel, Peter Eades, Kwan-Liu Ma:
BC tree-based spectral sampling for big complex network visualization. Appl. Netw. Sci. 6(1): 60 (2021) - [c113]Amyra Meidiana, Seok-Hee Hong, Shijun Cai, Marnijati Torkel, Peter Eades:
Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing. PacificVis 2021: 146-150 - [c112]Seok-Hee Hong, Peter Eades, Marnijati Torkel, James Wood, Kunsoo Park:
Louvain-based Multi-level Graph Drawing. PacificVis 2021: 151-155 - [c111]Seok-Hee Hong, Peter Eades, Marnijati Torkel:
GDot: Drawing Graphs with Dots and Circles. PacificVis 2021: 156-165 - 2020
- [j69]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Graph Planarity by Replacing Cliques with Paths. Algorithms 13(8): 194 (2020) - [j68]Amyra Meidiana, Seok-Hee Hong, Marnijati Torkel, Shijun Cai, Peter Eades:
Sublinear Time Force Computation for Big Complex Network Visualization. Comput. Graph. Forum 39(3): 579-591 (2020) - [j67]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline drawings with topological constraints. Theor. Comput. Sci. 809: 250-264 (2020) - [c110]Seok-Hee Hong, Peter Eades, Marnijati Torkel, Weidong Huang, Cristina Cifuentes:
Dynamic Graph Map Animation. PacificVis 2020: 1-6 - [c109]Joseph Kotlarek, Oh-Hyun Kwon, Kwan-Liu Ma, Peter Eades, Andreas Kerren, Karsten Klein, Falk Schreiber:
A Study of Mental Maps in Immersive Network Visualization. PacificVis 2020: 1-10 - [c108]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
Quality Metrics for Symmetric Graph Drawings. PacificVis 2020: 11-15 - [c107]Jingming Hu, Seok-Hee Hong, Jialu Chen, Marnijati Torkel, Peter Eades, Kwan-Liu Ma:
Connectivity-Based Spectral Sampling for Big Complex Network Visualization. COMPLEX NETWORKS (1) 2020: 237-248 - [c106]Amyra Meidiana, Seok-Hee Hong, Peter Eades:
New Quality Metrics for Dynamic Graph Drawing. GD 2020: 450-465 - [i15]Joseph Kotlarek, Oh-Hyun Kwon, Kwan-Liu Ma, Peter Eades, Andreas Kerren, Karsten Klein, Falk Schreiber:
A Study of Mental Maps in Immersive Network Visualization. CoRR abs/2001.06462 (2020) - [i14]Amyra Meidiana, Seok-Hee Hong, Peter Eades:
New Quality Metrics for Dynamic Graph Drawing. CoRR abs/2008.07764 (2020)
2010 – 2019
- 2019
- [j66]Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades:
Acute Constraints in Straight-Line Drawings of Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 994-1001 (2019) - [j65]Kenichi Koizumi, Peter Eades, Kei Hiraki, Mary Inaba:
BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure. Int. J. Data Sci. Anal. 7(1): 17-34 (2019) - [c105]Jingming Hu, Seok-Hee Hong, Peter Eades:
Spectral Vertex Sampling for Big Complex Graphs. COMPLEX NETWORKS (2) 2019: 216-227 - [c104]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
A Quality Metric for Visualization of Clusters in Graphs. GD 2019: 125-138 - [c103]Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi:
Multi-level Graph Drawing Using Infomap Clustering. GD 2019: 139-146 - [c102]Amyra Meidiana, Seok-Hee Hong, Jiajun Huang, Peter Eades, Kwan-Liu Ma:
Topology-Based Spectral Sparsification. LDAV 2019: 73-82 - [i13]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
A Quality Metric for Visualization of Clusters in Graphs. CoRR abs/1908.07792 (2019) - [i12]Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi:
Multi-level Graph Drawing using Infomap Clustering. CoRR abs/1908.08151 (2019) - [i11]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
A Quality Metric for Symmetric Graph Drawings. CoRR abs/1910.04974 (2019) - 2018
- [j64]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:
Gap-planar graphs. Theor. Comput. Sci. 745: 36-52 (2018) - [c101]Seok-Hee Hong, Quan Hoang Nguyen, Amyra Meidiana, Jiaxi Li, Peter Eades:
BC Tree-Based Proxy Graphs for Visualization of Big Graphs. PacificVis 2018: 11-20 - [c100]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Turning Cliques into Paths to Achieve Planarity. GD 2018: 67-74 - [c99]Peter Eades, Patrick Healy, Nikola S. Nikolov:
The Weighted Barycenter Drawing Recognition Problem. GD 2018: 569-575 - [c98]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline Drawings with Topological Constraints. ISAAC 2018: 39:1-39:13 - [p4]Peter Eades, Karsten Klein:
Graph Visualization. Graph Data Management 2018: 33-70 - [i10]Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini:
Turning Cliques into Paths to Achieve Planarity. CoRR abs/1808.08925 (2018) - [i9]Peter Eades, Patrick Healy, Nikola S. Nikolov:
The Weighted Barycenter Drawing Recognition Problem. CoRR abs/1809.00628 (2018) - [i8]Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani:
Polyline Drawings with Topological Constraints. CoRR abs/1809.08111 (2018) - 2017
- [j63]Peter Eades, Seok-Hee Hong, An Nguyen, Karsten Klein:
Shape-Based Quality Metrics for Large Graph Visualization. J. Graph Algorithms Appl. 21(1): 29-53 (2017) - [j62]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades, Amyra Meidiana:
Proxy Graph: Visual Quality Metrics of Big Graph Sampling. IEEE Trans. Vis. Comput. Graph. 23(6): 1600-1611 (2017) - [c97]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades:
dNNG: Quality metrics and layout for neighbourhood faithfulness. PacificVis 2017: 290-294 - [c96]Kenichi Koizumi, Peter Eades, Kei Hiraki, Mary Inaba:
BJR-Tree: Fast Skyline Computation Algorithm for Serendipitous Searching Problems. DSAA 2017: 272-282 - [c95]Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong:
Drawing Big Graphs Using Spectral Sparsification. GD 2017: 272-286 - [c94]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:
Gap-Planar Graphs. GD 2017: 531-545 - [i7]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
Towards Faithful Graph Visualizations. CoRR abs/1701.00921 (2017) - [i6]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:
Gap-planar Graphs. CoRR abs/1708.07653 (2017) - [i5]Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong:
Drawing Big Graphs using Spectral Sparsification. CoRR abs/1708.08659 (2017) - 2016
- [j61]Hooman Reisi Dehkordi, Peter Eades, Seok-Hee Hong, Quan Hoang Nguyen:
Circular right-angle crossing drawings in linear time. Theor. Comput. Sci. 639: 26-41 (2016) - [c93]Weidong Huang, Peter Eades, Seok-Hee Hong, Henry Been-Lirn Duh:
Effects of curves on graph perception. PacificVis 2016: 199-203 - [c92]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. GD 2016: 532-545 - [i4]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. CoRR abs/1608.08427 (2016) - 2015
- [j60]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica 72(4): 1033-1054 (2015) - [c91]Peter Eades, Seok-Hee Hong, Karsten Klein, An Nguyen:
Shape-Based Quality Metrics for Large Graph Visualization. GD 2015: 502-514 - [c90]Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon:
Straight-Line Drawability of a Planar Graph Plus an Edge. WADS 2015: 301-313 - [i3]Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon:
Straight-line Drawability of a Planar Graph Plus an Edge. CoRR abs/1504.06540 (2015) - 2014
- [j59]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. Algorithmica 68(4): 954-997 (2014) - [j58]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order-preserving matching. Theor. Comput. Sci. 525: 68-79 (2014) - [j57]Weidong Huang, Peter Eades, Seok-Hee Hong:
Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4): 452-465 (2014) - [c89]Michael R. Marner, Ross T. Smith, Bruce H. Thomas, Karsten Klein, Peter Eades, Seok-Hee Hong:
GION: Interactively Untangling Large Graphs on Wall-Sized Displays. GD 2014: 113-124 - [c88]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:
Spatial augmented reality - A tool for 3D data visualization. 3DVis@IEEE VIS 2014: 45-50 - 2013
- [j56]Peter Eades, Giuseppe Liotta:
Right angle crossing graphs and 1-planarity. Discret. Appl. Math. 161(7-8): 961-969 (2013) - [j55]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513: 65-76 (2013) - [j54]Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin:
Improving multiple aesthetics produces better graph drawings. J. Vis. Lang. Comput. 24(4): 262-272 (2013) - [c87]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
On the faithfulness of graph visualizations. PacificVis 2013: 209-216 - [c86]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. GD 2013: 71-82 - [c85]Hooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
Circular Graph Drawings with Large Crossing Angles. WALCOM 2013: 298-309 - [r2]Peter Eades, Seok-Hee Hong:
Symmetric Graph Drawing. Handbook of Graph Drawing and Visualization 2013: 87-113 - [i2]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order Preserving Matching. CoRR abs/1302.4064 (2013) - 2012
- [j53]Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta:
Bounds on the crossing resolution of complete geometric graphs. Discret. Appl. Math. 160(1-2): 132-139 (2012) - [j52]Hooman Reisi Dehkordi, Peter Eades:
Every outer-1-Plane Graph has a Right Angle Crossing Drawing. Int. J. Comput. Geom. Appl. 22(6): 543-558 (2012) - [c84]Seok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon:
Fáry's Theorem for 1-Planar Graphs. COCOON 2012: 335-346 - [c83]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). GD 2012: 339-345 - [c82]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
StreamEB: Stream Edge Bundling. GD 2012: 400-413 - [c81]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
On the Faithfulness of Graph Visualizations. GD 2012: 566-568 - [c80]Hui Liu, Peter Eades, Seok-Hee Hong:
Visualizing dynamic trajectories in social networks. VL/HCC 2012: 197-204 - [p3]Peter Eades, Seok-Hee Hong:
How to Draw a Graph, Revisited. Expanding the Frontiers of Visual Analytics and Visualization 2012: 111-126 - 2011
- [j51]Walter Didimo, Peter Eades, Giuseppe Liotta:
Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39): 5156-5166 (2011) - [c79]Peter Eades, Seok-Hee Hong, Kazuo Misue:
Kozo Sugiyama 1945 - 2011. GD 2011: 1 - [c78]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades:
TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. GD 2011: 123-135 - [c77]Peter Eades, Giuseppe Liotta:
Right Angle Crossing Graphs and 1-Planarity. GD 2011: 148-153 - [c76]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta:
2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169 - 2010
- [j50]Walter Didimo, Peter Eades, Giuseppe Liotta:
A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16): 687-691 (2010) - [c75]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang:
Large Crossing Angles in Circular Layouts. GD 2010: 397-399 - [c74]Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin:
Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. VL/HCC 2010: 176-183 - [i1]Peter Eades, Weidong Huang, Seok-Hee Hong:
A Force-Directed Method for Large Crossing Angle Graph Drawing. CoRR abs/1012.4559 (2010)
2000 – 2009
- 2009
- [j49]Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong:
Issues for the Evaluation of Ambient Displays. Int. J. Ambient Comput. Intell. 1(2): 59-69 (2009) - [j48]Weidong Huang, Peter Eades, Seok-Hee Hong:
Measuring effectiveness of graph visualizations: A cognitive load perspective. Inf. Vis. 8(3): 139-152 (2009) - [c73]Weidong Huang, Peter Eades, Seok-Hee Hong:
A graph reading behavior: Geodesic-path tendency. PacificVis 2009: 137-144 - [c72]Peter Eades, Seok-Hee Hong, Sheung-Hung Poon:
On Rectilinear Drawing of Graphs. GD 2009: 232-243 - [c71]Walter Didimo, Peter Eades, Giuseppe Liotta:
Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217 - [e8]Peter Eades, Thomas Ertl, Han-Wei Shen:
IEEE Pacific Visualization Symposium PacificVis 2009, Beijing, China, April 20-23, 2009. IEEE Computer Society 2009, ISBN 978-1-4244-4404-5 [contents] - 2008
- [j47]Hugo A. D. do Nascimento, Peter Eades:
User Hints for map labeling. J. Vis. Lang. Comput. 19(1): 39-74 (2008) - [c70]Weidong Huang, Seok-Hee Hong, Peter Eades:
Effects of Crossing Angles. PacificVis 2008: 41-46 - [c69]Weidong Huang, Peter Eades, Seok-Hee Hong:
Beyond time and error: a cognitive approach to the evaluation of graph drawings. BELIV 2008: 3 - [c68]Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong:
The long-term evaluation of Fisherman in a partial-attention environment. BELIV 2008: 10 - [c67]Peter Eades:
Some Constrained Notions of Planarity. ISAAC 2008: 2 - 2007
- [j46]Peter Eades, Patrick Healy:
Guest Editor's Foreword. J. Graph Algorithms Appl. 11(2): 323-324 (2007) - [j45]Weidong Huang, Seok-Hee Hong, Peter Eades:
Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. J. Graph Algorithms Appl. 11(2): 397-429 (2007) - [c66]Christian Müller-Tomfelde, Belinda Kellar, Peter Eades:
HxI : An Australian Initiative in ICT-Augmented Human Interactivity. INTERACT (2) 2007: 675-676 - [c65]Xiaobin Shen, Peter Eades, Seok-Hee Hong, Andrew Vande Moere:
Intrusive and Non-intrusive Evaluation of Ambient Displays. Ambient Information Systems 2007 - 2006
- [j44]Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica 44(1): 1-32 (2006) - [j43]Seok-Hee Hong, Peter Eades:
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Algorithmica 44(1): 67-100 (2006) - [j42]Seok-Hee Hong, Brendan D. McKay, Peter Eades:
A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Discret. Comput. Geom. 36(2): 283-311 (2006) - [c64]Weidong Huang, Seok-Hee Hong, Peter Eades:
How people read sociograms: a questionnaire study. APVIS 2006: 199-206 - [c63]Weidong Huang, Seok-Hee Hong, Peter Eades:
Predicting graph reading performance: a cognitive approach. APVIS 2006: 207-216 - [c62]Fang Chen, Peter Eades, Julien Epps, Serge Lichman, Benjamin Close, Peter Hutterer, Masahiro Takatsuka, Bruce H. Thomas, Mike Wu:
ViCAT: Visualisation and Interaction on a Collaborative Access Table. Tabletop 2006: 59-62 - [p2]Peter Eades, Seok-Hee Hong, Keith Nesbitt, Masahiro Takatsuka:
Information Display. Handbook of Nature-Inspired and Innovative Computing 2006: 633-655 - 2005
- [j41]Seok-Hee Hong, Peter Eades:
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica 42(2): 159-197 (2005) - [j40]Hugo A. D. do Nascimento, Peter Eades:
User hints: a framework for interactive optimization. Future Gener. Comput. Syst. 21(7): 1171-1191 (2005) - [c61]Xiaodi Huang, Peter Eades, Wei Lai:
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization. ACSC 2005: 87-96 - [c60]Adel Ahmed, Peter Eades:
Automatic Camera Path Generation for Graph Navigation in 3D. APVIS 2005: 27-32 - [c59]Lanbo Zheng, Le Song, Peter Eades:
Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. APVIS 2005: 33-37 - [c58]Weidong Huang, Peter Eades:
How People Read Graphs. APVIS 2005: 51-58 - [c57]Xiaobin Shen, Peter Eades:
Using MoneyColor to Represent Financial Data. APVIS 2005: 125-129 - [c56]Wanchun Li, Peter Eades, Nikola S. Nikolov:
Using Spring Algorithms to Remove Node Overlapping. APVIS 2005: 131-140 - [c55]Weidong Huang, Seok-Hee Hong, Peter Eades:
Layout Effects on Sociogram Perception. GD 2005: 262-273 - [c54]Xiaobin Shen, Andrew Vande Moere, Peter Eades:
An intrusive evaluation of peripheral display. GRAPHITE 2005: 289-292 - [c53]Wanchun Li, Seok-Hee Hong, Peter Eades:
A Framework for Visualising Large Graphs. IV 2005: 528-535 - [c52]Wanchun Li, Peter Eades, Seok-Hee Hong:
Navigating Software Architectures with Constant Visual Complexity. VL/HCC 2005: 225-232 - 2004
- [j39]Seok-Hee Hong, Peter Eades, Jonathan Hillman:
Linkless symmetric drawings of series parallel digraphs. Comput. Geom. 29(3): 191-221 (2004) - [c51]Seok-Hee Hong, Peter Eades:
A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. GD 2004: 307-317 - [c50]Xiaobin Shen, Peter Eades:
Using MoneyTree To Represent Financial Data. IV 2004: 285-289 - [r1]Peter Eades, Seok-Hee Hong:
Drawing Graphs. Handbook of Data Structures and Applications 2004 - 2003
- [j38]Seok-Hee Hong, Peter Eades:
Drawing Trees Symmetrically in Three Dimensions. Algorithmica 36(2): 153-178 (2003) - [j37]Graham Farr, Peter Eades:
Skewness of Graphs with Small Cutsets. Graphs Comb. 19(2): 177-194 (2003) - [j36]Mao Lin Huang, Peter Eades, Wei Lai:
On-Line Visualization and Navigation of the Global Web Structure. Int. J. Softw. Eng. Knowl. Eng. 13(1): 27-52 (2003) - [j35]Hiroshi Nagamochi, Peter Eades:
An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim. 7(2): 137-159 (2003) - [j34]Xuemin Lin, Peter Eades:
Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. 292(3): 679-695 (2003) - [c49]Hugo A. D. do Nascimento, Peter Eades:
User Hints for Map Labelling. ACSC 2003: 339-347 - [c48]Colin Murray, Carsten Friedrich, Peter Eades:
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. GD 2003: 494-495 - [c47]Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks:
Graph Drawing Contest Report. GD 2003: 504-508 - [c46]Seok-Hee Hong, Peter Eades:
Symmetric Layout of Disconnected Graphs. ISAAC 2003: 405-414 - [c45]Peter Eades, Xiaobin Shen:
MoneyTree: Ambient Information Visualization Of Financial Data. VIP 2003: 15-18 - 2002
- [j33]Jürgen Branke, Stefan Leppert, Martin Middendorf, Peter Eades:
Width-restricted layering of acyclic digraphs with consideration of dummy nodes. Inf. Process. Lett. 81(2): 59-63 (2002) - [j32]Wei Lai, Peter Eades:
Removing edge-node intersections in drawings of graphs. Inf. Process. Lett. 81(2): 105-110 (2002) - [j31]Carsten Friedrich, Peter Eades:
Graph Drawing in Motion. J. Graph Algorithms Appl. 6(3): 353-370 (2002) - [j30]Ding-Zhu Du, Peter Eades, Xuemin Lin:
Foreword. Theor. Comput. Sci. 289(2): 877 (2002) - [c44]Hugo A. D. do Nascimento, Peter Eades:
A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing. HIS 2002: 634-643 - [c43]Tim Dwyer, Peter Eades:
Visualising a Fund Manager Flow Graph with Columns and Worms. IV 2002: 147-152 - [c42]Seok-Hee Hong, Brendan D. McKay, Peter Eades:
Symmetric drawings of triconnected planar graphs. SODA 2002: 356-365 - [e7]Jesse S. Jin, Peter Eades, David Dagan Feng, Hong Yan:
Visualisation 2002, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2002. CRPIT 22, Australian Computer Society 2002, ISBN 1-920682-01-5 [contents] - 2001
- [c41]Petra Mutzel, Peter Eades:
Graphs in Software Visualization - Introduction. Software Visualization 2001: 285-294 - [c40]Hugo A. D. do Nascimento, Peter Eades:
User Hints for Directed Graph Drawing. GD 2001: 205-219 - [e6]Peter Eades, Tim Pattison:
Australasian Symposium on Information Visualisation, InVis.au, Sydney, Australia, 3-4 December 2001. CRPIT 9, Australian Computer Society 2001, ISBN 0-909-92587-9 [contents] - [e5]Peter Eades, Tadao Takaoka:
Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings. Lecture Notes in Computer Science 2223, Springer 2001, ISBN 3-540-42985-9 [contents] - [e4]Peter Eades, Jesse S. Jin:
Visualisation 2000, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2000. CRPIT 2, Australian Computer Society 2001, ISBN 0-909-92580-1 [contents] - [e3]David Dagan Feng, Jesse S. Jin, Peter Eades, Hong Yan:
Visualisation 2001, Selected Papers from the Pan-Sydney Area Workshop on Visual Information Processing, VIP2001. CRPIT 11, Australian Computer Society 2001, ISBN 0-909-92589-5 [contents] - 2000
- [j29]Seok-Hee Hong, Peter Eades, Sang Ho Lee:
Drawing series parallel digraphs symmetrically. Comput. Geom. 17(3-4): 165-188 (2000) - [j28]Peter Eades, Antonios Symvonis, Sue Whitesides:
Three-dimensional orthogonal graph drawing algorithms. Discret. Appl. Math. 103(1-3): 55-87 (2000) - [j27]Peter Eades, Mao Lin Huang:
Navigating Clustered Graphs Using Force-Directed Methods. J. Graph Algorithms Appl. 4(3): 157-181 (2000) - [j26]Peter Eades, Xuemin Lin:
Spring algorithms and symmetry. Theor. Comput. Sci. 240(2): 379-405 (2000) - [c39]Hugo A. D. do Nascimento, Peter Eades, Candido Ferreira Xavier de Mendonça Neto:
A Multi-agent Approach using A-Teams for Graph Drawing. IS 2000: 39-42 - [c38]François Bertault, Peter Eades:
Drawing Hypergraphs in the Subset Standard (Short Demo Paper). GD 2000: 164-169 - [c37]Aaron J. Quigley, Peter Eades:
FADE: Graph Drawing, Clustering, and Visual Abstraction. GD 2000: 197-210 - [c36]Seok-Hee Hong, Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Trees. GD 2000: 360-371 - [c35]Carsten Friedrich, Peter Eades:
The Marey Graph Animation Tool Demo. GD 2000: 396-406 - [c34]Seok-Hee Hong, Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. ISAAC 2000: 266-277 - [c33]François Bertault, Peter Eades:
Graph Library Design. SCCC 2000: 144-151 - [c32]Hugo A. D. do Nascimento, Peter Eades:
A System for Graph Clustering Based on User Hints. VIP 2000: 73-74 - [e2]Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma:
Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Lecture Notes in Computer Science 1858, Springer 2000, ISBN 3-540-67787-9 [contents]
1990 – 1999
- 1999
- [b1]Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis:
Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall 1999, ISBN 0-13-301615-3 - [j25]Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi:
Drawing Clustered Graphs on an Orthogonal Grid. J. Graph Algorithms Appl. 3(4): 3-29 (1999) - [c31]Xuemin Lin, Peter Eades:
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON 1999: 92-102 - [p1]Peter Eades, Petra Mutzel:
Graph Drawing Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j24]Mao Lin Huang, Peter Eades, Robert F. Cohen:
WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping. Comput. Networks 30(1-7): 638-642 (1998) - [j23]Mao Lin Huang, Peter Eades, Junhu Wang:
On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm. J. Vis. Lang. Comput. 9(6): 623-645 (1998) - [c30]Wei Lai, Peter Eades:
Routing Drawings in Diagram Displays. APCHI 1998: 291-297 - [c29]Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee:
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. GD 1998: 198-209 - [c28]Mao Lin Huang, Peter Eades:
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. GD 1998: 374-383 - [c27]Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North:
Graph-Drawing Contest Report. GD 1998: 423-435 - [c26]Hiroshi Nagamochi, Peter Eades:
Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. IPCO 1998: 96-111 - [c25]Seok-Hee Hong, Peter Eades, Sang Ho Lee:
Finding Planar Geometric Automorphisms in Planar Graphs. ISAAC 1998: 277-286 - 1997
- [j22]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997) - [c24]Peter Eades, Xuemin Lin:
Spring Algorithms and Symmetry. COCOON 1997: 202-211 - [c23]Peter Eades, Michael E. Houle, Richard Webber:
Finding the Best Viewpoints for Three-Dimensional Graph Drawings. GD 1997: 87-98 - [c22]Peter Eades, Qing-Wen Feng:
Drawing Clustered Graphs on an Orthogonal Grid. GD 1997: 146-157 - [c21]Xuemin Lin, Peter Eades:
Area Requirements for Drawing Hierarchically Planar Graphs. GD 1997: 219-229 - [c20]Peter Eades, Robert F. Cohen, Mao Lin Huang:
Online Animated Graph Drawing for Web Navigation. GD 1997: 330-335 - [c19]Peter Eades, Joe Marks, Stephen C. North:
Graph-Drawing Contest Report. GD 1997: 438-445 - 1996
- [j21]Peter Eades, Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. Algorithmica 16(1): 60-82 (1996) - [j20]Peter Eades, Xuemin Lin, Roberto Tamassia:
An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geom. Appl. 6(2): 145-156 (1996) - [j19]Peter Eades, Charles Stirk, Sue Whitesides:
The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings. Inf. Process. Lett. 60(2): 97-103 (1996) - [j18]Peter Eades, J. Mark Keil, Paul D. Manuel, Mirka Miller:
Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nord. J. Comput. 3(3): 220-237 (1996) - [j17]Peter Eades, Sue Whitesides:
The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. Theor. Comput. Sci. 169(1): 23-37 (1996) - [c18]Peter Eades, Qing-Wen Feng:
Multilevel Visualization of Clustered Graphs. GD 1996: 101-112 - [c17]Peter Eades, Qing-Wen Feng, Xuemin Lin:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. GD 1996: 113-128 - [c16]Peter Eades, Joe Marks, Stephen C. North:
Graph-Drawing Contest Report. GD 1996: 129-138 - [c15]Peter Eades, Antonios Symvonis, Sue Whitesides:
Two Algorithms for Three Dimensional Orthogonal Graph Drawing. GD 1996: 139-154 - [c14]Peter Eades:
Graph Drawing Methods. ICCS 1996: 40-49 - 1995
- [j16]Peter Eades, Xuemin Lin:
A heuristic for the feedback arc set problem. Australas. J Comb. 12: 15-26 (1995) - [j15]Kazuo Misue, Peter Eades, Wei Lai, Kozo Sugiyama:
Layout Adjustment and the Mental Map. J. Vis. Lang. Comput. 6(2): 183-210 (1995) - [j14]Isabel F. Cruz, Peter Eades:
Guest editors' foreword. J. Vis. Lang. Comput. 6(3): 213-215 (1995) - [c13]Qing-Wen Feng, Robert F. Cohen, Peter Eades:
How to Draw a Planar Clustered Graph. COCOON 1995: 21-30 - [c12]Qing-Wen Feng, Robert F. Cohen, Peter Eades:
Planarity for Clustered Graphs. ESA 1995: 213-226 - [c11]Peter Eades, Candido Ferreira Xavier de Mendonça Neto:
Vertex Splitting and Tension-Free Layout. GD 1995: 202-211 - [c10]Peter Eades, Patrick Garvan:
Drawing Stressed Planar Graphs in Three Dimensions. GD 1995: 212-223 - [c9]Peter Eades, Joe Marks:
Graph-Drawing Contest Report. GD 1995: 224-233 - [c8]Peter Eades, Sue Whitesides:
Nearest Neighbour Graph Realizability is NP-hard. LATIN 1995: 245-256 - [e1]John Staples, Peter Eades, Naoki Katoh, Alistair Moffat:
Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings. Lecture Notes in Computer Science 1004, Springer 1995, ISBN 3-540-60573-8 [contents] - 1994
- [j13]Peter Eades, Nicholas C. Wormald:
Edge Crossings in Drawings of Bipartite Graphs. Algorithmica 11(4): 379-403 (1994) - [j12]Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis:
Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. 4: 235-282 (1994) - [j11]Peter Eades, Sue Whitesides:
Drawing Graphs in Two Layers. Theor. Comput. Sci. 131(2): 361-374 (1994) - [c7]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Volume upper bounds for 3D graph drawing. CASCON 1994: 11 - [c6]Peter Eades, Sue Whitesides:
The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. SCG 1994: 49-56 - [c5]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Three-Dimensional Graph Drawing. GD 1994: 1-11 - [c4]Peter Eades, Joe Marks:
Graph Drawing Contest Report. GD 1994: 143-146 - [c3]Tao Lin, Peter Eades:
Integration of Declarative and Algorithmic Approaches for Layout Creation. GD 1994: 376-387 - 1993
- [j10]Peter Eades, Xuemin Lin, Nicholas C. Wormald:
Performance Guarantees for Motion Planning with Temporal Uncertainty. Aust. Comput. J. 25(1): 21-28 (1993) - [j9]Peter Eades, Tao Lin, Xuemin Lin:
Two Tree Drawing Conventions. Int. J. Comput. Geom. Appl. 3(2): 133-153 (1993) - [j8]Peter Eades, Xuemin Lin, W. F. Smyth:
A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47(6): 319-323 (1993) - [j7]Peter Eades, David Rappaport:
The complexity of computing minimum separating polygons. Pattern Recognit. Lett. 14(9): 715-718 (1993) - [j6]Peter Eades:
Algorithms for drawing trees (abstract). SIGACT News 24(1): 57 (1993) - 1992
- [c2]Peter Eades, Tao Lin, Xuemin Lin:
Minimum Size h-v Drawings. Advanced Visual Interfaces 1992: 386-394 - 1990
- [j5]Peter Eades, Nicholas C. Wormald:
Fixed edge-length graph drawing is NP-hard. Discret. Appl. Math. 28(2): 111-134 (1990)
1980 – 1989
- 1989
- [c1]Peter Eades, Xuemin Lin:
How to draw a directed graph. VL 1989: 13-17 - 1984
- [j4]Peter Eades, Brendan D. McKay:
An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property. Inf. Process. Lett. 19(3): 131-133 (1984) - [j3]Peter Eades, Michael Hickey, Ronald C. Read:
Some Hamilton Paths and a Minimal Change Algorithm. J. ACM 31(1): 19-29 (1984) - 1983
- [j2]Brian Alspach, Peter Eades, Gordon Rose:
A lower-bound for the number of productions required for a certain class of languages. Discret. Appl. Math. 6(2): 109-115 (1983) - 1981
- [j1]Peter Eades, John Staples:
On Optimal Trees. J. Algorithms 2(4): 369-384 (1981)
Coauthor Index
[j72] [j71] [c120] [c119] [i18] [c117] [c116] [c115] [c114] [i16] [j70] [c113] [c112] [c111] [j69] [j68] [c110] [c108] [c107] [c106] [i14] [c105] [c104] [c103] [c102] [i13] [i12] [i11] [j64] [c101] [c100] [i10] [j63] [j62] [c97] [c95] [c94] [i7] [i6] [i5] [j61] [c93] [j60] [c91] [c90] [i3] [j58] [j57] [c89] [j55] [j54] [c87] [c86] [c85] [r2] [i2] [j53] [c84] [c83] [c82] [c81] [c80] [p3] [c79] [c78] [c75] [c74] [i1] [j49] [j48] [c73] [c72] [c70] [c69] [c68] [j45] [c65] [j43] [j42] [c64] [c63] [p2] [j41] [c55] [c53] [c52] [j39] [c51] [r1] [j38] [c46] [c42] [j29] [c36] [c34] [c29] [c25]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
