Peter Eades

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
60Bounds on the crossing resolution of complete geometric graphs. Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta. Discrete Applied Mathematics (160): 132-139 (2012). Web SearchBibTeXDownload
2011
59Kozo Sugiyama 1945 - 2011. Peter Eades, Seok-Hee Hong, Kazuo Misue. Graph Drawing 2011, 1. Web SearchBibTeXDownload
58TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades. Graph Drawing 2011, 123-135. Web SearchBibTeXDownload
2010
57A Force-Directed Method for Large Crossing Angle Graph Drawing. Peter Eades, Weidong Huang, Seok-Hee Hong. CoRR (abs/1012.4559) (2010). Web SearchBibTeXDownload
56Large Crossing Angles in Circular Layouts. Quan Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang. Graph Drawing 2010, 397-399. Web SearchBibTeXDownload
55Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin. VL/HCC 2010, 176-183. Web SearchBibTeXDownload
2009
54On Rectilinear Drawing of Graphs. Peter Eades, Seok-Hee Hong, Sheung-Hung Poon. Graph Drawing 2009, 232-243. Web SearchBibTeXDownload
53Issues for the Evaluation of Ambient Displays. Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong. IJACI (1): 59-69 (2009). Web SearchBibTeXDownload
52Measuring effectiveness of graph visualizations: A cognitive load perspective. Weidong Huang, Peter Eades, Seok-Hee Hong. Information Visualization (8): 139-152 (2009). Web SearchBibTeXDownload
51A graph reading behavior: Geodesic-path tendency. Weidong Huang, Peter Eades, Seok-Hee Hong. PacificVis 2009, 137-144. Web SearchBibTeXDownload
2008
50The long-term evaluation of Fisherman in a partial-attention environment. Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong. BELIV 2008, 10. Web SearchBibTeXDownload
49Beyond time and error: a cognitive approach to the evaluation of graph drawings. Weidong Huang, Peter Eades, Seok-Hee Hong. BELIV 2008, 3. Web SearchBibTeXDownload
48Effects of Crossing Angles. Weidong Huang, Seok-Hee Hong, Peter Eades. PacificVis 2008, 41-46. Web SearchBibTeXDownload
2007
47Intrusive and Non-intrusive Evaluation of Ambient Displays. Xiaobin Shen, Peter Eades, Seok-Hee Hong, Andrew Vande Moere. Ambient Information Systems 2007. Web SearchBibTeXDownload
46Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. J. Graph Algorithms Appl. (11): 323-324 (2007). Web SearchBibTeXDownload
45Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. Weidong Huang, Seok-Hee Hong, Peter Eades. J. Graph Algorithms Appl. (11): 397-429 (2007). Web SearchBibTeXDownload
2006
44Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi. Algorithmica (44): 1-32 (2006). Cited by 114Web SearchBibTeXDownload
43Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Seok-Hee Hong, Peter Eades. Algorithmica (44): 67-100 (2006). Web SearchBibTeXDownload
42Predicting graph reading performance: a cognitive approach. Weidong Huang, Seok-Hee Hong, Peter Eades. APVIS 2006, 207-216. Web SearchBibTeXDownload
41How people read sociograms: a questionnaire study. Weidong Huang, Seok-Hee Hong, Peter Eades. APVIS 2006, 199-206. Web SearchBibTeXDownload
40A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Seok-Hee Hong, Brendan D. McKay, Peter Eades. Discrete & Computational Geometry (36): 283-311 (2006). Web SearchBibTeXDownload
2005
39Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Seok-Hee Hong, Peter Eades. Algorithmica (42): 159-197 (2005). Web SearchBibTeXDownload
38Layout Effects on Sociogram Perception. Weidong Huang, Seok-Hee Hong, Peter Eades. Graph Drawing 2005, 262-273. Web SearchBibTeXDownload
37A Framework for Visualising Large Graphs. Wanchun Li, Seok-Hee Hong, Peter Eades. IV 2005, 528-535. Web SearchBibTeXDownload
36Navigating Software Architectures with Constant Visual Complexity. Wanchun Li, Peter Eades, Seok-Hee Hong. VL/HCC 2005, 225-232. Web SearchBibTeXDownload
2004
35Linkless symmetric drawings of series parallel digraphs. Seok-Hee Hong, Peter Eades, Jonathan Hillman. Comput. Geom. (29): 191-221 (2004). Web SearchBibTeXDownload
34A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Seok-Hee Hong, Peter Eades. Graph Drawing 2004, 307-317. Web SearchBibTeXDownload
2003
33Drawing Trees Symmetrically in Three Dimensions. Seok-Hee Hong, Peter Eades. Algorithmica (36): 153-178 (2003). Web SearchBibTeXDownload
32Symmetric Layout of Disconnected Graphs. Seok-Hee Hong, Peter Eades. ISAAC 2003, 405-414. Web SearchBibTeXDownload
31Towards area requirements for drawing hierarchically planar graphs. Xuemin Lin, Peter Eades. Theor. Comput. Sci. (292): 679-695 (2003). Web SearchBibTeXDownload
2002
30Symmetric drawings of triconnected planar graphs. Seok-Hee Hong, Brendan D. McKay, Peter Eades. SODA 2002, 356-365. Web SearchBibTeXDownload
2001
29Graphs in Software Visualization - Introduction. Petra Mutzel, Peter Eades. Software Visualization 2001, 285-294. Web SearchBibTeXDownload
2000
28Drawing series parallel digraphs symmetrically. Seok-Hee Hong, Peter Eades, Sang Ho Lee. Comput. Geom. (17): 165-188 (2000). Web SearchBibTeXDownload
27An Algorithm for Finding Three Dimensional Symmetry in Trees. Seok-Hee Hong, Peter Eades. Graph Drawing 2000, 360-371. Web SearchBibTeXDownload
26An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. Seok-Hee Hong, Peter Eades. ISAAC 2000, 266-277. Web SearchBibTeXDownload
25Spring algorithms and symmetry. Peter Eades, Xuemin Lin. Theor. Comput. Sci. (240): 379-405 (2000). Cited by 52Web SearchBibTeXDownload
1999
24Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. Xuemin Lin, Peter Eades. COCOON 1999, 92-102. Cited by 3Web SearchBibTeXDownload
1998
23Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee. Graph Drawing 1998, 198-209. Web SearchBibTeXDownload
22Graph-Drawing Contest Report. Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov, Falk Schreiber. Graph Drawing 1998, 423-435. Web SearchBibTeXDownload
21Finding Planar Geometric Automorphisms in Planar Graphs. Seok-Hee Hong, Peter Eades, Sang Ho Lee. ISAAC 1998, 277-286. Web SearchBibTeXDownload
20On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm. Mao Lin Huang, Peter Eades, Junhu Wang. J. Vis. Lang. Comput. (9): 623-645 (1998). Web SearchBibTeXDownload
1997
19Three-Dimensional Graph Drawing. Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey. Algorithmica (17): 199-208 (1997). Web SearchBibTeXDownload
18Spring Algorithms and Symmetry. Peter Eades, Xuemin Lin. COCOON 1997, 202-211. Web SearchBibTeXDownload
17Graph-Drawing Contest Report. Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov, Falk Schreiber. Graph Drawing 1997, 438-445. Web SearchBibTeXDownload
16Finding the Best Viewpoints for Three-Dimensional Graph Drawings. Peter Eades, Michael E. Houle, Richard Webber. Graph Drawing 1997, 87-98. Web SearchBibTeXDownload
15Area Requirements for Drawing Hierarchically Planar Graphs. Xuemin Lin, Peter Eades. Graph Drawing 1997, 219-229. Cited by 8Web SearchBibTeXDownload
1996
14Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi. Graph Drawing 1996, 113-128. Cited by 114Web SearchBibTeXDownload
13Graph-Drawing Contest Report. Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov, Falk Schreiber. Graph Drawing 1996, 129-138. Web SearchBibTeXDownload
12An Algorithm for Drawing a Hierarchical Graph. Peter Eades, Xuemin Lin, Roberto Tamassia. Int. J. Comput. Geometry Appl. (6): 145-156 (1996). Cited by 30Web SearchBibTeX
11Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Peter Eades, M. Keil, Paul D. Manuel, Mirka Miller. Nord. J. Comput. (3): 220-237 (1996). Web SearchBibTeX
1995
10Graph-Drawing Contest Report. Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov, Falk Schreiber. Graph Drawing 1995, 224-233. Web SearchBibTeXDownload
9Guest editors' foreword. Doug Lea, Gianluigi Zavattaro, Oriol Serra. J. Vis. Lang. Comput. (6): 213-215 (1995). Web SearchBibTeXDownload
1994
8Volume upper bounds for 3D graph drawing. Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey. CASCON 1994, 11. Web SearchBibTeXDownload
7Algorithms for Drawing Graphs: an Annotated Bibliography. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis. Comput. Geom. (4): 235-282 (1994). Web SearchBibTeXDownload
6Integration of Declarative and Algorithmic Approaches for Layout Creation. Tao Lin, Peter Eades. Graph Drawing 1994, 376-387. Web SearchBibTeXDownload
5Three-Dimensional Graph Drawing. Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey. Graph Drawing 1994, 1-11. Web SearchBibTeXDownload
1993
4Performance Guarantees for Motion Planning with Temporal Uncertainty. Peter Eades, Xuemin Lin, Nicholas C. Wormald. Australian Computer Journal (25): 21-28 (1993). Cited by 20Web SearchBibTeX
3A Fast and Effective Heuristic for the Feedback Arc Set Problem. Peter Eades, Xuemin Lin, W. F. Smyth. Inf. Process. Lett. (47): 319-323 (1993). Cited by 55Web SearchBibTeXDownload
2Two Tree Drawing Conventions. Peter Eades, Tao Lin, Xuemin Lin. Int. J. Comput. Geometry Appl. (3): 133-153 (1993). Cited by 46Web SearchBibTeX
1992
1Minimum Size h-v Drawings. Peter Eades, Tao Lin, Xuemin Lin. Advanced Visual Interfaces 1992, 386-394. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research