Thursday September 18, 1997

Registration (8:45 - 9:15)

Welcome address (9:15 - 9:30)

Session (9:30 - 10:50): Planarity and Crossings

Chair: Sue Whitesides (McGill U.)
• Drawable and Forbidden Minimum Weight Triangulations
William Lenhart (Williams C.) and Giuseppe Liotta (U. Rome I)
 
• A Polyhedral Approach to the Multi-Layer Crossing Number Problem
Michael Junger (U. Koeln), Eva K. Lee (Columbia U.), Petra Mutzel (MPI), and Thomas Odenthal (Columbia U.)
 
• On Embedding an Outer-Planar Graph in a Point Set
Prosenjit Bose (Carleton U.)
 
• Bipartite crossing numbers of mesh and hypercube
Ondrej Sykora (U. Bordeaux I) and Imrich Vrto (Slovak Ac. Sci.)

Coffee break (10:50 - 11:20)

Session (11:20 - 13:00): Drawings in the Air

Chair: Joe Marks (MERL)
• Three-dimensional grid drawings of graphs
Janos Pach, Torsten Thiele, and Geza Toth (NYU and Hungarian Ac. Sci.)
 
• Incremental Orthogonal Graph Drawing in Three Dimensions
Achilleas Papakostas and Ioannis G. Tollis (U. Texas Dallas)
 
• On Three-Dimensional Layout of Interconnection Networks
Tiziana Calamoneri and Annalisa Massini (U. Rome I)
 
• Orthogonal 3-D Graph Drawing
Therese Biedl (Rutgers U.), Tom Shermer (Simon Fraser U.), Sue Whitesides (McGill U.), and Stephen Wismath (U. Lethbridge)
 
• Finding Best Viewpoints for Three-Dimensional Graph Drawings
Peter Eades , Michael E. Houle, and Richard Webber (U. Newcastle)

Lunch (13:00 - 14:30)

Session (14:30 - 15:50): Left and Right Turns

Chair: Petra Mutzel (MPI)
• A Linear-Time Algorithm for Orthogonal Drawings
Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki (Tohoku U.)
 
• Interactive Orthogonal Graph Drawing: Algorithms and Bounds
Ulrich Foessmeier (U. Tuebingen)
 
• Embedding a graph in the grid of a surface with the minimum number bends is NP-hard
Maria Angeles Garrido and Alberto Marquez (U. Sevilla)
 
• Algorithms and Area Bounds for Nonplanar Orthogonal Drawings
Ulrich Foessmeier and Michael Kaufmann (U. Tuebingen)

Coffee break (15:50 - 16:20)

Session (16:20 - 17:40): Clustering and Labeling

Chair: Ashim Garg (SUNY Buffalo)
• Drawing Clustered Graphs on an Orthogonal Grid
Peter Eades (U. Newcastle) and Qingwen Feng (Tom Sawyer Software)
 
• Graph Clustering I: Circles of Cliques
Franz J. Brandenburg (U. Passau)
 
• An Algorithm for Labeling Edges of Hierarchical Drawings
Konstantinos G. Kakoulis and Ioannis G. Tollis (U. Texas Dallas)
 
• Elastic Labels: the two-axis case
Claudia Iturriaga and Anna Lubiw (U. Waterloo)

Friday September 19, 1997

Session (9:00 - 9:50): Invited Lecture

Chair: Franz J. Brandenburg (U. Passau)
• Coloring of Plane Configurations
Jaroslav Nesetril (Charles U.)

Session (9:50 - 11:10): Crossings and Planarity

Chair: Giuseppe Liotta (U. Rome I)
• Pitfalls of using PQ-trees in Automatic Graph Drawing
Michael Juenger, Sebastian Leipert (U. Koeln), and Petra Mutzel (MPI)
 
• Graph drawings with no k pairwise crossing edges
Pavel Valtr (Charles U. and DIMACS)
 
• Area Requirements for Drawing Hierarchically Planar Graphs
Xuemin Lin (U. Western Australia) and Peter Eades (U. Newcastle)
 
• A Short Proof of a Gauss Problem
Hubert de Fraysseix and Patrice Ossona de Mendez (CNRS)

Coffee break (11:10 - 11:40)

Session (11:40 - 13:00): Methodologies and Applications I

