GD 2002:
Irvine, California, USA
Stephen G. Kobourov, Michael T. Goodrich (Eds.):
Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers.
Lecture Notes in Computer Science 2528 Springer 2002, ISBN 3-540-00158-1 
Papers
- Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner:
Sketch-Driven Orthogonal Graph Drawing.
1-11
- Michael Kaufmann, Roland Wiese:
Maintaining the Mental Map for Circular Drawings.
12-22
- Stephan Diehl, Carsten Görg:
Graphs, They Are Changing.
23-30
- Sabine Cornelsen, Thomas Schank, Dorothea Wagner:
Drawing Graphs on Two and Three Lines.
31-41
- Vida Dujmovic, Pat Morin, David R. Wood:
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.
42-53
- Therese C. Biedl:
Drawing Outer-Planar Graphs in O(n log n) Area.
54-65
- Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Computing Labeled Orthogonal Drawings.
66-73
- Sabine Bachl, Franz-Josef Brandenburg:
Computing and Drawing Isomorphic Subgraphs.
74-85
- David Abelson, Seok-Hee Hong, Donald E. Taylor:
A Group-Theoretic Method for Drawing Graphs Symmetrically.
86-97
- Patrick Healy, Nikola S. Nikolov:
A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem.
98-109
- Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Geometric Systems of Disjoint Representatives.
110-117
- Vida Dujmovic, Sue Whitesides:
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.
118-129
- Wilhelm Barth, Michael Jünger, Petra Mutzel:
Simple and Efficient Bilayer Cross Counting.
130-141
- Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani:
Orthogonal 3D Shapes of Theta Graphs.
142-149
- David Eppstein:
Separating Thickness from Geometric Thickness.
150-161
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs.
162-173
- Amrita Chanda, Ashim Garg:
Compact Encodings of Planar Orthogonal Drawings.
174-185
- Ondrej Sýkora, László A. Székely, Imrich Vrto:
Fractional Lengths and Crossing Numbers.
186-192
- Liran Carmel, David Harel, Yehuda Koren:
Drawing Directed Graphs Using One-Dimensional Optimization.
193-206
- David Harel, Yehuda Koren:
Graph Drawing by High-Dimensional Embedding.
207-219
- Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher:
Advances in C-Planarity Testing of Clustered Graphs.
220-235
- Marcus Raitner:
HGV: A Library for Hierarchies, Graphs, and Views.
236-243
- Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh:
Rectangular Drawings of Planar Graphs.
244-255
- Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki:
Extended Rectangular Drawings of Plane Graphs with Designated Corners.
256-267
- Soon Tee Teoh, Kwan-Liu Ma:
RINGS: A Technique for Visualizing Large Hierarchies.
268-275
- Michael Forster:
Applying Crossing Reduction Strategies to Layered Compound Graphs.
276-284
- Thomas Eschbach, Wolfgang Günther, Rolf Drechsler, Bernd Becker:
Crossing Reduction by Windows Optimization.
285-294
- János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth:
Geometric Graphs with No Self-intersecting Path of Length Three.
295-311
- Matthew Newton, Ondrej Sýkora, Imrich Vrto:
Two New Heuristics for Two-Sided Bipartite Graph Drawing.
312-319
- Ashim Garg, Adrian Rusu:
Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio.
320-331
- Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen:
Some Applications of Orderly Spanning Trees in Graph Drawing.
332-343
- Christoph Buchheim, Michael Jünger, Sebastian Leipert:
Improving Walker's Algorithm to Run in Linear Time.
344-353
- Walter Bachl:
Semi-dynamic Orthogonal Drawings of Planar Graphs.
354-361
Software Demonstrations
- Gilles Diguglielmo, Eric Durocher, Philippe Kaplan, Georg Sander, Adrian Vasiliu:
Graph Layout for Workflow Applications with ILOG JViews.
362-363
- Kyungsook Han, Byong-Hyon Ju, Jong H. Park:
InterViewer: Dynamic Visualization of Protein-Protein Interactions.
364-365
- Danil E. Baburin:
Some Modifications of Sugiyama Approach.
366-367
- Ugur Dogrusöz, Burkay Genç:
A Framework for Complexity Management in Graph Visualization.
368-369
- Yanga Byun, Euna Jeong, Kyungsook Han:
A Partitioned Approach to Protein Interaction Mapping.
370-371
- Ileana Streinu, Elif Tosun:
Camera Position Reconstruction and Tight Direction Networks.
372-373
- Paul Mutton, Peter Rodgers:
Demonstration of a Preprocessor for the Spring Embedder.
374-375
Graph Drawing Contest
Invited Talks
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
