GD 1997: Rome, Italy
Giuseppe Di Battista (Ed.): Graph Drawing, 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997, Proceedings. Springer 1997 Lecture Notes in Computer Science ISBN 3-540-63938-1
Planarity and Crossings

Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal: A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. 13-24
Prosenjit Bose: On Embedding an Outer-Planar Graph in a Point Set. 25-36
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto: Bipartite Crossing Numbers of Meshes and Hypercubes. 37-46
Drawings in the Air

Achilleas Papakostas, Ioannis G. Tollis: Incremental Orthogonal Graph Drawing in Three Dimensions. 52-63
Tiziana Calamoneri, Annalisa Massini: On Three-Dimensional Layout of Interconnection Networks. 64-75
Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath: Orthogonal 3-D Graph Drawing. 76-86
Peter Eades, Michael E. Houle, Richard Webber: Finding the Best Viewpoints for Three-Dimensional Graph Drawings. 87-98
Left and Right Turns
Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. 99-110
Ulrich Fößmeier: Interactive Orthogonal Graph Drawing: Algorithms and Bounds. 111-123
Maria Angeles Garrido, Alberto Márquez: Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends is NP-hard. 124-133
Ulrich Fößmeier, Michael Kaufmann: Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. 134-145
Clustering and Labeling

Franz-Josef Brandenburg: Graph Clustering 1: Circles of Cliques. 158-168
Konstantinos G. Kakoulis, Ioannis G. Tollis: An Algorithm for Labeling Edges of Hierarchical Drawings. 169-180
Crossings and Planarity
Michael Jünger, Sebastian Leipert, Petra Mutzel: Pitfalls of Using PQ-Trees in Automatic Graph Drawing. 193-204
Pavel Valtr: Graph Drawings with no k Pairwise Crossing Edges. 205-218

Methodologies and Applications 1

Helen C. Purchase: Which Aesthetic has the Greatest Effect on Human Understanding? 248-261
David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North: Implementing a General-Purpose Edge Router. 262-271
Sándor P. Fekete, Michael E. Houle, Sue Whitesides: The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. 272-283
Systems 1


Christoph Hundack, Petra Mutzel, Igor Pouchkarev, Stefan Thome: ArchE: A Graph Drawing System for Archaeology. 297-302
Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, Luca Vismara: InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing. 303-308
Walter Didimo, Antonio Leonforte: GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends. 309-315
Daniel Tunkelang, Roy J. Byrd, James W. Cooper: Lexical Navigation: Using Incremental Graph Drawing for Query Refinement. 316-321
Systems 2
Brad Andalman, Kathy Ryall, Wheeler Ruml, Joe Marks, Stuart M. Shieber: Design Gallery Browsers Based on 2D and 3D Graph Drawing. 322-329
Peter Eades, Robert F. Cohen, Mao Lin Huang: Online Animated Graph Drawing for Web Navigation. 330-335

Packing, Compressing, and Touching
Petr Hlinený: Touching Graphs of Unit Balls. 350-358
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: Discrete Realizations of Contact and Intersection Graphs. 359-370
Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel: Packing Trees into Planar Graphs. 383-390
Methodologies and Applications 2
Therese C. Biedl, Brendan Madden, Ioannis G. Tollis: The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. 391-402
Graham J. Wills: NicheWorks - Interactive Visualization of Very Large Graphs. 403-414
Jochen Seemann: Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams. 415-424
Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena: Graph Drawing and Manipulation with LINK. 425-437



