21st International Symposium on
Graph Drawing
23-25 September 2013, Bordeaux (Talence), France

GD 2013 Accepted Papers

Martin Fink and Sergey Pupyrev. Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
Andrew Suk and Dhruv Mubayi. A Ramsey-type result for geometric $\ell$-hypergraphs
Stefan Felsner. Exploiting Air-Pressure to Map Floorplans on Point Sets
Joseph A. Simons, Michael J. Bannister and David Eppstein. Fixed parameter tractability of crossing minimization of almost-trees
Michael J. Bannister, Zhanpeng Cheng, William E. Devanny and David Eppstein. Superpatterns and Universal Point Sets
Helen Purchase. Sketched graph drawing: a lesson in empirical studies.
Michael Goodrich and Paweł Pszona. Streamed Graph Drawing and the File Maintenance Problem
Michael Goodrich and Paweł Pszona. Achieving Good Angular Resolution in 3D Arc Diagrams
Jiří Matoušek, Eric Sedgwick, Martin Tancer and Uli Wagner. Untangling two systems of noncrossing curves
David Eppstein. Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity
Sergey Bereg, Alexander Holroyd, Lev Nachmanson and Sergey Pupyrev. Drawing Permutations with Few Corners
Ferran Hurtado, Matias Korman, Marc Van Kreveld, Maarten Löffler, Vera Sacristan, Rodrigo Silveira and Bettina Speckmann. Colored Spanning Graphs for Set Visualization
Anna Lubiw, Timothy M. Chan, Hella-Franziska Hoffmann and Stephen Kiazyk. Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
Yi-Jun Chang and Hsu-Chun Yen. On Orthogonally Convex Drawings of Plane Graphs
J. Joseph Fowler. Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
Fabrizio Frati, Michael Kaufmann, Janos Pach, Csaba Toth and David Wood. On the Upward Planarity of Mixed Plane Graphs
Marcus Schaefer and Daniel Stefankovic. Block Additivity of Z2-Embeddings
Nieke Aerts and Stefan Felsner. Straight Line Triangle Representations
Alexander Igamberdiev and André Schulz. A duality transform for constructing small grid embeddings of 3d polytopes
Steven Chaplick, Radoslav Fulek and Pavel Klavík. Extending Partial Representations of Circle Graphs
Steve Kieffer, Tim Dwyer, Kim Marriott and Michael Wybrow. Incremental Grid-like Layout Using Soft and Hard Constraints
Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer and Yusuke Suzuki. A Linear-Time Algorithm for Testing Outer-1-Planarity
Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista and Claudio Squarcella. Dynamic Traceroute Visualization at Multiple Abstraction Levels
Christopher Auer, Franz Josef Brandenburg, Andreas Gleißner and Kathrin Hanauer. Characterizing Planarity by the Splittable Deque
Markus Chimani and Robert Zeranski. Upward Planarity Testing: A Computational Study
Md. Jawaherul Alam, Franz Brandenburg and Stephen G. Kobourov. Straight-line Grid Drawings of 3-Connected 1-Planar Graphs
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista and Fabrizio Frati. Strip Planarity Testing
William Lenhart, Giuseppe Liotta, Debajyoti Mondal and Rahnuma Islam Nishat. Planar and Plane Slope Number of Partial 2-Trees
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani and Ioannis Tollis. Drawing Non-planar Graphs with Crossing-free Subgraphs
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani and Ioannis Tollis. Exploring Complex Drawings via Edge Stratification
David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann and Kevin Verbeek. Strict Confluent Drawing
Stephane Durocher and Debajyoti Mondal. On Balanced +-Contact Representations
Tamara Mchedlidze, Martin Nöllenburg and Ignaz Rutter. Drawing Planar Graphs with a Prescribed Cycle
Andrew Suk and Bartosz Walczak. New bounds on the maximum number of edges in k-quasi-planar graphs
Arlind Nocaj and Ulrik Brandes. Stub Bundling and Confluent Spirals for Geographic Networks
Thomas Bläsius, Annette Karrer and Ignaz Rutter. Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seokhee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter and Antonios Symvonis. Many-to-One Boundary Labeling with Backbones
Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin and Ignaz Rutter. Using ILP/SAT to determine pathwidth, visbility representations, and other grid-based graph drawings
Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth and Josef Reislhuber. Recognizing Outer 1-Planar Graphs in Linear Time
Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani and Vincenzo Roselli. Morphing Planar Graph Drawings Efficiently
Emden Gansner, Yifan Hu and Shankar Krishnan. COAST: A Convex Optimization Approach to Stress-Based Embedding

Diamond Sponsor

Gold Sponsor

Silver Sponsor

Bronze Sponsor