Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Peter Eades
2010 – today
- 2013
[j52]Peter Eades, Giuseppe Liotta: Right angle crossing graphs and 1-planarity. Discrete Applied Mathematics 161(7-8): 961-969 (2013)- [j51]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)
- [c84]Hooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: Circular Graph Drawings with Large Crossing Angles. WALCOM 2013: 298-309
- [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
- [j50]Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta: Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics 160(1-2): 132-139 (2012)
- [j49]Hooman Reisi Dehkordi, Peter Eades: Every outer-1-Plane Graph has a Right Angle Crossing Drawing. Int. J. Comput. Geometry Appl. 22(6): 543-558 (2012)
- [c83]Seok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon: Fáry's Theorem for 1-Planar Graphs. COCOON 2012: 335-346
- [c82]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). Graph Drawing 2012: 339-345
- [c81]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: StreamEB: Stream Edge Bundling. Graph Drawing 2012: 400-413
- [c80]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: On the Faithfulness of Graph Visualizations. Graph Drawing 2012: 566-568
- [c79]Hui Liu, Peter Eades, Seok-Hee Hong: Visualizing dynamic trajectories in social networks. VL/HCC 2012: 197-204
- 2011
- [j48]Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39): 5156-5166 (2011)
- [c78]
- [c77]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades: TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. Graph Drawing 2011: 123-135
- [c76]Peter Eades, Giuseppe Liotta: Right Angle Crossing Graphs and 1-Planarity. Graph Drawing 2011: 148-153
- [c75]Emilio Di Giacomo, Walter Didimo, Peter Eades, Giuseppe Liotta: 2-Layer Right Angle Crossing Drawings. IWOCA 2011: 156-169
- 2010
- [j47]Walter Didimo, Peter Eades, Giuseppe Liotta: A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16): 687-691 (2010)
- [c74]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang: Large Crossing Angles in Circular Layouts. Graph Drawing 2010: 397-399
- [c73]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
- [j46]Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong: Issues for the Evaluation of Ambient Displays. IJACI 1(2): 59-69 (2009)
- [j45]Weidong Huang, Peter Eades, Seok-Hee Hong: Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization 8(3): 139-152 (2009)
- [c72]Weidong Huang, Peter Eades, Seok-Hee Hong: A graph reading behavior: Geodesic-path tendency. PacificVis 2009: 137-144
- [c71]Peter Eades, Seok-Hee Hong, Sheung-Hung Poon: On Rectilinear Drawing of Graphs. Graph Drawing 2009: 232-243
- [c70]Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217
- [e8]Peter Eades, Thomas Ertl, Han-Wei Shen (Eds.): IEEE Pacific Visualization Symposium PacificVis 2009, Beijing, China, April 20-23, 2009. IEEE Computer Society 2009, ISBN 978-1-4244-4404-5
- 2008
- [j44]Hugo A. D. do Nascimento, Peter Eades: User Hints for map labeling. J. Vis. Lang. Comput. 19(1): 39-74 (2008)
- [c69]
- [c68]Weidong Huang, Peter Eades, Seok-Hee Hong: Beyond time and error: a cognitive approach to the evaluation of graph drawings. BELIV 2008: 3
- [c67]Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong: The long-term evaluation of Fisherman in a partial-attention environment. BELIV 2008: 10
- [c66]
- 2007
- [j43]Peter Eades, Patrick Healy: Guest Editor's Foreword. J. Graph Algorithms Appl. 11(2): 323-324 (2007)
- [j42]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)
- [c65]Christian Müller-Tomfelde, Belinda Kellar, Peter Eades: HxI : An Australian Initiative in ICT-Augmented Human Interactivity. INTERACT (2) 2007: 675-676
- [c64]Xiaobin Shen, Peter Eades, Seok-Hee Hong, Andrew Vande Moere: Intrusive and Non-intrusive Evaluation of Ambient Displays. Ambient Information Systems 2007
- 2006
- [j41]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)
- [j40]Seok-Hee Hong, Peter Eades: Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Algorithmica 44(1): 67-100 (2006)
- [j39]Seok-Hee Hong, Brendan D. McKay, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Discrete & Computational Geometry 36(2): 283-311 (2006)
- [c63]Weidong Huang, Seok-Hee Hong, Peter Eades: How people read sociograms: a questionnaire study. APVIS 2006: 199-206
- [c62]Weidong Huang, Seok-Hee Hong, Peter Eades: Predicting graph reading performance: a cognitive approach. APVIS 2006: 207-216
- [c61]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
- [p1]Peter Eades, Seok-Hee Hong, Keith Nesbitt, Masahiro Takatsuka: Information Display. Handbook of Nature-Inspired and Innovative Computing 2006: 633-655
- 2005
- [j38]Seok-Hee Hong, Peter Eades: Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica 42(2): 159-197 (2005)
- [j37]Hugo A. D. do Nascimento, Peter Eades: User hints: a framework for interactive optimization. Future Generation Comp. Syst. 21(7): 1171-1191 (2005)
- [c60]Xiaodi Huang, Peter Eades, Wei Lai: A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization. ACSC 2005: 87-96
- [c59]Adel Ahmed, Peter Eades: Automatic Camera Path Generation for Graph Navigation in 3D. APVIS 2005: 27-32
- [c58]Lanbo Zheng, Le Song, Peter Eades: Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters. APVIS 2005: 33-37
- [c57]
- [c56]
- [c55]Wanchun Li, Peter Eades, Nikola S. Nikolov: Using Spring Algorithms to Remove Node Overlapping. APVIS 2005: 131-140
- [c54]Weidong Huang, Seok-Hee Hong, Peter Eades: Layout Effects on Sociogram Perception. Graph Drawing 2005: 262-273
- [c53]Xiaobin Shen, Andrew Vande Moere, Peter Eades: An intrusive evaluation of peripheral display. GRAPHITE 2005: 289-292
- [c52]
- [c51]Wanchun Li, Peter Eades, Seok-Hee Hong: Navigating Software Architectures with Constant Visual Complexity. VL/HCC 2005: 225-232
- 2004
- [j36]Seok-Hee Hong, Peter Eades, Jonathan Hillman: Linkless symmetric drawings of series parallel digraphs. Comput. Geom. 29(3): 191-221 (2004)
- [c50]Seok-Hee Hong, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Graph Drawing 2004: 307-317
- [c49]
- 2003
- [j35]Seok-Hee Hong, Peter Eades: Drawing Trees Symmetrically in Three Dimensions. Algorithmica 36(2): 153-178 (2003)
- [j34]Graham Farr, Peter Eades: Skewness of Graphs with Small Cutsets. Graphs and Combinatorics 19(2): 177-194 (2003)
- [j33]Mao Lin Huang, Peter Eades, Wei Lai: On-Line Visualization and Navigation of the Global Web Structure. International Journal of Software Engineering and Knowledge Engineering 13(1): 27-52 (2003)
- [j32]Hiroshi Nagamochi, Peter Eades: An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim. 7(2): 137-159 (2003)
- [j31]Xuemin Lin, Peter Eades: Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. 292(3): 679-695 (2003)
- [c48]
- [c47]Colin Murray, Carsten Friedrich, Peter Eades: HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. Graph Drawing 2003: 494-495
- [c46]Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks: Graph Drawing Contest Report. Graph Drawing 2003: 504-508
- [c45]
- [c44]Peter Eades, Xiaobin Shen: MoneyTree: Ambient Information Visualization Of Financial Data. VIP 2003: 15-18
- 2002
- [j30]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)
- [j29]Wei Lai, Peter Eades: Removing edge-node intersections in drawings of graphs. Inf. Process. Lett. 81(2): 105-110 (2002)
- [j28]Carsten Friedrich, Peter Eades: Graph Drawing in Motion. J. Graph Algorithms Appl. 6(3): 353-370 (2002)
- [j27]
- [c43]Hugo A. D. do Nascimento, Peter Eades: A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing. HIS 2002: 634-643
- [c42]
- [c41]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 (Eds.): 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
- 2001
- [c40]Petra Mutzel, Peter Eades: Graphs in Software Visualization - Introduction. Software Visualization 2001: 285-294
- [c39]Hugo A. D. do Nascimento, Peter Eades: User Hints for Directed Graph Drawing. Graph Drawing 2001: 205-219
- [e6]Peter Eades, Tim Pattison (Eds.): Australasian Symposium on Information Visualisation, InVis.au, Sydney, Australia, 3-4 December 2001. CRPIT 9, Australian Computer Society 2001, ISBN 0-909-92587-9
- [e5]Peter Eades, Tadao Takaoka (Eds.): 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
- [e4]Peter Eades, Jesse S. Jin (Eds.): 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
- [e3]David Dagan Feng, Jesse S. Jin, Peter Eades, Hong Yan (Eds.): 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
- 2000
- [j26]Seok-Hee Hong, Peter Eades, Sang Ho Lee: Drawing series parallel digraphs symmetrically. Comput. Geom. 17(3-4): 165-188 (2000)
- [j25]Peter Eades, Antonios Symvonis, Sue Whitesides: Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathematics 103(1-3): 55-87 (2000)
- [j24]Peter Eades, Mao Lin Huang: Navigating Clustered Graphs Using Force-Directed Methods. J. Graph Algorithms Appl. 4(3): 157-181 (2000)
- [j23]
- [c38]Hugo A. D. do Nascimento, Peter Eades, Candido Ferreira Xavier de Mendonça Neto: A Multi-agent Approach using A-Teams for Graph Drawing. ISCA Conference on Intelligent Systems 2000: 39-42
- [c37]François Bertault, Peter Eades: Drawing Hypergraphs in the Subset Standard (Short Demo Paper). Graph Drawing 2000: 164-169
- [c36]Aaron J. Quigley, Peter Eades: FADE: Graph Drawing, Clustering, and Visual Abstraction. Graph Drawing 2000: 197-210
- [c35]Seok-Hee Hong, Peter Eades: An Algorithm for Finding Three Dimensional Symmetry in Trees. Graph Drawing 2000: 360-371
- [c34]
- [c33]Seok-Hee Hong, Peter Eades: An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. ISAAC 2000: 266-277
- [c32]
- [c31]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 (Eds.): 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
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
- [j22]Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi: Drawing Clustered Graphs on an Orthogonal Grid. J. Graph Algorithms Appl. 3(4): 3-29 (1999)
- [c30]Xuemin Lin, Peter Eades: Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON 1999: 92-102
- 1998
- [j21]Mao Lin Huang, Peter Eades, Robert F. Cohen: WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping. Computer Networks 30(1-7): 638-642 (1998)
- [j20]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)
- [c29]
- [c28]Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee: Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. Graph Drawing 1998: 198-209
- [c27]Mao Lin Huang, Peter Eades: A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. Graph Drawing 1998: 374-383
- [c26]Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North: Graph-Drawing Contest Report. Graph Drawing 1998: 423-435
- [c25]Hiroshi Nagamochi, Peter Eades: Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. IPCO 1998: 96-111
- [c24]Seok-Hee Hong, Peter Eades, Sang Ho Lee: Finding Planar Geometric Automorphisms in Planar Graphs. ISAAC 1998: 277-286
- 1997
- [j19]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997)
- [c23]
- [c22]Peter Eades, Michael E. Houle, Richard Webber: Finding the Best Viewpoints for Three-Dimensional Graph Drawings. Graph Drawing 1997: 87-98
- [c21]Peter Eades, Qing-Wen Feng: Drawing Clustered Graphs on an Orthogonal Grid. Graph Drawing 1997: 146-157
- [c20]Xuemin Lin, Peter Eades: Area Requirements for Drawing Hierarchically Planar Graphs. Graph Drawing 1997: 219-229
- [c19]Peter Eades, Robert F. Cohen, Mao Lin Huang: Online Animated Graph Drawing for Web Navigation. Graph Drawing 1997: 330-335
- [c18]
- 1996
- [j18]Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard. Algorithmica 16(1): 60-82 (1996)
- [j17]Peter Eades, Xuemin Lin, Roberto Tamassia: An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geometry Appl. 6(2): 145-156 (1996)
- [j16]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)
- [j15]Peter Eades, M. Keil, Paul D. Manuel, Mirka Miller: Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nord. J. Comput. 3(3): 220-237 (1996)
- [j14]Peter Eades, Sue Whitesides: The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. Theor. Comput. Sci. 169(1): 23-37 (1996)
- [c17]Peter Eades, Qing-Wen Feng: Multilevel Visualization of Clustered Graphs. Graph Drawing 1996: 101-112
- [c16]Peter Eades, Qing-Wen Feng, Xuemin Lin: Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Graph Drawing 1996: 113-128
- [c15]
- [c14]Peter Eades, Antonios Symvonis, Sue Whitesides: Two Algorithms for Three Dimensional Orthogonal Graph Drawing. Graph Drawing 1996: 139-154
- [c13]
- 1995
- [j13]Kazuo Misue, Peter Eades, Wei Lai, Kozo Sugiyama: Layout Adjustment and the Mental Map. J. Vis. Lang. Comput. 6(2): 183-210 (1995)
- [j12]
- [c12]Qing-Wen Feng, Robert F. Cohen, Peter Eades: How to Draw a Planar Clustered Graph. COCOON 1995: 21-30
- [c11]
- [c10]Peter Eades, Candido Ferreira Xavier de Mendonça Neto: Vertex Splitting and Tension-Free Layout. Graph Drawing 1995: 202-211
- [c9]Peter Eades, Patrick Garvan: Drawing Stressed Planar Graphs in Three Dimensions. Graph Drawing 1995: 212-223
- [c8]
- [c7]
- [e1]John Staples, Peter Eades, Naoki Katoh, Alistair Moffat (Eds.): 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
- 1994
- [j11]Peter Eades, Nicholas C. Wormald: Edge Crossings in Drawings of Bipartite Graphs. Algorithmica 11(4): 379-403 (1994)
- [j10]Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis: Algorithms for Drawing Graphs: an Annotated Bibliography. Comput. Geom. 4: 235-282 (1994)
- [j9]Peter Eades, Sue Whitesides: Drawing Graphs in Two Layers. Theor. Comput. Sci. 131(2): 361-374 (1994)
- [c6]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Volume upper bounds for 3D graph drawing. CASCON 1994: 11
- [c5]Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. Symposium on Computational Geometry 1994: 49-56
- [c4]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Graph Drawing 1994: 1-11
- [c3]
- [c2]Tao Lin, Peter Eades: Integration of Declarative and Algorithmic Approaches for Layout Creation. Graph Drawing 1994: 376-387
- 1993
- [j8]Peter Eades, Xuemin Lin, Nicholas C. Wormald: Performance Guarantees for Motion Planning with Temporal Uncertainty. Australian Computer Journal 25(1): 21-28 (1993)
- [j7]Peter Eades, Tao Lin, Xuemin Lin: Two Tree Drawing Conventions. Int. J. Comput. Geometry Appl. 3(2): 133-153 (1993)
- [j6]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)
- [j5]Peter Eades, David Rappaport: The complexity of computing minimum separating polygons. Pattern Recognition Letters 14(9): 715-718 (1993)
- 1992
- [c1]Peter Eades, Tao Lin, Xuemin Lin: Minimum Size h-v Drawings. Advanced Visual Interfaces 1992: 386-394
- 1990
- [j4]Peter Eades, Nicholas C. Wormald: Fixed edge-length graph drawing is NP-hard. Discrete Applied Mathematics 28(2): 111-134 (1990)
1980 – 1989
- 1984
- [j3]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)
- [j2]Peter Eades, Michael Hickey, Ronald C. Read: Some Hamilton Paths and a Minimal Change Algorithm. J. ACM 31(1): 19-29 (1984)
- 1981
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:15 CEST by the dblp team