Front matter
1-12
Drawable and forbidden minimum weight triangulations
Extended abstract
William Lenhart and Giuseppe Liotta
13-24
A polyhedral approach to the multi-layer crossing minimization problem
Extended abstract
Michael Jünger, Eva K. Lee, Petra Mutzel and Thomas Odenthal
25-36
On embedding an outer-planar graph in a point set
Prosenjit Bose
37-46
Bipartite crossing numbers of meshes and hypercubes
Farhad Shahrokhi, Ondrej Sykora, László A. Székely and Imrich Vrt'o
47-51
Three-dimensional grid drawings of graphs
János Pach, Torsten Thiele and Géza Tóth
52-63
Incremental orthogonal graph drawing in three dimensions
Achilleas Papakostas and Ioannis G. Tollis
64-75
On three-dimensional layout of interconnection networks
Extended abstract
Tiziana Calamoneri and Annalisa Massini
76-86
Orthogonal 3-D graph drawing
T. Biedl, T. Shermer, S. Whitesides and S. Wismath
87-98
Finding the best viewpoints for three-dimensional graph drawings
Peter Eades, Michael E. Houle and Richard Webber
99-110
A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki
111-123
Interactive orthogonal graph drawing: Algorithms and bounds
Ulrich Fößmeier
124-133
Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard
M. A. Garrido and A. Márquez
134-145
Algorithms and area bounds for nonplanar orthogonal drawings
Ulrich Föβmeier and Michael Kaufmann
146-157
Drawing clustered graphs on an orthogonal grid
Peter Eades and Qing-Wen Feng
158-168
Graph clustering I: Cycles of cliques
Extended abstract
F. J. Brandenburg
169-180
An algorithm for labeling edges of hierarchical drawings
Konstantinos G. Kakoulis and Ioannis G. Tollis
181-192
Elastic labels: The two-axis case
Claudia Iturriaga and Anna Lubiw
193-204
Pitfalls of using PQ-trees in automatic graph drawing
Michael Jünger, Sebastian Leipert and Petra Mutzel
205-218
Graph drawing with no k pairwise crossing edges
Pavel Valtr
219-229
Area requirements for drawing hierarchically planar graphs
Xuemin Lin and Peter Eades
230-235
A short proof of a Gauss problem
H. de Fraysseix and P. Ossona de Mendez
236-247
A bayesian paradigm for dynamic graph layout
Ulrik Brandes and Dorothea Wagner
248-261
Which aesthetic has the greatest effect on human understanding?
Helen Purchase
262-271
Implementing a general-purpose edge router
David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios and Stephen C. North
272-283
The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems
Extended abstract
Sándor P. Fekete, Michael E. Houle and Sue Whitesides
284-290
3DCube: A tool for three dimensional graph drawing
Maurizio Patrignani and Francesco Vargiu
291-296
Graph clustering using multiway ratio cut (Software demonstration)
Tom Roxborough and Arunabha Sen
297-302
ArchE: A graph drawing system for archaeology
Christoph Hundack, Petra Mutzel, Igor Pouchkarev and Stefan Thome
303-308
InteractiveGiotto: An algorithm for interactive orthogonal graph drawing
Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia and Luca Vismara
309-315
GRID: An interactive tool for computing orthogonal drawings with the minimum number of bends
Walter Didimo and Antonio Leonforte
316-321
Lexical navigation: Using incremental graph drawing for query refinement
Daniel Tunkelang, Roy J. Byrd and James W. Cooper
322-329
Design gallery browsers based on 2D and 3D graph drawing (Demo)
Brad Andalman, Kathy Ryall, Wheeler Ruml, Joe Marks and Stuart Shieber
330-335
Online animated graph drawing for web navigation
Peter Eades, Robert F. Cohen and Mao Lin Huang
336-343
Grappa: A graph package in java
Naser S. Barghouti, John M. Mocenigo and Wenke Lee
344-349
GraVis
— System demonstration
Harald Lauer, Matthias Ettrich and Klaus Soukup
350-358
Touching graphs of unit balls
Petr Hliněný
359-370
Discrete realizations of contact and intersection graphs (extended abstract)
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc and Jorge Urrutia
371-382
Minimum-area h-v drawings of complete binary trees
Extended abstract
P. Crescenzi and P. Penna
383-390
Packing trees into planar graphs
A. García, C. Hernando, F. Hurtado, M. Noy and J. Tejel
391-402
The three-phase method: A unified approach to orthogonal graph drawing
Therese C. Biedl, Brendan P. Madden and Ioannis G. Tollis
403-414
NicheWorks — Interactive visualization of very large graphs
Graham J Wills
415-424
Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams
Jochen Seemann
425-437
Graph drawing and manipulation with LINK
Jonathan Berry, Nathaniel Dean, Mark Goldberg, Gregory Shannon and Steven Skiena
438-445
Graph-drawing contest report
Peter Eades, Joe Marks and Stephen North
Back matter