Skip to main content
SpringerLink
Log in

Graph Drawing

Symposium on Graph Drawing, GD'95; Passau, Germany, September 20-22, 1995. Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Franz J. Brandenburg
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1027)

Included in the following conference series:

Conference proceedings info: GD 1995.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (54 papers)

  1. Front Matter

    Download chapter PDF

  2. Quasi-planar graphs have a linear number of edges

    • Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Pages 1-7

  3. Universal 3-Dimensional visibility representations for graphs

    • Helmut Alt, Michael Godau, Sue Whitesides
    Pages 8-19

  4. KGB a customizable graph browser

    • Hartmut Benz
    Pages 20-23

  5. Adocs: a drawing system for generic combinatorial structures

    • François Bertault
    Pages 24-27

  6. New lower bounds for orthogonal graph drawings

    • Therese C. Biedl
    Pages 28-39

  7. The effect of graph layout on inference from social network data

    • Jim Blythe, Cathleen McGrath, David Krackhardt
    Pages 40-51

  8. Drawing nice projections of objects in space

    • Prosenjit Bose, Pedro Ramos, Francisco Gomez, Godfried Toussaint
    Pages 52-63

  9. Optimal algorithms to embed trees in a point set

    • Prosenjit Bose, Michael McAllister, Jack Snoeyink
    Pages 64-75

  10. An experimental comparison of force-directed and randomized graph drawing algorithms

    • Franz J. Brandenburg, Michael Himsolt, Christoph Rohrer
    Pages 76-87

  11. On the complexity of recognizing intersection and touching graphs of disks

    • Heinz Breu, David G. Kirkpatrick
    Pages 88-98

  12. Fast interactive 3-D graph visualization

    • Ingo Bruß, Arne Frick
    Pages 99-110

  13. GD-Workbench: A system for prototyping and testing graph drawing algorithms

    • Luciano Buti, Giuseppe Di Battista, Giuseppe Liotta, Emanuele Tassinari, Francesco Vargiu, Luca Vismara
    Pages 111-122

  14. CABRI-Graph: A tool for research and teaching in graph theory

    • Yves Carbonneaux, Jean -Marie Laborde, Rafaï Mourad Madani
    Pages 123-126

  15. Graph folding: Extending detail and context viewing into a tool for subgraph comparisons

    • M. Sheelagh, T. Carpendale, David J. Cowperthwaite, F. David Fracchia, Thomas Shermer
    Pages 127-139

  16. Upward numbering testing for triconnected graphs

    • M. Chandramouli, A. A. Diwan
    Pages 140-151

  17. On a visibility representation of graphs

    • F. J. Cobos, J. C. Dana, F. Hurtado, A. Márquez, F. Mateos
    Pages 152-161

  18. 3D graph drawing with simulated annealing

    • Isabel F. Cruz, Joseph P. Twarog
    Pages 162-165

  19. The botanical beauty of random binary trees

    • Luc Devroye, Paul Kruszewski
    Pages 166-177

  20. The strength of weak proximity (extended abstract)

    • Giuseppe Di Battista, Giuseppe Liotta, Sue Whitesides
    Pages 178-189
Back to top

Other volumes

  1. Graph Drawing

Keywords

About this book

This book constitutes the refereed proceedings of the international Symposium on Graph Drawing, GD '95, held in Passau, Germany, in September 1995.
The 40 full papers and 12 system demonstrations were selected from a total of 88 submissions and include, in their revised versions presented here, the improvements suggested during the meeting. This book also contains a report on the graph-drawing contest held in conjunction with GD '95. Graph drawing is concerned with the problem of visualizing structural information, particularly by constructing geometric representations of abstract graphs and networks. The importance of this area for industrial applications is testified by the large number of people with industrial affiliations, submitting papers and participating in the meeting.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation