GD 2010: Konstanz, Germany

Papers

• Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth:
  On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. 1-12
  
• Patrizio Angelini, Enrico Colasante, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani:
  Monotone Drawings of Graphs. 13-24
  
• Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis:
  Upward Geometric Graph Embeddings into Point Sets. 25-37
  
• Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth:
  On a Tree and a Path with No Geometric Simultaneous Embedding. 38-49
  
• Daniel Archambault, Helen C. Purchase, Bruno Pinaud:
  Difference Map Readability for Dynamic Graphs. 50-61
  
• Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
  Maximizing the Total Resolution of Graphs. 62-67
  
• Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner:
  Plane Drawings of Queue and Deque Graphs. 68-79
  
• Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel:
  An Experimental Evaluation of Multilevel Layout Methods. 80-91
  
• Thomas Bläsius, Marcus Krug, Ignaz Rutter, Dorothea Wagner:
  Orthogonal Graph Drawing with Flexibility Constraints. 92-104
  
• Wolfgang Brunner, Marco Matzeder:
  Drawing Ordered (k - 1)-Ary Trees on k-Grids. 105-116
  
• Kevin Buchin, Bettina Speckmann, Sander Verdonschot:
  Optimizing Regular Edge Labelings. 117-128
  
• Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler:
  Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. 129-140
  
• Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong:
  Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. 141-152
  
• Giordano Da Lozzo, Giuseppe Di Battista, Francesco Ingrassia:
  Drawing Graphs on a Smartphone. 153-164
  
• Walter Didimo, Giuseppe Liotta, Salvatore Agostino Romeo:
  Topology-Driven Force-Directed Algorithms. 165-176
  
• Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath:
  On Graphs Supported by Line Sets. 177-182
  
• Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
  Drawing Trees with Perfect Angular Resolution and Polynomial Area. 183-194
  
• Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
  Lombardi Drawings of Graphs. 195-207
  
• David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
  Optimal 3D Angular Resolution for Low-Degree Graphs. 208-219
  
• Fabrizio Frati:
  Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs. 220-225
  
• Radoslav Fulek, János Pach:
  A Computational Approach to Conway's Thrackle Conjecture. 226-237
  
• Graeme Gange, Peter J. Stuckey, Kim Marriott:
  Optimal k-Level Planarization and Crossing Minimization. 238-249
  
• Emden R. Gansner, Yifan Hu, Stephen G. Kobourov:
  On Touching Triangle Graphs. 250-261
  
• Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou:
  Triangle Contact Representations and Duality. 262-273
  
• Yifan Hu, Stephen G. Kobourov, Sankar Veeramoni:
  On Maximum Differential Graph Coloring. 274-286
  
• Ross J. Kang, Tobias Müller:
  Dot Product Representations of Planar Graphs. 287-292
  
• Balázs Keszegh, János Pach, Dömötör Pálvölgyi:
  Drawing Planar Graphs of Bounded Degree with Few Slopes. 293-304
  
• Ján Manuch, Murray Patterson, Sheung-Hung Poon, Chris Thachuk:
  Complexity of Finding Non-Planar Rectilinear Drawings of Graphs. 305-316
  
• Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman:
  Point-Set Embeddings of Plane 3-Trees - (Extended Abstract). 317-328
  
• Sergey Pupyrev, Lev Nachmanson, Michael Kaufmann:
  Improving Layered Graph Layouts with Edge Bundling. 329-340
  
• Gianluca Quercini, Massimo Ancona:
  Confluent Drawing Algorithms Using Rectangular Dualization. 341-352
  
• David A. Richter:
  How to Draw a Tait-Colorable Graph. 353-364
  
• Mereke van Garderen, Giuseppe Liotta, Henk Meijer:
  Universal Pointsets for 2-Coloured Trees. 365-370
  
• Marc J. van Kreveld:
  The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs. 371-376
  
• Erik Jan van Leeuwen, Jan van Leeuwen:
  Convex Polygon Intersection Graphs. 377-388
  

Posters

• Jürgen Bregenzer:
  GraphML-Based Exploration and Evaluation of Efficient Parallelization Alternatives for Automation Firmware. 389-390
  
• Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
  Automatic Generation of Route Sketches. 391-392
  
• Markus Geyer, Michael Kaufmann, Robert Krug:
  Visualizing Differences between Two Large Graphs. 393-394
  
• Konstantinos G. Kakoulis, Ioannis G. Tollis:
  Placing Edge Labels by Modifying an Orthogonal Graph Drawing. 395-396
  
• Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang:
  Large Crossing Angles in Circular Layouts. 397-399
  
• Bruno Pinaud, Pascale Kuntz:
  GVSR: An On-Line Guide for Choosing a Graph Visualization Software. 400-401
  
• Georg Sander:
  IBM ILOG Multi-platform Graph Layout Technology. 402-403
  
• Björn Zimmer, Dennie Ackermann, Manfred Schröder, Andreas Kerren, Volker Ahlers:
  Comparative Visualization of User Flows in Voice Portals. 404-405
  

Graph Drawing Contest

• Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
  Graph Drawing Contest Report. 406-411
  

Last update Sat May 25 02:56:02 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page