Reminder: Graph Drawing 2002 -- Call for Participation

[Michael T. Goodrich]

This is a brief reminder that the deadline for early registration for
Graph Drawing 2002 is July 31, 2002.

> 
> 	      10th Annual Conference on Graph Drawing
> 			Graph Drawing 2002
> 
> 			Irvine, California
> 			August 26-28, 2002
> 
> 		  http://www.ics.uci.edu/~gd2002/
> 
> Call for Pariticipation: The Graph Drawing conference is the primary
> forum for papers devoted exclusively to techniques and systems for the 
> visualization of relational and connectivity information represented
> in graphs. 
> 
> The deadline for early registration is July 31, 2002.
> Registration must be done online (by clicking the appropriate button)
> at the conference web site: http://www.ics.uci.edu/~gd2002/
> 
> Accepted papers:
> 
> A Hybrid Approach for Visualising Large Network Topologies
> Siew Cheong Au, Christopher Leckie, Ajeet Parhar and Gerard Wong
> 
> Improving Walker's Algorithm to Run in Linear Time
> Christoph Buchheim, Michael Juenger and Sebastian Leipert
> 
> Graph Layout for Workflow Applications with ILOG JViews (System Demonstration)
> Gilles Diguglielmo, Eric Durocher, Philippe Kaplan, Georg Sander
> 
> Drawing outer-planar graphs in O(n log n) area
> Therese Biedl
> 
> Separating Thickness from Geometric Thickness
> David Eppstein
> 
> Book Embeddings and Point-Set Embeddings of Series-Parallel
> Emilio Di Giacomo, Walter Didimo and Giuseppe Liotta 
> 
> Computing Labeled Orthogonal Drawings
> Carla Binucci, Walter Didimo, Giuseppe Liotta and Maddalena
> 
> Orthogonal 3D Shapes of Theta Graphs
> Emilio Di Giacomo, Giuseppe Liotta and Maurizio Patrignani
> 
> Sketch-Driven Orthogonal Graph Drawing
> Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann and Dorothea Wagner
> 
> Some Applications of Orderly Spanning Trees in Graph Drawing
> Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu and Hsu-Chun Yen
> 
> Graphs, They are Changing -- Dynamic Graph Drawing for a Sequence of Graphs
> Stephan Diehl and Carsten Goerg
> 
> Pathwidth and Three-Dimensional Straight Line Grid Drawings of Graphs
> Vida Dujmovi{\'c}, Pat Morin and David R. Wood
> 
> InterViewer: Dynamic Visualization of Protein-Protein Interactions
> Kyungsook Han and Byong-Hyon Ju
> 
> Compact Encodings of Planar Orthogonal Drawings
> Amrita Chanda and Ashim Garg
> 
> Some Modifications of Sugiyama Approach
> Danil E. Baburin
> 
> Semi-Dynamic Orthogonal Drawings of Planar Graphs
> Walter Bachl
> 
> Rectangular Drawings of Planar Graphs
> Md. Saidur Rahman, Takao Nishizeki and Shubhashis Ghosh
> 
> Extended Rectangular Drawings of Plane Graphs with Designated Corners
> Kazuyuki Miura, Ayako Miyazawa and Takao Nishizeki
> 
> Graph Drawing by High-Dimensional Embedding
> Yehuda Koren and David Harel
> 
> Layering of Nodes of Arbitrary Size
> Falk Schreiber
> 
> HGV: A Library for Hierarchies, Graphs, and Views
> Marcus Raitner
> 
> Applying Crossing Reduction Strategies to Layered Compound Graphs
> Michael Forster
> 
> Computing and Drawing Isomorphic Subgraphs
> S. Bachl  and F.J. Brandenburg
> 
> A Framework for Complexity Management in Graph Visualization
> U. Dogrusoz and B. Genc
> 
> Advances in C-Planarity Testing of Clustered Graphs
> Carsten Gutwenger, Michael J{\"u}nger, Sebastian Leipert, Petra Mutzel, Merijam Percan and Ren{\'e} Weiskircher
> 
> A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem
> Patrick Healy and Nikola S. Nikolov
> 
> Simple and Efficient Bilayer Cross Counting
> W. Barth, M. Juenger and P. Mutzel
> 
> Two New Heuristics for Two-Sided Bipartite Graph Drawings
> Matthew Newton, Ondrej Sykora and Imrich Vrto
> 
> Crossing Reduction by Windows Optimization
> T. Eschbach, W. Guenther, B. Becker and R. Drechsler
> 
> Drawing Graphs on Two and Three Lines
> Sabine Cornelsen, Thomas Schank and Dorothea Wagner
> 
> Fractional Lengths and Crossing Numbers
> Ondrej Sykora, Laszlo A. Szekely and Imrich Vrto
> 
> A Partitioned Approach to Protein Interaction Mapping
> Yanga Byun, Euna Jeong and Kyungsook Han
> 
> Straight-line Drawings of Binary Trees with Linear Area and Good Aspect Ratio
> Ashim Garg and Adrian Rusu
> 
> An Efficient Fixed Parameter Tractable Algorithm for 1-Sided
> Vida Dujmovic and Sue Whitesides
> 
> Camera Position Reconstruction and Tight Decision Networks
> Ileana Streinu and Elif Tosun
> 
> Geometric graphs with no self-intersecting path of
> Janos Pach, Rom Pinchasi and Gabor Tardos
> 
> Drawing Directed Graphs Using One-Dimensional Optimization
> Liran Carmel and Yehuda Koren
> 
> A Preprocessor and Two Approximations for the Spring Embedder
> P.J. Mutton and P.J. Rodgers
> 
> Geometric Systems of Disjoint Representatives
> Jiri Fiala, Jan Kratochvil and Andrzej Proskurowski
> 
> Maintaining the Mental Map for Circular Drawings
> Michael Kaufmann and Roland Wiese
> 
> RINGS: A Technique for Visualizing Large Hierarchies
> Soon Tee Teoh and Kwan-Liu Ma
> 
> A Group-Theoretic Method for Drawing Graphs Symmetrically
> D. Abelson and S.-H. Hong
> 


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.