Wednesday, September 20, 2000 AInformatik Linear Time Implementation of SPQR-Trees Carsten Gutwenger, Max-Planck-Institut für

5:00 - 7:00 Registration and Reception Petra Mutzel, Technische Universität Wien Thursday, September 21, 2000 Labeling Points with Rectangles of Various Shapes Shin-ichi Nakano, Gunma University 8:45 – 9:45 Invited Talk GD 2000 Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe, Tohoku University Preliminary Program The Visual Representation of Information Structures How to Draw the Minimum Cuts of a Planar Colin Ware, University of New Hampshire Graph Colonial Williamsburg, Ulrik Brandes, Sabine Cornelsen, Dorothea 10:05 – 12:00 Empirical Studies & Standards Wagner, University of Konstanz Virginia, USA Chair: Wendy Feng September 20-23, 2000 User preference of graph layout aesthetics: a 3:40 – 5:35 Applications & Systems UML study Chair: Ashim Garg Helen C. Purchase, Jo-Anne Allder, David Sophia-Antipolis Carrington, The 2D-Structure Drawing of Similar Molecules J.D. Boissonnat, F. Cazals, J. Flötotto, INRIA AUniversity User Study in Similarity Measures for Konstanz Stina Bridgeman, Roberto Tamassia, Brown Fast Layout Methods for Timetable Graphs UlrikUniversity Brandes, Dorothea Wagner, University of Interactive Partitioning (short paper) Galina Shubina, Roberto Tamassia, Brown Neal Lesh, Joe Marks, Maurizio Patrignani, MERL—Mitsubishi Electric Research Labs An Algorithmic Framework for Visualizing Texas at Dallas An Experimental Comparison of Orthogonal Statecharts CompactionInformatik Algorithms R. Castello, R. Mili, I.G. Tollis, The University of Gunnar Klau, Karsten Klein, Max-Planck-Institut für

Petra Mutzel, Technische Universität Wien Visualization of the Autonomous Systems Regular papers: 25 minutes Interconnections with Hermes GraphXML-An XML-based graph description Andrea Carmignani, Giuseppe Di Battista, Walter formatand Computer Sciences (CWI), The Netherlands Short papers: 15 minutes Didimo, Francesco Matera, Maurizio Pizzonia, I. Herman, M.S. Marshall, Centre for Mathematics Università di Roma Tre

Drawing hypergraphs in the subset standard 1:30 - 3:10 Theory I Newcastle (short paper) Chair: Michael Kaufmann François Bertault, Peter Eades, University of

On Polar Visibility Representations of Graphs Joan P. Hutchinson, Macalester College Friday, September 22, 2000 k-layerUniversity Straightline Crossing Minimization by Saturday, September 23, 2000 Speeding up Sifting (short paper) Wolfgang Günther, Bernd Becker, Albert-Ludwigs 8:45 – 9:45 Invited Talk University 9:00 – 10:30 Theory II Robby Schönfeld, Paul Molitor, Martin-Luther Chair: Michael Goodrich Knowledge Discovery from Graphs David Jensen, University of Massachusetts ω-Searchlight Obedient Graph Drawings 2:35 – 3:50 Orthogonal Drawing I GillTechnology Barequet, The Technion---Israel Institute of 10:05 – 12:00 Force-Directed Layout Chair: Stephen Wismath Chair: Stephen North Lower Bounds for the Number of Bends in Unavoidable configurations in complete A Multilevel Algorithm for Force-Directed Graph Three-Dimensional Orthogonal Graph Drawings topological graphs Drawing David R. Wood, The JánosAcademy Pach of Courant Sciences Institute NYU and Hungarian C. Walshaw, University of Greenwich Orthogonal Drawings of Cycles in 3D Space Géza Tóth, Courant Institute NYU and MIT A Fast Multi-Scale Method for Drawing Large Science Giuseppe Di Battista, Università di Roma Tre Graphs Giuseppe Liotta, Università di Perugia Minimum Weight Drawings of Maximal David Harel, Yehuda Koren, Weizmann Institute of , University of Waterloo Triangulations Sue Whitesides, McGill University William Lenhart, Williams College Giuseppe Liotta, Università di Perugia FADE: Graph drawing, clustering and visual Newcastle Three-Dimensional Orthogonal Graph Drawing abstraction with Optimal Volume A Layout Algorithm for Bar-visibility Graphs on Aaron Quigley, Peter Eades, University of Therese Biedl, University of Waterloo the Möbius Band (short paper) Torsten Thiele, Frei Universität Berlin Alice M. Dean, Skidmore College David R. Wood, The University of Sydney A Fast Multi-Dimensional Algorithm for Drawing 10:50 – 12:30 Symmetry & Incremental Layout Large Graphs 4:10 – 5:00 Orthogonal Drawing II Chair: Dorothea Wagner Pawel Gajer, Michael T. Goodrich, Stephen G. Chair: Therese Biedl Kobourov, The Johns Hopkins University An Algorithm for Finding Three Dimensional Newcastle A Linear-Time Algorithm for Bend-Optimal Symmetry in Trees GRIP:Hopkins Graph University dRawing with Intelligent OrthogonalUniversity Drawings of Biconnected Cubic Seok-Hee Hong, Peter Eades, University of Placement (short paper) Plane Graphs Pawel Gajer, Stephen G. Kobourov, The Johns Shin-ichi Nakano, Makiko Yoshikawa, Gunma OnUniversity Maximum Symmetric Subgraphs Ho-Lin Chen, Hsu-Chun Yen, National Taiwan 1:10 – 2:15 k-Level Graph Layout Refinement of Three-Dimensional Orthogonal Chair: Roberto Tamassia Graph Drawings Hsueh-I Lu, Academia Sinica Benjamin Y.S. Lynn, Antonios Symvonis, David R. A Fast Layout Algorithm for k-Level Graphs Wood, The University of Sydney Clan-Based Incremental Drawing Christoph Buchheim, Michael Jünger, Sebastian Fwu-Shan Shieh, Minolta QMS, Inc. Leipert, Universität zu Köln Evening Banquet Carolyn L. McCreary, Compaq Computer Corp. Graph Layout for Displaying Data Structures Newcastle Center The Marey graph animation tool demo Vance Waddle, IBM Thomas J. Watson Research Carsten Friedrich, Peter Eades, University of