ISBN: 3-540-66904-3
TITLE: Graph Drawing
AUTHOR: Kratochvil, Jan (Ed.)
TOC:

Invited Talk
The Anatomy of a Geometric Algorithm 1
Jir Matouek (Charles University)
Orthogonality I
Turn-Regularity and Planar Orthogonal Drawings 8
Stina S. Bridgeman, Roberto Tamassia, Luca Vismara (Brown University), Giuseppe Di Battista, Walter Didimo (Universit di Roma Tre) and Giuseppe Liotta (Universit di Perugia)
Combining Graph Labeling and Compaction} 27
Gunnar W. Klau, Petra Mutzel (MaxPlanckInstitut fr Informatik)
Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time 38
Ashim Garg (State University of New Yorka at Buffalo), Giuseppe Liotta (Universit Di Perugia)
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing 49
M. Closson, S. Gartshore, J. Johansen and S. K. Wismath (University of Lethbridge)
Levels I
An E log E Line Crossing Algorithm for Levelled Graphs 59
Vance Waddle, Ashok Malhotra (IBM Thomas J. Watson Research Center)
Level Planar Embedding in Linear Time 72
Michael Jnger, Sebastian Leipert (Universitt zu Kln)
Higres  Visualization System for Clustered Graphs and Graph Algorithms 82
Ivan A. Lisitsyn, Victor N. Kasyanov (A. P. Ershov's Institute of Informatics Systems)
Clusters I
Partitioning Approach to Visualization of Large Graphs 90
Vladimir Batagelj, Andrej Mrvar and Matja Zavernik (University of Ljubljana)
Graph Clustering Using Distance-k Cliques 98
Jubin Edachery, Arunabha Sen (Arizona State University) and Franz J. Brandenburg (Universitt Passau)
Drawing I
A Framework for Circular Drawings of Networks 107
Janet M. Six, Ioannis G. Tollis (The University of Texas)
Drawing Planar Graphs with Circular Arcs 117
C. C. Cheng, C. A. Duncan, M. T. Goodrich and S. G. Kobourov (The John Hopkins University)
Drawing Graphs in the Hyperbolic Plane 127
Bojan Mohar (University of Ljubljana)
Invited Talk
Graph Planarity and Related Topics 137
Robin Thomas (Georgia Institute of Technology)
Planarity
Grid Drawings of Four-Connected Plane Graphs 145
Kazuyuki Miura, Takao Nishizeki (Tohoku University) and Shin-ichi Nakano (Gunma University)
Graph Embedding with Topological Cycle-Constraints 155
Christoph Dornheim (University of Freiburg)
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs 165
Michael Kaufmann, Roland Wiese (Universitt Tbingen)
The Constrained Crossing Minimization Problem 175
Petra Mutzel, Thomas Ziegler (Max-Planck-Institut fr Informatik)
Clusters II
Planarity-Preserving Clustering and Embedding for Large Planar Graphs 186
Christian A. Duncan, Michael T. Goodrich and Stephen G. Kobourov (The John Hopkins University)
An Algorithm for Drawing Compound Graphs 197
Franois Bertault, Mirka Miller (University of Newcastle)
Levels II
The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation 205
Patrick Healy, Ago Kuusik (University of Limerick)
Using Sifting for k-Layer Straightline Crossing Minimization 217
Christian Matuszewski, Robby Schnfeld, and Paul Molitor (University Halle-Wittenberg)
On 3-Layer Crossings and Pseudo Arrangements 225
Farhad Shahrokhi (University of North Texas), Imrich Vrto (Slovak Academy of Sciences)
Applications
Visualizing Algorithms for the Design and Analysis of Survivable Networks 232
Ala Eddine Barouni (University of Tunis), Ali Jaoua (University Dhahran) and Nejib Zaguia (Ottawa)
LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation 242
Lila Behzadi (York University)
Centrality in Policy Network Drawings 250
Ulrik Brandes, Dorothea Wagner (University of Konstanz) and Patrick Kenis (Free University, Amsterdam )
Straight-Line Drawings of Protein Interactions 259
Wojciech Basalaj (University of Cambridge Computer Laboratory), Karen Eilbeck (University of Manchester Biochemistry Division)
Invited Talk
Art of Drawing 267
Jaroslav Neetril (Charles University)
Symmetry
An Heuristic for Graph Symmetry Detection 276
Hubert de Fraysseix (CRNS UMR, Paris)
Isomorphic Subgraphs 286
Sabine Bachl (University of Passau)
Orthogonality II
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size 297
G. Di Battista, W. Didimo, M. Patrignani and M. Pizzonia (Universit di Roma Tre)
Multi-dimensional Orthogonal Graph Drawing with Small Boxes 311
David R. Wood (Monash University)
Representations
Geometric Realization of Simplicial Complexes 323
Patrice Ossona de Mendez (CNRS UMR, Paris)
Visibility Representations of Complete Graphs 333
Robert Babilon, Helena Nyklov, Ondrej Pangrc and Jan Vondrk
(Charles University)
Triangle-Free Planar Graphs as Segments Intersection Graphs 341
N. de Castro, F. J. Cobos, J. C. Dana, A. Mrquez (Universidad de Sevilla) and Marc Noy (Universitat Politcnica de Catalunya)
Drawing II
A Force-Directed Algorithm that Preserves Edge Crossing Properties 351
Franois Bertault (University of Newcastle)
Proximity and Trees
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles 359
Therese Biedl (University of Waterloo), Anna Bretscher (Queen's University) and Henk Meijer (Queen's University)
Voronoi Drawings of Trees 369
Giuseppe Liotta (Univ. of Perugia), Henk Meijer (Queen's Univ.)
Infinite Trees and the Future 379
C. Demetrescu, Irene Finocchi (Universit di Roma "La Sapienza"),
Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia (Universit di Roma Tre) and Giuseppe Liotta (Universit di Perugia),
Latour - A Tree Visualisation System 392
Ivan Herman, Guy Melanon, Maurice M de Ruiter (Centrum voor Wiskunde en Informatica) and Maylis Delest (Universit Bordeaux)
Graph Drawing Contest
Graph-Drawing Contest Report 400
Franz J. Brandenburg, Falk Schreiber (Universitt Passau), Michael Jnger (Universitt zu Kln), Joe Marks (MERL) and Petra Mutzel (Max-Planck-Institut fr Informatik)
Hunting Down Graph B 410
Ulrik Brandes (Brown University)
Posters
Orthogonal and Straight-Line Drawings of Graphs with Succinct
Representations 416
Ho-Lin Chen, Hsu-Chun Yen (National Taiwan University)
Electronic Biochemical Pathways 418
Carl-Christian Kanne (Universitt Mannheim), Falk Schreiber
(Universitt Passau) and Dietrich Trmbach (Universitt
Erlangen-Nrnberg)
Author Index 421
END
