Abstract is missing.
- Image-Based Graph Visualization: Advances and ChallengesAlexandru Telea. 3-19 [doi]
- Clustered Planarity = Flat Clustered PlanarityPier Francesco Cortese, Maurizio Patrignani. 23-38 [doi]
- Level Planarity: Transitivity vs. Even CrossingsGuido Brückner, Ignaz Rutter, Peter Stumpf. 39-52 [doi]
- Short Plane Supports for Spatial HypergraphsThom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan. 53-66 [doi]
- Turning Cliques into Paths to Achieve PlanarityPatrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein 0001, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini. 67-74 [doi]
- Universal Slope Sets for Upward Planar DrawingsMichael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani. 77-91 [doi]
- Upward Planar MorphsGiordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. 92-105 [doi]
- Visualizing the Template of a Chaotic AttractorMaya Olszewski, Jeff Meder, Emmanuel Kieffer, Raphaël Bleuse, Martin Rosalie, Grégoire Danoy, Pascal Bouvry. 106-119 [doi]
- On RAC Drawings of Graphs with One Bend per EdgePatrizio Angelini, Michael A. Bekos, Henry Förster, Michael Kaufmann 0001. 123-136 [doi]
- Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few BendsSteven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink. 137-151 [doi]
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large AnglesPhilipp Kindermann, Fabrizio Montecchiani, Lena Schlipf, André Schulz 0001. 152-166 [doi]
- Aesthetic Discrimination of Graph LayoutsMoritz Klammler, Tamara Mchedlidze, Alexey Pak. 169-184 [doi]
- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed WidthMichael Jünger, Petra Mutzel, Christiane Spisla. 187-199 [doi]
- The Queue-Number of Posets of Bounded Width or HeightKolja Knauer, Piotr Micek, Torsten Ueckerdt. 200-212 [doi]
- Queue Layouts of Planar 3-TreesJawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev. 213-226 [doi]
- Crossing Minimization in Perturbed DrawingsRadoslav Fulek, Csaba D. Tóth. 229-241 [doi]
- The Number of Crossings in Multigraphs with No Empty LensMichael Kaufmann 0001, János Pach, Géza Tóth, Torsten Ueckerdt. 242-254 [doi]
- Crossing Numbers and Stress of Random GraphsMarkus Chimani, Hanna Döring, Matthias Reitzner. 255-268 [doi]
- A Heuristic Approach Towards Drawings of Graphs with High Crossing ResolutionMichael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann 0001, Amadäus M. Spallek, Jan Splett. 271-285 [doi]
- A Greedy Heuristic for Crossing-Angle MaximizationAlmut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf. 286-299 [doi]
- Recognition and Drawing of Stick GraphsFelice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal. 303-316 [doi]
- On Contact Graphs of Paths on a GridZakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries. 317-330 [doi]
- On the Area-Universality of TriangulationsLinda Kleist. 333-346 [doi]
- Monotone Drawings of k-Inner Planar GraphsAnargyros Oikonomou, Antonios Symvonis. 347-353 [doi]
- On L-Shaped Point Set Embeddings of Trees: First Non-embeddable ExamplesTorsten Mütze, Manfred Scheucher. 354-360 [doi]
- How to Fit a Tree in a BoxHugo A. Akitaya, Maarten Löffler, Irene Parada. 361-367 [doi]
- Pole Dancing: 3D Morphs for Tree DrawingsElena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini. 371-384 [doi]
- The Complexity of Drawing a Graph in a Polygonal RegionAnna Lubiw, Tillmann Miltzow, Debajyoti Mondal. 387-401 [doi]
- Inserting an Edge into a Geometric EmbeddingMarcel Radermacher, Ignaz Rutter. 402-415 [doi]
- \beta -Stars or On Extending a Drawing of a Connected SubgraphTamara Mchedlidze, Jérôme Urhausen. 416-429 [doi]
- Perception of Symmetries in Drawings of GraphsFelice De Luca, Stephen G. Kobourov, Helen C. Purchase. 433-446 [doi]
- Network Alignment by Discrete Ollivier-Ricci FlowChien-Chun Ni, Yu-Yao Lin, Jie Gao, Xianfeng Gu. 447-462 [doi]
- Same Stats, Different Graphs - (Graph Statistics and Why We Need Graph Drawings)Hang Chen, Utkarsh Soni, Yafeng Lu, Ross Maciejewski, Stephen G. Kobourov. 463-477 [doi]
- Bend-Minimum Orthogonal Drawings in Quadratic TimeWalter Didimo, Giuseppe Liotta, Maurizio Patrignani. 481-494 [doi]
- Greedy Rectilinear DrawingsPatrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli 0001, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini. 495-508 [doi]
- Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge ComplexityEvmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann 0001, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff. 509-523 [doi]
- Ortho-Polygon Visibility Representations of 3-Connected 1-Plane GraphsGiuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini. 524-537 [doi]
- Realization and Connectivity of the Graphs of Origami Flat FoldingsDavid Eppstein. 541-554 [doi]
- Arrangements of Pseudocircles: On CircularizabilityStefan Felsner, Manfred Scheucher. 555-568 [doi]
- The Weighted Barycenter Drawing Recognition ProblemPeter Eades, Patrick Healy, Nikola S. Nikolov. 569-575 [doi]
- Algorithms and Bounds for Drawing Directed GraphsGiacomo Ortali, Ioannis G. Tollis. 579-592 [doi]
- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic ConnectivityRuy Fabila Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, Dieter Mitsche. 593-605 [doi]
- Graph Drawing Contest ReportWilliam E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter. 609-617 [doi]