GD 2009: Chicago, IL, USA

Invited Talks

• János Pach:
  Why Are String Graphs So Beautiful? 1
  
• Martin Wattenberg:
  The Art of Cheating When Drawing a Graph. 2
  

Papers

• Adrian Dumitrescu, János Pach, Géza Tóth:
  Drawing Hamiltonian Cycles with No Large Angles. 3-14
  
• Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
  Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. 15-20
  
• Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis:
  On the Perspectives Opened by Right Angle Crossing Drawings. 21-32
  
• André Schulz:
  Drawing 3-Polytopes with Good Vertex Resolution. 33-44
  
• Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
  Planar Drawings of Higher-Genus Graphs. 45-56
  
• Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani:
  Splitting Clusters to Get C-Planarity. 57-68
  
• Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
  On the Characterization of Level Planar Trees by Minimal Patterns. 69-80
  
• J. Joseph Fowler:
  Characterization of Unlabeled Radial Level Planar Graphs. 81-93
  
• Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
  Upward Planarization Layout. 94-106
  
• Ulrik Brandes, Christian Pich:
  More Flexible Radial Layout. 107-118
  
• Brynjar Gretarsson, Svetlin Bostandjiev, John O'Donovan, Tobias Höllerer:
  WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations. 119-134
  
• Miro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel:
  Port Constraints in Hierarchical Layout of Data Flow Diagrams. 135-146
  
• Tim Dwyer, Lev Nachmanson:
  Fast Edge-Routing for Large Graphs. 147-158
  
• Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen:
  Leftist Canonical Ordering. 159-170
  
• Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
  Succinct Greedy Drawings Do Not Always Exist. 171-182
  
• Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
  Geometric Simultaneous Embeddings of a Graph and a Matching. 183-194
  
• Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis:
  Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs. 195-200
  
• Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
  Removing Independently Even Crossings. 201-206
  
• Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff:
  Manhattan-Geodesic Embedding of Planar Graphs. 207-218
  
• Michael Wybrow, Kim Marriott, Peter J. Stuckey:
  Orthogonal Connector Routing. 219-231
  
• Peter Eades, Seok-Hee Hong, Sheung-Hung Poon:
  On Rectilinear Drawing of Graphs. 232-243
  
• Kai Xu, Rohan Williams, Seok-Hee Hong, Qing Liu, Ji Zhang:
  Semi-bipartite Graph Visualization for Gene Ontology Networks. 244-255
  
• Mario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber, Michael Wybrow:
  On Open Problems in Biological Network Visualization. 256-267
  
• Markus Rohrschneider, Christian Heine, André Reichenbach, Andreas Kerren, Gerik Scheuermann:
  A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View. 268-279
  
• Therese C. Biedl:
  Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. 280-291
  
• Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
  Drawing Trees in a Streaming Model. 292-303
  
• Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
  The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. 304-315
  
• Therese C. Biedl, Lesvia Elena Ruiz Velázquez:
  Drawing Planar 3-Trees with Given Face-Areas. 316-322
  
• Jan Stola:
  3D Visibility Representations by Regular Polygons. 323-333
  
• Marcus Schaefer:
  Complexity of Some Geometric and Topological Problems. 334-344
  
• Kevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek:
  On Planar Supports for Hypergraphs. 345-356
  
• Vassilis Tsiaras, Ioannis G. Tollis:
  DAGmaps and epsilon-Visibility Representations of DAGs. 357-368
  
• Christian Pich:
  Drawing Directed Graphs Clockwise. 369-380
  
• Martin Nöllenburg:
  An Improved Algorithm for the Metro-line Crossing Minimization Problem. 381-392
  
• Tim Dwyer, George G. Robertson:
  Layout with Circular and Other Non-linear Constraints Using Procrustes Projection. 393-404
  
• Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
  GMap: Drawing Graphs as Maps. 405-407
  
• Stina S. Bridgeman:
  Using High Dimensions to Compare Drawings of Graphs. 408-410
  
• Tamara Mchedlidze, Antonios Symvonis:
  On rho-Constrained Upward Topological Book Embeddings. 411-412
  
• Lali Barrière, Clemens Huemer:
  4-Labelings and Grid Embeddings of Plane Quadrangulations. 413-414
  
• Jerome Joubert, Stephane Lizeray, Romain Raugi, Georg Sander:
  IBM ILOG Graph Layout for Eclipse. 415-416
  
• Philip Effinger, Gero Decker:
  Layout Techniques Coupled with Web2.0-Based Business Process Modeling. 417-418
  
• Michael Kaufmann, Stephan Kottler:
  Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. 419-420
  
• Benjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler:
  Visualization of Complex BPEL Models. 421-423
  
• Vassilis Tsiaras, Ioannis G. Tollis:
  DAGmaps and Dominance Relationships. 424-425
  
• Karsten Klein, Nils Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel:
  Scaffold Hunter - Interactive Exploration of Chemical Space. 426-427
  
• Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
  Graph Drawing Contest Report. 428-433
  

Last update Fri May 25 08:14:37 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page