Abstract is missing.
- On the Upward Planarity of Mixed Plane GraphsFabrizio Frati, Michael Kaufmann, János Pach, Csaba D. Tóth, David R. Wood. 1-12 [doi]
- Upward Planarity Testing: A Computational StudyMarkus Chimani, Robert Zeranski. 13-24 [doi]
- Characterizing Planarity by the Splittable DequeChristopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer. 25-36 [doi]
- Strip Planarity TestingPatrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. 37-48 [doi]
- Morphing Planar Graph Drawings EfficientlyPatrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. 49-60 [doi]
- Graph Drawing through the Lens of a Framework for Analyzing Visualization Methods - (Invited Talk, Extended Abstract)Tamara Munzner. 61-70 [doi]
- A Linear-Time Algorithm for Testing Outer-1-PlanaritySeok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki. 71-82 [doi]
- Straight-Line Grid Drawings of 3-Connected 1-Planar GraphsMd. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov. 83-94 [doi]
- New Bounds on the Maximum Number of Edges in k-Quasi-Planar GraphsAndrew Suk, Bartosz Walczak. 95-106 [doi]
- Recognizing Outer 1-Planar Graphs in Linear TimeChristopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber. 107-118 [doi]
- Straight Line Triangle RepresentationsNieke Aerts, Stefan Felsner. 119-130 [doi]
- Extending Partial Representations of Circle GraphsSteven Chaplick, Radoslav Fulek, Pavel Klavík. 131-142 [doi]
- On Balanced +-Contact RepresentationsStephane Durocher, Debajyoti Mondal. 143-154 [doi]
- Strongly-Connected Outerplanar Graphs with Proper Touching Triangle RepresentationsJ. Joseph Fowler. 155-160 [doi]
- Achieving Good Angular Resolution in 3D Arc DiagramsMichael T. Goodrich, Pawel Pszona. 161-172 [doi]
- A Duality Transform for Constructing Small Grid Embeddings of 3D PolytopesAlexander Igamberdiev, André Schulz. 173-184 [doi]
- Block Additivity of ℤ2-EmbeddingsMarcus Schaefer, Daniel Stefankovic. 185-195 [doi]
- Exploiting Air-Pressure to Map Floorplans on Point SetsStefan Felsner. 196-207 [doi]
- Superpatterns and Universal Point SetsMichael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein. 208-219 [doi]
- Simultaneous Embedding: Edge Orderings, Relative Positions, CutverticesThomas Bläsius, Annette Karrer, Ignaz Rutter. 220-231 [doi]
- Sketched Graph Drawing: A Lesson in Empirical StudiesHelen C. Purchase. 232-243 [doi]
- Many-to-One Boundary Labeling with BackbonesMichael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis. 244-255 [doi]
- Streamed Graph Drawing and the File Maintenance ProblemMichael T. Goodrich, Pawel Pszona. 256-267 [doi]
- COAST: A Convex Optimization Approach to Stress-Based EmbeddingEmden R. Gansner, Yifan Hu, Shankar Krishnan. 268-279 [doi]
- Colored Spanning Graphs for Set VisualizationFerran Hurtado, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Vera Sacristán Adinolfi, Rodrigo I. Silveira, Bettina Speckmann. 280-291 [doi]
- Drawing Non-Planar Graphs with Crossing-Free SubgraphsPatrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis. 292-303 [doi]
- Exploring Complex Drawings via Edge StratificationEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ioannis G. Tollis. 304-315 [doi]
- Drawing Planar Graphs with a Prescribed Inner FaceTamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter. 316-327 [doi]
- Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable CasesMartin Fink, Sergey Pupyrev. 328-339 [doi]
- Fixed Parameter Tractability of Crossing Minimization of Almost-TreesMichael J. Bannister, David Eppstein, Joseph A. Simons. 340-351 [doi]
- Strict Confluent DrawingDavid Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek. 352-363 [doi]
- A Ramsey-Type Result for Geometric ℓ-HypergraphsDhruv Mubayi, Andrew Suk. 364-375 [doi]
- Minimum Length Embedding of Planar Graphs at Fixed Vertex LocationsTimothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw. 376-387 [doi]
- Stub Bundling and Confluent Spirals for Geographic NetworksArlind Nocaj, Ulrik Brandes. 388-399 [doi]
- On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract)Yi-Jun Chang, Hsu-Chun Yen. 400-411 [doi]
- Planar and Plane Slope Number of Partial 2-TreesWilliam Lenhart, Giuseppe Liotta, Debajyoti Mondal, Rahnuma Islam Nishat. 412-423 [doi]
- Slanted Orthogonal DrawingsMichael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Näher, Vincenzo Roselli. 424-435 [doi]
- Drawing Arrangement Graphs in Small Grids, or How to Play PlanarityDavid Eppstein. 436-447 [doi]
- Incremental Grid-Like Layout Using Soft and Hard ConstraintsSteve Kieffer, Tim Dwyer, Kim Marriott, Michael Wybrow. 448-459 [doi]
- Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph DrawingsTherese C. Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter. 460-471 [doi]
- Untangling Two Systems of Noncrossing CurvesJirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner. 472-483 [doi]
- Drawing Permutations with Few CornersSergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev. 484-495 [doi]
- Dynamic Traceroute Visualization at Multiple Abstraction LevelsMassimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella. 496-507 [doi]
- Graph Drawing Contest ReportChristian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander. 508-513 [doi]