Accepted Papers

Eyal Ackerman, Balázs Keszegh and Mate Vizer. On the size of planarly connected crossing graphs

Malte Skambath and Till Tantau. Offline Drawing of Dynamic Trees: Algorithmics and Document Integration

Therese Biedl and Claire Pennarun. Non-aligned drawings of planar graphs

Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski, Tomasz Krawczyk and Giuseppe Liotta. The Partial Visibility Representation Extension Problem

Jean Cardinal and Stefan Felsner. Topological Drawings of Complete Bipartite Graphs

Emilio Di Giacomo, Giuseppe Liotta and Fabrizio Montecchiani. 1-bend Upward Planar Drawings of SP-digraphs

Seok-Hee Hong and Hiroshi Nagamochi. Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time

Walter Didimo, Giuseppe Liotta, Saeed Mehrabi and Fabrizio Montecchiani. 1-Bend RAC Drawings of 1-Planar Graphs

Martin Gronemann, Michael Jünger, Frauke Liers and Francesco Mambelli. Crossing Minimization in Storyline Visualization

Ulf Rüegg, Thorsten Ehlers, Miro Spönemann and Reinhard von Hanxleden. A Generalization of the Directed Graph Layering Problem

Alessio Arleo, Walter Didimo, Giuseppe Liotta and Fabrizio Montecchiani. A Distributed Multilevel Force-directed Algorithm

Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides and Stephen Wismath. Visibility Representations of Boxes in 2.5 Dimensions

Markus Chimani, Karsten Klein and Tilo Wiedera. A Note on the Practicality of Maximal Planar Subgraph Algorithms

Emilio Di Giacomo, Walter Didimo, William Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani and Stephen Wismath. Ortho-polygon Visibility Representations of Embedded Graphs

Carla Binucci, Markus Chimani, Walter Didimo, Giuseppe Liotta and Fabrizio Montecchiani. Placing Arrows in Directed Graph Drawings

Éric Colin de Verdière, Vojtěch Kaluža, Pavel Paták, Zuzana Patáková and Martin Tancer. A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane

Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Rüegg and Reinhard von Hanxleden. Compact Layered Drawings of General Directed Graphs

Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein and David R. Wood. Track Layout is Hard

René Van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier and Manuel Sorge. Twins in Subdivision Drawings of Hypergraphs

Md. Jawaherul Alam, Martin Fink and Sergey Pupyrev. The Bundled Crossing Number

Paolo Federico and Silvia Miksch. Evaluation of two interaction techniques for dynamic graph visualization

Radoslav Fulek. C-planarity of Embedded Cyclic c-Graphs

Radoslav Fulek, Michael Pelsmajer and Marcus Schaefer. Hanani-Tutte for Radial Planarity II

Mark Ortmann, Mirza Klimenta and Ulrik Brandes. A Sparse Stress Model

Andre Löffler, Thomas C. Van Dijk and Alexander Wolff. Snapping Graph Drawings to the Grid Optimally

Thomas C. Van Dijk, Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alex Ravsky, Subhash Suri and Alexander Wolff. Block Crossings in Storyline Visualizations

Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw and Sander Verdonschot. Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition

Hugo Akitaya, Maarten Löffler and Csaba Toth. Multi-Colored Spanning Graphs

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Ignaz Rutter and Maurizio Patrignani. Beyond Level Planarity

Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze and Vincenzo Roselli. Drawing Planar Graphs with Many Collinear Vertices

Martin Gronemann. Bitonic st-orderings for Upward Planar Graphs

Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky and Alexander Wolff. Drawing Graphs on Few Lines and Few Planes

Lev Nachmanson, Alexander Holroyd, Arlind Nocaj, Sergey Bereg and Leishi Zhang. Node Overlap Removal by Growing a Tree

Jacob Fox, Janos Pach and Andrew Suk. Approximating the rectilinear crossing number

Jaakko Peltonen and Ziyuan Lin. Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-off

Carlos A. Alfaro, Alan Arroyo, Marek Derňár and Bojan Mohar. The crossing number of the cone of a graph

Ioannis Tollis and Konstantinos Kakoulis. Algorithms for Visualizing Phylogenetic Networks

Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp and Ignaz Rutter. Simultaneous Orthogonal Planarity

Vida Dujmovic and Fabrizio Frati. Stack and Queue Layouts via Layered Separators

David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides and Steve Wismath. Monotone Simultaneous Embeddings of Paths in d-dimensional Space

Patrizio Angelini, Michael Bekos, Till Bruckdorfer, Jaroslav Hančl, Michael Kaufmann, Stephen Kobourov, Jan Kratochvíl, Antonios Symvonis and Pavel Valtr. Low Ply Drawings of Trees

Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati and Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs

Michael Bekos, Michael Kaufmann and Chrysanthi Raftopoulou. On the Density of non-Simple 3-Planar Graphs

Steven Chaplick, Fabian Lipp, Ji-Won Park and Alexander Wolff. Obstructing Visibilities with One Obstacle