Table of Contents

• A Distributed Multilevel Force-Directed AlgorithmAlessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani. 3-17 [doi]
• A Sparse Stress ModelMark Ortmann, Mirza Klimenta, Ulrik Brandes. 18-32 [doi]
• Node Overlap Removal by Growing a TreeLev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd. 33-43 [doi]
• Placing Arrows in Directed Graph DrawingsCarla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani. 44-51 [doi]
• Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-OffJaakko Peltonen, Ziyuan Lin. 52-64 [doi]
• Twins in Subdivision Drawings of HypergraphsRené van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge. 67-80 [doi]
• Multi-colored Spanning GraphsHugo Alves Akitaya, Maarten Löffler, Csaba D. Tóth. 81-93 [doi]
• C-Planarity of Embedded Cyclic c-GraphsRadoslav Fulek. 94-106 [doi]
• Computing NodeTrix Representations of Clustered GraphsGiordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. 107-120 [doi]
• 1-Bend Upward Planar Drawings of SP-DigraphsEmilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. 123-130 [doi]
• Non-aligned Drawings of Planar GraphsTherese C. Biedl, Claire Pennarun. 131-143 [doi]
• Snapping Graph Drawings to the Grid OptimallyAndre Löffler, Thomas C. van Dijk, Alexander Wolff. 144-151 [doi]
• Drawing Planar Graphs with Many Collinear VerticesGiordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli. 152-165 [doi]
• Drawing Graphs on Few Lines and Few PlanesSteven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff. 166-180 [doi]
• Algorithms for Visualizing Phylogenetic NetworksIoannis G. Tollis, Konstantinos G. Kakoulis. 183-195 [doi]
• A Generalization of the Directed Graph Layering ProblemUlf Rüegg, Thorsten Ehlers, Miro Spönemann, Reinhard von Hanxleden. 196-208 [doi]
• Compact Layered Drawings of General Directed GraphsAdalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg, Reinhard von Hanxleden. 209-221 [doi]
• Bitonic st-orderings for Upward Planar GraphsMartin Gronemann. 222-235 [doi]
• Low Ply Drawings of TreesPatrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann 0001, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr. 236-248 [doi]
• Visibility Representations of Boxes in 2.5 DimensionsAlessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath. 251-265 [doi]
• The Partial Visibility Representation Extension ProblemSteven Chaplick, Grzegorz Guspiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta. 266-279 [doi]
• Ortho-Polygon Visibility Representations of Embedded GraphsEmilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath. 280-294 [doi]
• Obstructing Visibilities with One ObstacleSteven Chaplick, Fabian Lipp, Ji-Won Park, Alexander Wolff. 295-308 [doi]
• On the Size of Planarly Connected Crossing GraphsEyal Ackerman, Balázs Keszegh, Máté Vizer. 311-320 [doi]
• Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear TimeSeok-Hee Hong, Hiroshi Nagamochi. 321-334 [doi]
• 1-Bend RAC Drawings of 1-Planar GraphsWalter Didimo, Giuseppe Liotta, Saeed Mehrabi 0001, Fabrizio Montecchiani. 335-343 [doi]
• On the Density of Non-simple 3-Planar GraphsMichael A. Bekos, Michael Kaufmann 0001, Chrysanthi N. Raftopoulou. 344-356 [doi]
• A Note on the Practicality of Maximal Planar Subgraph AlgorithmsMarkus Chimani, Karsten Klein, Tilo Wiedera. 357-364 [doi]
• Crossing Minimization in Storyline VisualizationMartin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli. 367-381 [doi]
• Block Crossings in Storyline VisualizationsThomas C. van Dijk, Martin Fink 0001, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alexander Ravsky, Subhash Suri, Alexander Wolff. 382-398 [doi]
• The Bundled Crossing NumberMd. Jawaherul Alam, Martin Fink 0001, Sergey Pupyrev. 399-412 [doi]
• Approximating the Rectilinear Crossing NumberJacob Fox, János Pach, Andrew Suk. 413-426 [doi]
• The Crossing Number of the Cone of a GraphCarlos A. Alfaro, Alan Arroyo, Marek Dernár, Bojan Mohar. 427-438 [doi]
• Topological Drawings of Complete Bipartite GraphsJean Cardinal, Stefan Felsner. 441-453 [doi]
• A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective PlaneÉric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer. 454-467 [doi]
• Hanani-Tutte for Radial Planarity IIRadoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer. 468-481 [doi]
• Beyond Level PlanarityPatrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter. 482-495 [doi]
• Track Layout Is HardMichael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood. 499-510 [doi]
• Stack and Queue Layouts via Layered SeparatorsVida Dujmovic, Fabrizio Frati. 511-518 [doi]
• Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and RecognitionNicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot. 519-531 [doi]
• Simultaneous Orthogonal PlanarityPatrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter. 532-545 [doi]
• Monotone Simultaneous Embeddings of Paths in d DimensionsDavid Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath. 546-553 [doi]
• Evaluation of Two Interaction Techniques for Visualization of Dynamic GraphsPaolo Federico 0001, Silvia Miksch. 557-571 [doi]
• Offline Drawing of Dynamic Trees: Algorithmics and Document IntegrationMalte Skambath, Till Tantau. 572-586 [doi]
• Graph Drawing Contest ReportPhilipp Kindermann, Maarten Löffler, Lev Nachmanson, Ignaz Rutter. 589-595 [doi]