GD 1998: Montréal, Canada

Papers

• Alok Aggarwal, S. Rao Kosaraju, Mihai Pop:
  Drawing of Two-Dimensional Irregular Meshes. 1-14
  
• Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
  Quasi-Upward Planarity. 15-29
  
• Therese C. Biedl:
  Three Approaches to 3D-Orthogonal Box-Drawings. 30-43
  
• Ulrik Brandes, Dorothea Wagner:
  Using Graph Layout to Visualize Train Interconnection Data. 44-56
  
• Stina S. Bridgeman, Roberto Tamassia:
  Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. 57-71
  
• Giuseppe Di Battista, Giuseppe Liotta:
  Upward Planarity Checking: ``Faces Are More than Polygons''. 72-86
  
• Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu:
  A Split&Push Approach to 3D Orthogonal Drawing. 87-101
  
• Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
  Geometric Thickness of Complete Graphs. 101-110
  
• Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
  Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. 111-124
  
• Ulrich Fößmeier, Carsten Heß, Michael Kaufmann:
  On Improving Orthogonal Drawings: The 4M-Algorithm. 125-137
  
• Natasha Gelfand, Roberto Tamassia:
  Algorithmic Patterns for Orthogonal Graph Drawing. 138-152
  
• Michael T. Goodrich, Christopher G. Wagner:
  A Framework for Drawing Planar Graphs with Curves and Polylines. 153-166
  
• Carsten Gutwenger, Petra Mutzel:
  Planar Polyline Drawings with Good Angular Resolution. 167-182
  
• Kunihiko Hayashi, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara:
  A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order. 183-197
  
• Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee:
  Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. 198-209
  
• Michael E. Houle, Richard Webber:
  Approximation Algorithms for Finding Best Viewpoints. 210-223
  
• Michael Jünger, Sebastian Leipert, Petra Mutzel:
  Level Planarity Testing in Linear Time. 224-237
  
• Jan Kratochvíl:
  Crossing Number of Abstract Topological Graphs. 238-245
  
• Bernd Meyer:
  Self-Organizing Graphs - A Neural Network Perspective of Graph Layout. 246-262
  
• János Pach, Rephael Wenger:
  Embedding Planar Graphs at Fixed Vertex Locations. 263-274
  
• Paolo Penna, Paola Vocca:
  Proximity Drawings: Three Dimensions Are Better than Two. 275-287
  
• Falk Schreiber, Konstantin Skodinis:
  NP-Completeness of Some Tree-Clustering Problems. 288-301
  
• Janet M. Six, Konstantinos G. Kakoulis, Ioannis G. Tollis:
  Refinement of Orthogonal Graph Drawings. 302-315
  
• Frank Wagner, Alexander Wolff:
  A Combinatorial Framework for Map Labeling. 316-331
  
• David R. Wood:
  An Algorithm for Three-Dimensional Orthogonal Graph Drawing. 332-346
  

System Demonstrations

• Therese C. Biedl, Joe Marks, Kathy Ryall, Sue Whitesides:
  Graph Multidrawing: Finding Nice Drawings Without Defining Nice. 347-355
  
• Ugur Dogrusöz, Konstantinos G. Kakoulis, Brendan Madden, Ioannis G. Tollis:
  Edge Labeling in the Graph Layout Toolkit. 356-363
  
• Emden R. Gansner, Stephen C. North:
  Improved Force-Directed Layouts. 364-373
  
• Mao Lin Huang, Peter Eades:
  A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. 374-383
  
• Tamara Munzner:
  Drawing Large Graphs with H3Viewer and Site Manager. 384-393
  
• Gilles Paris:
  Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editor. 394-402
  
• Björn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel:
  Visualization of Parallel Execution Graphs. 403-412
  
• Daniel Tunkelang:
  JIGGLE: Java Interactive Graph Layout Environment. 412-422
  

Contest

• Peter Eades, Joe Marks, Petra Mutzel, Stephen C. North:
  Graph-Drawing Contest Report. 423-435
  

Poster Abstracts

• Isabel F. Cruz, Donald I. Lambe:
  Implementation of an Efficient Constraint Solver for the Layout of Graphs in Delaunay. 436-437
  
• Erik D. Demaine, Martin L. Demaine:
  Planar Drawings of Origami Polyhedra. 438-440
  
• Edmund Dengler, William B. Cowan:
  Human Perception of Laid-Out Graphs. 441-443
  
• Giuseppe Di Battista, Renato Lillo, Fabio Vernacotola:
  Ptolomaeus: The Web Cartographer. 444-445
  
• Arne Frick, Brendan Madden:
  Flexible Graph Layout and Editing for Commercial Applications. 446-447
  
• Robert B. Garvey:
  Multidimensional Outlines - Wordgraphs^TM. 448-449
  
• Markus Holzer, Muriel Quenzer:
  VisA: A Tool for Visualizing and Animating Automata and Formal Languages. 450-451
  
• Claudia Iturriaga, Anna Lubiw:
  Elastic Labels on the Perimeter of a Rectangle. 451-453
  
• Carolyn McCreary, Larry A. Barowski:
  VGJ: Visualizing Graphs Through Java. 454-455
  
• Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, Sebastian Leipert:
  A Library of Algorithms for Graph Drawing. 456-457
  
• Michael A. Soss:
  The Size of the Open Sphere of Influence Graph in L_infty Metric Spaces. 458-459
  
• Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang:
  Maximum Weight Triangulation and Graph Drawing. 460-461
  
• Roland Wiese, Michael Kaufmann:
  Adding Constraints to an Algorithm for Orthogonal Graph Drawing. 462-463
  
• Binhai Zhu, Xiaotie Deng:
  On Computing and Drawing Maxmin-Height Covering Triangulation. 464-466
  

Last update Wed May 22 23:35:24 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page