


default search action
GD 1996: Berkeley, California, USA
- Stephen C. North:

Graph Drawing, Symposium on Graph Drawing, GD '96, Berkeley, California, USA, September 18-20, Proceedings. Lecture Notes in Computer Science 1190, Springer 1997, ISBN 3-540-62495-3 - Manuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Marc Noy, Pedro A. Ramos

:
Bipartite Embeddings of Trees in the Plane. 1-10 - Mohammad Alzohairi, Ivan Rival:

Series-Parallel Planar Ordered Sets Have Pagenumber Two. 11-24 - Prosenjit Bose

, Alice M. Dean, Joan P. Hutchinson, Thomas C. Shermer:
On Rectangle Visibility Graphs. 25-44 - Stina S. Bridgeman, Ashim Garg, Roberto Tamassia:

A Graph Drawing and Translation Service on the WWW. 45-52 - Tiziana Calamoneri

, Andrea Sterbini
:
Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume. 53-62 - Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia:

Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. 63-75 - Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Armando Parise, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, Luca Vismara:

Drawing Directed Acyclic Graphs: An Experimental Study. 76-91 - Ugur Dogrusöz

, Brendan Madden, Patrick Madden:
Circular Layout in the Graph Layout Toolkit. 92-100 - Peter Eades, Qing-Wen Feng:

Multilevel Visualization of Clustered Graphs. 101-112 - Peter Eades, Qing-Wen Feng, Xuemin Lin:

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. 113-128 - Peter Eades, Joe Marks, Stephen C. North:

Graph-Drawing Contest Report. 129-138 - Peter Eades, Antonios Symvonis

, Sue Whitesides:
Two Algorithms for Three Dimensional Orthogonal Graph Drawing. 139-154 - Ulrich Fößmeier, Goos Kant, Michael Kaufmann:

2-Visibility Drawings of Planar Graphs. 155-168 - Arne Frick:

Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. 169-183 - Arne Frick, Can Keskin, Volker Vogelmann:

Integration of Declarative Approaches. 184-192 - Ashim Garg, Roberto Tamassia:

GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D. 193-200 - Ashim Garg, Roberto Tamassia:

A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. 201-216 - Weiqing He, Kim Marriott:

Constrained Graph Layout. 217-232 - Michael Himsolt:

The Graphlet System. 233-240 - Konstantinos G. Kakoulis, Ioannis G. Tollis:

On the Edge Label Placement Problem. 241-256 - Jan Kratochvíl:

Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. 257-270 - Ruth Kuchem, Dorothea Wagner:

Wiring Edge-Disjoint Layouts. 271-285 - William J. Lenhart, Giuseppe Liotta:

Proximity Drawings of Outerplanar Graphs. 286-302 - Luis Arturo Perez Lozada, Candido Ferreira Xavier de Mendonça Neto, R. M. Rosi, Jorge Stolfi:

Automatic Visualization of Two-Dimensional Cellular Complexes. 303-317 - Petra Mutzel

:
An Alternative Method to Crossing Minimization on Hierarchical Graphs. 318-333 - Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki:

A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. 334-344 - János Pach, Géza Tóth:

Graphs Drawn with Few Crossings Per Edge. 345-354 - Achilleas Papakostas, Ioannis G. Tollis:

A Pairing Technique for Area-Efficient Orthogonal Drawings. 355-370 - Achilleas Papakostas, Janet M. Six, Ioannis G. Tollis:

Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing. 371-386 - Kathy Ryall, Joe Marks, Stuart M. Shieber:

An Interactive System for Drawing Graphs. 387-394 - Reinhard Sablowski, Arne Frick:

Automatic Graph Clustering. 395-400 - Kent Wittenburg, Louis Weitzman:

Qualitative Visualization of Processes: Attributed Graph Layout and Focusing Techniques. 401-408

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














