Abstract is missing.
- Three-Dimensional Graph DrawingRobert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey. 1-11
- 3-D Visualization of Program InformationSteven P. Reiss. 12-24
- 3D Layout of Reachability Graphs of Communicating ProcessesThierry Jéron, Claude Jard. 25-32
- A Flow Approach to Upward Drawings of Toroidal MapsBojan Mohar, Pierre Rosenstiehl. 33-39
- Improved Algorithms and Bounds for Orthogonal DrawingsAchilleas Papakostas, Ioannis G. Tollis. 40-51
- On Bend-Minimum Orthogonal Upward Drawing of Directed Planar GraphsUlrich Fößmeier, Michael Kaufmann. 52-63
- Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each ConnectionShimon Even, G. Granot. 64-75
- On Drawing a Graph Convexly in the PlaneHristo Djidjev. 76-83
- On Drawing Angle GraphsAshim Garg. 84-95
- Regular Edge Labelings and Drawings of Planar GraphsXin He, Ming-Yang Kao. 96-103
- Minimum-Width Grid Drawings of Plane GraphsMarek Chrobak, Shin-Ichi Nakano. 104-110
- Regular Orientations, Arboricity, and AugmentationHubert de Fraysseix, Patrice Ossona de Mendez. 111-118
- The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related ProblemsMichael Jünger, Petra Mutzel. 119-130
- Crossing Numbers of Graphs, Lower Bound TechniquesFarhad Shahrokhi, László A. Székely, Imrich Vrto. 131-142
- Graph Drawing Contest ReportPeter Eades, Joe Marks. 143-146
- Visibility Graphs and Oriented MatroidsJames Abello, Krishna Kumar. 147-158
- Rectangle-Visibility Representations of Bipartite GraphsAlice M. Dean, Joan P. Hutchinson. 159-166
- On the Number of Directions in Visibility RepresentationsEvangelos Kranakis, Danny Krizanc, Jorge Urrutia. 167-176
- Directed VR-Representable Graphs have Unbounded DimensionKathleen Romanik. 177-181
- GraphEd: a Graphical Platform for the Implementation of Graph AlgorithmsMichael Himsolt. 182-193
- Graph Layout through the VCG ToolGeorg Sander. 194-205
- Drawing Telecommunication NetworksIoannis G. Tollis, Chunliang Xia. 206-217
- Reduction of Visual Complexity in Dynamic GraphsDoug Kimelman, Bruce Leban, Tova Roth, Dror Zernik. 218-225
- TOSCANA - a Graphical Tool for Analyzing and Exploring DataFrank Vogt, Rudolf Wille. 226-233
- Characterization and Recognition of Point-Halfspace and Related OrdersPaul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman. 234-245
- Redrawing a Graph within a Geometric ToleranceManuel Abellanas, Ferran Hurtado, Pedro A. Ramos. 246-253
- On the Difficulty of Embedding Planar Graphs with InaccuraciesMichael Godau. 254-261
- A System for Drawing Graphs with Geometric SymmetryJoseph Manning, Mikhail J. Atallah, Kingsley Cudjoe, Joe Lozito, Ron Pacheco. 262-265
- Demonstration of the Interactive Graph-Visualization System ::::da Vinci::::Michael Fröhlich, Mattias Werner. 266-269
- CG: a Graph Drawing System Using Graph-Grammar ParsingCarolyn McCreary, Fwu-Shan Shieh, Helen Gill. 270-273
- A Demonstration of Interactive Graph Based Visual LanguageJeffrey D. McWhirter. 274-277
- A Simple Algorithm for Drawing Large Graphs on Small ScreensKarlis Kaugars, Juris Reinfelds, Alvis Brazma. 278-281
- Molecular Graph Eigenvectors for Molecular CoordinatesPatrick W. Fowler, Tomaz Pisanski, John Shawe-Taylor. 282-285
- On the Compuational Complexity of Upward and Rectilinear Planarity TestingAshim Garg, Roberto Tamassia. 286-297
- Upward Planarity Testing of Outerplanar DagsAchilleas Papakostas. 298-306
- Optimal-Area Upward Drawings of AVL TreesPierluigi Crescenzi, Adolfo Piperno. 307-317
- Upward Drawing on the Plane Grid Using Less InkGuy-Vincent Jourdan, Ivan Rival, Nejib Zaguia. 318-327
- Proximity Drawability: a SurveyGiuseppe Di Battista, William Lenhart, Giuseppe Liotta. 328-339
- Proximity Constraints and Representable TreesProsenjit Bose, Giuseppe Di Battista, William Lenhart, Giuseppe Liotta. 340-351
- Recognizing Rectangle of Influence Drawable GraphsHossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides. 352-363
- A Simple and Unified Method for Drawing Graphs: Magnetic-Spring AlgorithmKozo Sugiyama, Kazuo Misue. 364-375
- Integration of Declarative and Algorithmic Approaches for Layout CreationTao Lin, Peter Eades. 376-387
- A Fast Adaptive Layout Algorithm for Undirected GraphsArne Frick, Andreas Ludwig, Heiko Mehldau. 388-403
- Drawing Graphs by Example Efficiently: Trees and Planar Acyclic DigraphsIsabel F. Cruz, Ashim Garg. 404-415
- Designing Graph Drawings by Layout Graph GrammarsFranz-Josef Brandenburg. 416-427
- Encoding Presentation Emphasis Algorithms for GraphsEmanuel G. Noik. 428-435
- A Practical Approach to Static Node PositioningJunhui Luo, Kanth Miriyala. 436-443
- Map Generalization as a Graph Drawing ProblemAlan Saalfeld. 444-451
- A Geometrical Heuristic for Drawing Concept LatticesGerd Stumme, Rudolf Wille. 452-460
- Poster Gallery ReportSue Whitesides. 461-469