Stop the war!Остановите войну!
for scientists:
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
- 2023
[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]