Home Page
OVERVIEW
News
Important Dates
Location
Tradition
Contact
GD 2008 Poster

AUTHOR INFO
Call for Papers
Program Committee
Organizing Committee
Steering Committee
Paper Submission

CONFERENCE
Registration
Accepted Papers
Conference Program
Conference Abstracts
GD 2008 Contest
GD 2008 Proceedings
GD 2008 Proceedings

CONFERENCE VENUE
Accommodation
Travel Information
About Crete
Photos

RELATED EVENTS
 
Go to
GD 2009
17th International Symposium on Graph Drawing (GD 2009)
 
 
FORTH-ICS
University of Crete
 
GD 2008 Accepted Papers  
   

Yehuda Koren and Ali Civril
The Binary Stress Model for Graph Drawing

Jan Stola
Unimaximal sequences of pairs in rectangle visibility drawing

Martin Kochol
3-Regular non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces

Chie-Yu Chen, Ya-Fei Hung and Hsueh-I Lu
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights

Balázs Keszegh, János Pach, Dömötör Pálvölgyi and Géza Tóth
Cubic graphs have bounded slope parameter

David Eppstein
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing

Maarten Löffler and Elena Mumford
Connected Rectilinear Graphs on Point Sets

J. Joseph Fowler, Carsten Gutwenger, Michael Juenger, Petra Mutzel and Michael Schulz
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

Apeksha Godiyal, Jared Hoberock and John Hart
Rapid Multipole Graph Drawing on the GPU

Emden Gansner and Yifan Hu
Efficient Node Overlap Removal Using a Proximity Stress Model

Evmorfia Argyriou, Michael Bekos, Michael Kaufmann and Antonios Symvonis
Two Polynomial Time Algorithms for the Metro-Line Crossing Minimization Problem

Alejandro Estrella-Balderrama, J. Joseph Fowler and Stephen Kobourov
Graph Simultaneous Embedding Tool

Ondrej Suchý, Vít Jelínek, Marek Tesar and Tomáš Vyskocil
Clustered Planarity: Clusters with Few Outgoing Edges

Vít Jelínek, Eva Jelinkova, Jan Kratochvil and Bernard Lidicky
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters

David Eppstein and Michael Goodrich
Succinct Greedy Graph Drawing in the Hyperbolic Plane

David Eppstein
Isometric Diamond Subgraphs

Sjoerd van Hagen and Marc van Kreveld
Placing text boxes on graphs: a fast approximation algorithm for maximizing overlap of a square and a simple polygon

Christian Bachmaier, Franz Josef Brandenburg, Wolfgang Brunner and Gergö Lovász
Cyclic Leveling of Directed Graphs

Giuseppe Di Battista, Fabrizio Frati and Maurizio Patrignani
Non-Convex Representations of Graphs

Josef Cibulka, Jan Kyncl, Viola Meszaros, Rudolf Stolar and Pavel Valtr
Hamiltonian Alternating Paths on Bicolored Double-chains

Tim Dwyer, Kim Marriott and Michael Wybrow
Dunnart: A Constraint-based Network Diagram Authoring Tool

Tim Dwyer, Kim Marriott and Michael Wybrow
Topology Preserving Constrained Graph Layout

Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong and Hiroshi Nagamochi
Removing Node Overlaps Using Multi-sphere Scheme

Barbara Pampel and Ulrik Brandes
On the Hardness of Orthogonal-Order Preserving Graph Drawing

Sergio Cabello and Bojan Mohar
Crossing and weighted crossing number of near-planar graphs

Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo Silveira and Alexander Wolff
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability

Aimal Rextin and Patrick Healy
A Fully Dynamic Algorithm to Test The Upward Planarity of Single Source Embedded Digraphs

Michael Kaufmann, Marc van Kreveld and Bettina Speckmann
Subdivision Drawings of Hypergraphs

Ulrik Brandes and Christian Pich
An Experimental Study on Distance-based Graph Drawing

Christian Bachmaier, Franz Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder and Thomas Unfried
Tree Drawings on the Hexagonal Grid

Vladimir Korzhik and Bojan Mohar
Minimal obstructions for 1-immersions and hardness of 1-planarity testing

Md. Abul Hassan Samee, Jawaherul Alam, Muhammad Abdullah Adnan and Md. Saidur Rahman
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three

Martin Mader and Seok-Hee Hong
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints

Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein and Petra Mutzel
Computing Maximum C-Planar Subgraphs

Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista and Maurizio Patrignani
Topological Morphing of Planar Graphs

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta and Pietro Palladino
Visual Analysis of One-To-Many Matched Graphs

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer and Stephen Wismath
Constrained Point-Set Embeddability of Planar Graphs

Francesco Giordano, Giuseppe Liotta and Sue Whitesides
Embeddability Problems for Upward Planar Digraphs

Patrizio Angelini, Fabrizio Frati and Luca Grilli
An Algorithm to Construct Greedy Drawings of Triangulations