Chair: Ioannis G. Tollis (U. Texas Dallas)
• A Bayesian Paradigma for Dynamic Graph Layout
Ulrik Brandes and Dorothea Wagner (U. Konstanz)
 
• Which aesthetic has the greatest effect on human understanding?
Helen Purchase (U. Queensland)
 
• Implementing a general-purpose edge router
David Dobkin (Princeton U.), Emden Gansner, Eleftherios Koutsofios, and Stephen North (AT&T)
 
• The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems
Sandor Fekete (U. Koeln), Michael E. Houle (U. Newcastle), and Sue Whitesides (McGill U.)

Lunch (13:00 - 14:30)

Session (14:30 - 16:00): Systems I

Chair: Stephen North (AT&T)
• 3DCube: a Tool for Three Dimensional Graph Drawing
Maurizio Patrignani (U. Rome III) and Francesco Vargiu (AIPA)
 
• Graph Clustering Using Multiway Ratio Cut
Tom Roxborough, Jay Noh, and Arunabha Sen (Arizona St. U.)
 
• ArchE: A Graph Drawing System for Archaeology
Christoph Hundack, Petra Mutzel, Igor Pouchkarev, and Stefan Thome (MPI)
 
• Interactive Orthogonal Graph Drawing
Stina S. Bridgeman, Jody Fanto (Brown U.), Ashim Garg (SUNY Buffalo), Roberto Tamassia, and Luca Vismara (Brown U.)
 
• GRID:An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends
Walter Didimo (U. Rome III) and Antonio Leonforte (Integra)
 
• Lexical Navigation: Using Incremental Graph Drawing for Query Refinement
Daniel Tunkelang (Carnegie Mellon U.), Roy J. Byrd (IBM), and James Cooper (Carnegie Mellon U.)

Coffee break (16:00 - 16:30)

Session (16:30 - 17:30): Systems II

Chair: Roberto Tamassia (Brown U.)
• A Design Gallery Browser Based on Graph Drawing
Kathy Ryall, Wheeler Ruml (Harvard U.), Brad Andalman , Joe Marks (MERL), and Stuart Shieber (Harvard U.)
 
• Online Animated Graph Drawing for Web Navigation
Peter Eades, Robert F. Cohen, and Mao Lin Huang (U. Newcastle)
 
• Grappa: A Graph Package in Java
Wenke Lee (Columbia U.), Naser S. Barghouti, and John Mocenigo (AT&T)
 
• GraVis - System Demonstration
Harald Lauer, Matthias Ettrich, and Klaus Soukup (U. Tuebingen)

Banquet

Saturday September 20, 1997

Session (9:00 - 9:50): Invited Lecture

Chair: Jan Kratochvil (Charles U.)
• Some Problems on Packing of Triangles in a Planar Graph
Claude Berge (CNRS)

Session (9:50 - 11:10): Packing, Compressing, and Touching

Chair: Hubert de Fraysseix (CNRS)
• Touching graphs of unit balls
Petr Hlineny (Charles U.)
 
• Discrete Realizations of Contact and Intersection Graphs
Jurek Czyzowicz (U. Quebec Hull), Evangelos Kranakis, Danny Krizanc (Carleton U.), and Jorge Urrutia (U. Ottawa)
 
• Minimum Area h-v Drawings of Complete Binary Trees
Pierluigi Crescenzi and P. Penna (U. Roma I)
 
• Packing Trees into Planar Graphs
A. Garcia (U. Zaragoza), C. Hernando, F. Hurtado, M. Noy (U. Politecnica Catalunya), and J. Tejel (U. Zaragoza)
 

Coffee break (11:10 - 11:40)

Session (11:40 - 13:00): Methodologies and Applications II

Chair: Peter Eades (U. Newcastle)
• The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing
Therese C. Biedl (Rutgers U.), Brendan P. Madden (Tom Sawyer Software), and Ioannis G. Tollis (U. Texas Dallas)
 
• NicheWorks-Interactive Visualization of Very Large Graphs
Graham J. Wills (Lucent Tech.)
 
• Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams
Jochen Seemann (Wuerzburg U.)
 
• Graph Drawing and Manipulation with LINK
Jon Berry (Elon C.), Nathaniel Dean (Bell Labs.), Mark Goldberg (Rensslaer Pol. Inst.), Gregory Shannon (Milkyway Tech.), and Steven Skiena (SUNY Stony Brook)

Concluding Remarks (13:00 - 13:15)