GD 1995: Passau, Germany

• Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir:
  Quasi-Planar Graphs Have a Linear Number of Edges. 1-7
  
• Helmut Alt, Michael Godau, Sue Whitesides:
  Universal 3-Dimensional Visibility Representations for Graphs. 8-19
  
• Hartmut Benz:
  KGB - A Customizable Graph Browser. 20-23
  
• François Bertault:
  Adocs: a Drawing System for Generic Combinatorial Structures. 24-27
  
• Therese C. Biedl:
  New Lower Bounds for Orthogonal Graph Drawings. 28-39
  
• Jim Blythe, Cathleen McGrath, David Krackhardt:
  The Effect of Graph Layout on Inference from Social Network Data. 40-51
  
• Prosenjit Bose, Francisco Gómez, Pedro A. Ramos, Godfried T. Toussaint:
  Drawing Nice Projections of Objects in Space. 52-63
  
• Prosenjit Bose, Michael McAllister, Jack Snoeyink:
  Optimal Algorithms to Embed Trees in a Point Set. 64-75
  
• Franz-Josef Brandenburg, Michael Himsolt, Christoph Rohrer:
  An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. 76-87
  
• Heinz Breu, David G. Kirkpatrick:
  On the Complexity of Recognizing Intersection and Touching Graphs of Disks. 88-98
  
• Ingo Bruß, Arne Frick:
  Fast Interactive 3-D Graph Visualization. 99-110
  
• Luciano Buti, Giuseppe Di Battista, Giuseppe Liotta, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:
  GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms. 111-122
  
• Yves Carbonneaux, Jean-Marie Laborde, Rafaï Mourad Madani:
  CABRI-Graph: A Tool for Research and Teaching in Graph Theory. 123-126
  
• M. Sheelagh T. Carpendale, David J. Cowperthwaite, F. David Fracchia, Thomas C. Shermer:
  Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons. 127-139
  
• M. Chandramouli, A. A. Diwan:
  Upward Numbering Testing for Triconnected Graphs. 140-151
  
• Francisco Javier Cobos, Juan Carlos Dana, Ferran Hurtado, Alberto Márquez, F. Mateos:
  On a Visibility Representation of Graphs. 152-161
  
• Isabel F. Cruz, Joseph P. Twarog:
  3D Graph Drawing with Simulated Annealing. 162-165
  
• Luc Devroye, Paul Kruszewski:
  The Botanical Beauty of Random Binary Trees. 166-177
  
• Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides:
  The Strength of Weak Proximity. 178-189
  
• David Dodson:
  COMAIDE: Information Visualization using Cooperative 3D Diagram Layout. 190-201
  
• Peter Eades, Candido Ferreira Xavier de Mendonça Neto:
  Vertex Splitting and Tension-Free Layout. 202-211
  
• Peter Eades, Patrick Garvan:
  Drawing Stressed Planar Graphs in Three Dimensions. 212-223
  
• Peter Eades, Joe Marks:
  Graph-Drawing Contest Report. 224-233
  
• Sándor P. Fekete, Michael E. Houle, Sue Whitesides:
  New Results on a Visibility Representation of Graphs in 3D. 234-241
  
• Arno Formella, Jörg Keller:
  Generalized Fisheye Views of Graphs. 242-253
  
• Ulrich Fößmeier, Michael Kaufmann:
  Drawing High Degree Graphs with Low Bend Numbers. 254-266
  
• Harald Gropp:
  The Drawing of Configurations. 267-276
  
• S. Mehdi Hashemi, Andrzej Kisielewicz, Ivan Rival:
  Upward Drawings on Planes and Speres. 277-286
  
• Xin He:
  Grid Embedding of 4-Connected Plane Graphs. 287-299
  
• Lenwood S. Heath, Sriram V. Pemmaraju:
  Recognizing Leveled-Planar Dags in Linear Time. 300-311
  
• Petr Hlinený:
  Contact Graphs of Curves. 312-323
  
• Joan P. Hutchinson, Thomas C. Shermer, Andrew Vince:
  On Representations of Some Thickness-Two Graphs. 324-332
  
• Jovanna Ignatowicz:
  Drawing Force-Directed Graphs Using Optigraph. 333-336
  
• Michael Jünger, Petra Mutzel:
  Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. 337-348
  
• Thomas Kamps, Joerg Kleinz, John Read:
  Constraint-Based Spring-Model Algorithm for Graph Layout. 349-360
  
• Paulis Kikusts, Peteris Rucevskis:
  Layout Algorithms of Graph-Like Diagrams for GRADE Windows Graphic Editors. 361-364
  
• Jan Kratochvíl, Teresa M. Przytycka:
  Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract). 365-372
  
• William Lenhart, Giuseppe Liotta:
  How to Draw Outerplanar Minimum Weight Triangulations. 373-384
  
• Brendan Madden, Patrick Madden, Steve Powers, Michael Himsolt:
  Portable Graph Layout and Editing. 385-395
  
• Burkhard Monien, Friedhelm Ramme, Helmut Salmen:
  A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. 396-408
  
• Stephen C. North:
  Incremental Layout in DynaDAG. 409-418
  
• Achilleas Papakostas, Ioannis G. Tollis:
  Issues in Interactive Orthogonal Graph Drawing. 419-430
  
• Gilles Paris:
  Automatic Drawing of Compound Digraphs for a Real-Time Power System Simulator. 431-434
  
• Helen C. Purchase, Robert F. Cohen, Murray I. James:
  Validating Graph Drawing Aesthetics. 435-446
  
• Georg Sander:
  A Fast Heuristic for Hierarchical Manhattan Layout. 447-458
  
• Georg Sander, Martin Alt, Christian Ferdinand, Reinhard Wilhelm:
  CLaX - A Visualized Compiler. 459-462
  
• Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
  Crossing Numbers of Meshes. 463-471
  
• Fwu-Shan Shieh, Carolyn McCreary:
  Directed Graphs by Clan-Based Decomposition. 472-482
  
• Martin Skorsky:
  TOSCANA Management System for Conceptual Data. 483-486
  
• Margaret-Anne D. Storey, Hausi A. Müller:
  Graph Layout Adjustment Strategies. 487-499
  
• Kozo Sugiyama, Kazuo Misue:
  A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR. 500-503
  
• Xiaobo Wang, Isao Miyamoto:
  Generating Customized Layouts. 504-515
  
• Richard Webber, Aaron Scott:
  GOVE Grammar-Oriented Visualisation Environment. 516-519
  
• Jun Yang, Clifford A. Shaffer, Lenwood S. Heath:
  SWAN: A Data Structure Visualization System. 520-523
  

Last update Sun May 26 01:54:35 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page