Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the Symposium on Graph Drawing, GD'96 (Berkeley, CA, USA, September 18-20, 1996)

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Bipartite embeddings of trees in the plane
M. Abellanas, J. García, G. Hernández, M. Noy, P. Ramos
Lecture Notes in Computer Science 1190, 1997, pp. 1-10
Series-parallel planar ordered sets have pagenumber two
Mohammad Alzohairi, Ivan Rival
Lecture Notes in Computer Science 1190, 1997, pp. 11-24
On rectangle visibility graphs
Prosenjit Bose, Alice Dean, Joan Hutchinson, Thomas Shermer
Lecture Notes in Computer Science 1190, 1997, pp. 25-44
A graph drawing and translation service on the WWW
Stina Bridgeman, Ashim Garg, Roberto Tamassia
Lecture Notes in Computer Science 1190, 1997, pp. 45-52
Drawing 2-, 3- and 4-colorable graphs in O(n^2) volume
Tiziana Calamoneri, Andrea Sterbini
Lecture Notes in Computer Science 1190, 1997, pp. 53-62
Optimizing area and aspect ratio in straight-line orthogonal tree drawings
Timothy Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
Lecture Notes in Computer Science 1190, 1997, pp. 63-75
Drawing directed acyclic graphs: An experimental study
G. di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara
Lecture Notes in Computer Science 1190, 1997, pp. 76-91
Circular layout in the graph layout toolkit
Uğur Doğrusöz, Brendan Madden, Patrick Madden
Lecture Notes in Computer Science 1190, 1997, pp. 92-100
Multilevel visualization of clustered graphs
Peter Eades, Qing-Wen Feng
Lecture Notes in Computer Science 1190, 1997, pp. 101-112
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
Peter Eades, Qing-Wen Feng, Xuemin Lin
Lecture Notes in Computer Science 1190, 1997, pp. 113-128
Graph-drawing contest report
Peter Eades, Joe Marks, Stephen North
Lecture Notes in Computer Science 1190, 1997, pp. 129-138
Two algorithms for three dimensional orthogonal graph drawing
Peter Eades, Antonios Symvonis, Sue Whitesides
Lecture Notes in Computer Science 1190, 1997, pp. 139-154
2-visibility drawings of planar graphs
Ulrich Föss̈meier, Goos Kant, Michael Kaufmann
Lecture Notes in Computer Science 1190, 1997, pp. 155-168
Upper bounds on the number of hidden nodes in Sugiyama's algorithm
Arne Frick
Lecture Notes in Computer Science 1190, 1997, pp. 169-183
Integration of declarative approaches
Arne Frick, Can Keskin, Volker Vogelmann
Lecture Notes in Computer Science 1190, 1997, pp. 184-192
GIOTTO3D: A system for visualizing hierarchical structures in 3D
Ashim Garg, Roberto Tamassia
Lecture Notes in Computer Science 1190, 1997, pp. 193-200
A new minimum cost flow algorithm with applications to graph drawing
Ashim Garg, Roberto Tamassia
Lecture Notes in Computer Science 1190, 1997, pp. 201-216
Constrained graph layout
Weiqing He, Kim Marriott
Lecture Notes in Computer Science 1190, 1997, pp. 217-232
The graphlet system
Michael Himsolt
Lecture Notes in Computer Science 1190, 1997, pp. 233-240
On the edge label placement problem
Konstantinos G. Kakoulis, Ioannis G. Tollis
Lecture Notes in Computer Science 1190, 1997, pp. 241-256
Intersection graphs of noncrossing arc-connected sets in the plane
Jan Kratochvíl
Lecture Notes in Computer Science 1190, 1997, pp. 257-270
Wiring edge-disjoint layouts
Ruth Kuchem, Dorothea Wagner
Lecture Notes in Computer Science 1190, 1997, pp. 271-285
Proximity drawings of outerplanar graphs
William Lenhart, Giuseppe Liotta
Lecture Notes in Computer Science 1190, 1997, pp. 286-302
Automatic visualization of two-dimensional cellular complexes
L.A.P. Lozada, C.F.X. de Mendonça, R.M. Rosi, J. Stolfi
Lecture Notes in Computer Science 1190, 1997, pp. 303-317
An alternative method to crossing minimization on hierarchical graphs
Petra Mutzel
Lecture Notes in Computer Science 1190, 1997, pp. 318-333

Seiten 1 2 >