GD 2008:
Heraklion,
Crete,
Greece
Ioannis G. Tollis, Maurizio Patrignani (Eds.):
Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers.
Lecture Notes in Computer Science 5417 Springer 2009, ISBN 978-3-642-00218-2 BibTeX
Invited Talks
Papers
- David Eppstein, Michael T. Goodrich:
Succinct Greedy Graph Drawing in the Hyperbolic Plane.
14-25
Electronic Edition (link) BibTeX
- Patrizio Angelini, Fabrizio Frati, Luca Grilli:
An Algorithm to Construct Greedy Drawings of Triangulations.
26-37
Electronic Edition (link) BibTeX
- Sergio Cabello, Bojan Mohar:
Crossing and Weighted Crossing Number of Near-Planar Graphs.
38-49
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Jan Stola:
Unimaximal Sequences of Pairs in Rectangle Visibility Drawing.
61-66
Electronic Edition (link) BibTeX
- Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu:
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights.
67-77
Electronic Edition (link) BibTeX
- David Eppstein:
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing.
78-89
Electronic Edition (link) BibTeX
- Apeksha Godiyal, Jared Hoberock, Michael Garland, John C. Hart:
Rapid Multipole Graph Drawing on the GPU.
90-101
Electronic Edition (link) BibTeX
- Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil:
Clustered Planarity: Clusters with Few Outgoing Edges.
102-113
Electronic Edition (link) BibTeX
- Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel:
Computing Maximum C-Planar Subgraphs.
114-120
Electronic Edition (link) BibTeX
- Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický:
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters.
121-132
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino:
Visual Analysis of One-to-Many Matched Graphs.
133-144
Electronic Edition (link) BibTeX
- Patrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani:
Topological Morphing of Planar Graphs.
145-156
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
Graph Simultaneous Embedding Tool, GraphSET.
169-180
Electronic Edition (link) BibTeX
- Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Hamiltonian Alternating Paths on Bicolored Double-Chains.
181-192
Electronic Edition (link) BibTeX
- Yehuda Koren, Ali Civril:
The Binary Stress Model for Graph Drawing.
193-205
Electronic Edition (link) BibTeX
- Emden R. Gansner, Yifan Hu:
Efficient Node Overlap Removal Using a Proximity Stress Model.
206-217
Electronic Edition (link) BibTeX
- Ulrik Brandes, Christian Pich:
An Experimental Study on Distance-Based Graph Drawing.
218-229
Electronic Edition (link) BibTeX
- Tim Dwyer, Kim Marriott, Michael Wybrow:
Topology Preserving Constrained Graph Layout.
230-241
Electronic Edition (link) BibTeX
- Francesco Giordano, Giuseppe Liotta, Sue Whitesides:
Embeddability Problems for Upward Planar Digraphs.
242-253
Electronic Edition (link) BibTeX
- Aimal Rextin, Patrick Healy:
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs.
254-265
Electronic Edition (link) BibTeX
- Ulrik Brandes, Barbara Pampel:
On the Hardness of Orthogonal-Order Preserving Graph Drawing.
266-277
Electronic Edition (link) BibTeX
- Seok-Hee Hong, Martin Mader:
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints.
278-283
Electronic Edition (link) BibTeX
- Sjoerd van Hagen, Marc J. van Kreveld:
Placing Text Boxes on Graphs.
284-295
Electronic Edition (link) BibTeX
- Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi:
Removing Node Overlaps Using Multi-sphere Scheme.
296-301
Electronic Edition (link) BibTeX
- Vladimir P. Korzhik, Bojan Mohar:
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing.
302-312
Electronic Edition (link) BibTeX
- Maarten Löffler, Elena Mumford:
Connected Rectilinear Graphs on Point Sets.
313-318
Electronic Edition (link) BibTeX
- Martin Kochol:
3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces.
319-323
Electronic Edition (link) BibTeX
- Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams.
324-335
Electronic Edition (link) BibTeX
- Evmorfia Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.
336-347
Electronic Edition (link) BibTeX
- Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász:
Cyclic Leveling of Directed Graphs.
348-359
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs.
360-371
Electronic Edition (link) BibTeX
- Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried:
Tree Drawings on the Hexagonal Grid.
372-383
Electronic Edition (link) BibTeX
- David Eppstein:
Isometric Diamond Subgraphs.
384-389
Electronic Edition (link) BibTeX
- Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
Non-convex Representations of Graphs.
390-395
Electronic Edition (link) BibTeX
- Michael Kaufmann, Marc J. van Kreveld, Bettina Speckmann:
Subdivision Drawings of Hypergraphs.
396-407
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Tim Dwyer, Kim Marriott, Michael Wybrow:
Dunnart: A Constraint-Based Network Diagram Authoring Tool.
420-431
Electronic Edition (link) BibTeX
Posters
- Markus Chimani, Petr Hlinený, Petra Mutzel:
Approximating the Crossing Number of Apex Graphs.
432-434
Electronic Edition (link) BibTeX
- Luca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso:
Policy-Aware Visualization of Internet Dynamics.
435-436
Electronic Edition (link) BibTeX
- Philip Effinger, Michael Kaufmann, Martin Siebenhaller:
Enhancing Visualizations of Business Processes.
437-438
Electronic Edition (link) BibTeX
- Cesim Erten, Melih Sözdinler:
A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs.
439-440
Electronic Edition (link) BibTeX
- Allison P. Heath, George N. Bennett, Lydia E. Kavraki:
Visualizing the Results of Metabolic Pathway Queries.
441-442
Electronic Edition (link) BibTeX
- Sonja Maier, Steffen Mazanek, Mark Minas:
Visual Specification of Layout.
443-444
Electronic Edition (link) BibTeX
- Tamara Mchedlidze, Antonios Symvonis:
Spine Crossing Minimization in Upward Topological Book Embeddings.
445-446
Electronic Edition (link) BibTeX
- Georg Sander:
ILOG Elixir.
447-448
Electronic Edition (link) BibTeX
- Vassilis Tsiaras, Ioannis G. Tollis:
DAGmap View.
449-450
Electronic Edition (link) BibTeX
- Vassilis Tsiaras, Ioannis G. Tollis, Vangelis Sakkalis:
Brain Network Analyzer.
451-452
Electronic Edition (link) BibTeX
Graph Drawing Contest
Copyright © Sat May 16 23:13:16 2009
by Michael Ley (ley@uni-trier.de)
