GD 2008: Heraklion, Crete, Greece

Invited Talks

• Jesper Tegnér:
  Networks in Biology - From Identification, Analysis to Interpretation. 1
  
• Roberto Tamassia, Bernardo Palazzi, Charalampos Papamanthou:
  Graph Drawing for Security Visualization. 2-13
  

Papers

• David Eppstein, Michael T. Goodrich:
  Succinct Greedy Graph Drawing in the Hyperbolic Plane. 14-25
  
• Patrizio Angelini, Fabrizio Frati, Luca Grilli:
  An Algorithm to Construct Greedy Drawings of Triangulations. 26-37
  
• Sergio Cabello, Bojan Mohar:
  Crossing and Weighted Crossing Number of Near-Planar Graphs. 38-49
  
• Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth:
  Cubic Graphs Have Bounded Slope Parameter. 50-60
  
• Jan Stola:
  Unimaximal Sequences of Pairs in Rectangle Visibility Drawing. 61-66
  
• Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu:
  Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights. 67-77
  
• David Eppstein:
  The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. 78-89
  
• Apeksha Godiyal, Jared Hoberock, Michael Garland, John C. Hart:
  Rapid Multipole Graph Drawing on the GPU. 90-101
  
• Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil:
  Clustered Planarity: Clusters with Few Outgoing Edges. 102-113
  
• Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel:
  Computing Maximum C-Planar Subgraphs. 114-120
  
• Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický:
  Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. 121-132
  
• Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
  Visual Analysis of One-to-Many Matched Graphs. 133-144
  
• Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
  Topological Morphing of Planar Graphs. 145-156
  
• J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz:
  An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. 157-168
  
• Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
  Graph Simultaneous Embedding Tool, GraphSET. 169-180
  
• Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
  Hamiltonian Alternating Paths on Bicolored Double-Chains. 181-192
  
• Yehuda Koren, Ali Civril:
  The Binary Stress Model for Graph Drawing. 193-205
  
• Emden R. Gansner, Yifan Hu:
  Efficient Node Overlap Removal Using a Proximity Stress Model. 206-217
  
• Ulrik Brandes, Christian Pich:
  An Experimental Study on Distance-Based Graph Drawing. 218-229
  
• Tim Dwyer, Kim Marriott, Michael Wybrow:
  Topology Preserving Constrained Graph Layout. 230-241
  
• Francesco Giordano, Giuseppe Liotta, Sue Whitesides:
  Embeddability Problems for Upward Planar Digraphs. 242-253
  
• Aimal Rextin, Patrick Healy:
  A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs. 254-265
  
• Ulrik Brandes, Barbara Pampel:
  On the Hardness of Orthogonal-Order Preserving Graph Drawing. 266-277
  
• Seok-Hee Hong, Martin Mader:
  Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints. 278-283
  
• Sjoerd van Hagen, Marc J. van Kreveld:
  Placing Text Boxes on Graphs. 284-295
  
• Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi:
  Removing Node Overlaps Using Multi-sphere Scheme. 296-301
  
• Vladimir P. Korzhik, Bojan Mohar:
  Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing. 302-312
  
• Maarten Löffler, Elena Mumford:
  Connected Rectilinear Graphs on Point Sets. 313-318
  
• Martin Kochol:
  3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces. 319-323
  
• Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
  Drawing (Complete) Binary Tanglegrams. 324-335
  
• Evmorfia Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
  Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. 336-347
  
• Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász:
  Cyclic Leveling of Directed Graphs. 348-359
  
• Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
  Constrained Point-Set Embeddability of Planar Graphs. 360-371
  
• Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried:
  Tree Drawings on the Hexagonal Grid. 372-383
  
• David Eppstein:
  Isometric Diamond Subgraphs. 384-389
  
• Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
  Non-convex Representations of Graphs. 390-395
  
• Michael Kaufmann, Marc J. van Kreveld, Bettina Speckmann:
  Subdivision Drawings of Hypergraphs. 396-407
  
• Md. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman:
  Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three. 408-419
  
• Tim Dwyer, Kim Marriott, Michael Wybrow:
  Dunnart: A Constraint-Based Network Diagram Authoring Tool. 420-431
  

Posters

• Markus Chimani, Petr Hlinený, Petra Mutzel:
  Approximating the Crossing Number of Apex Graphs. 432-434
  
• Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso:
  Policy-Aware Visualization of Internet Dynamics. 435-436
  
• Philip Effinger, Michael Kaufmann, Martin Siebenhaller:
  Enhancing Visualizations of Business Processes. 437-438
  
• Cesim Erten, Melih Sözdinler:
  A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs. 439-440
  
• Allison P. Heath, George N. Bennett, Lydia E. Kavraki:
  Visualizing the Results of Metabolic Pathway Queries. 441-442
  
• Sonja Maier, Steffen Mazanek, Mark Minas:
  Visual Specification of Layout. 443-444
  
• Tamara Mchedlidze, Antonios Symvonis:
  Spine Crossing Minimization in Upward Topological Book Embeddings. 445-446
  
• Georg Sander:
  ILOG Elixir. 447-448
  
• Vassilis Tsiaras, Ioannis G. Tollis:
  DAGmap View. 449-450
  
• Vassilis Tsiaras, Ioannis G. Tollis, Vangelis Sakkalis:
  Brain Network Analyzer. 451-452
  

Graph Drawing Contest

• Ugur Dogrusöz, Christian A. Duncan, Carsten Gutwenger, Georg Sander:
  Graph Drawing Contest Report. 453-458