Abstract is missing.
- 2Abu Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen G. Kobourov, Mingwei Li. 3-17 [doi]
- Stochastic Gradient Descent Works Really Well for Stress MinimizationKatharina Börsig, Ulrik Brandes, Barna Pásztor. 18-25 [doi]
- The Local Queue Number of Graphs with Bounded TreewidthLaura Merker, Torsten Ueckerdt. 26-39 [doi]
- Parameterized Algorithms for Queue LayoutsSujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg. 40-54 [doi]
- Lazy Queue Layouts of PosetsJawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann 0001, Sergey Pupyrev. 55-68 [doi]
- Improved Upper and Lower Bounds for LR Drawings of Binary TreesTimothy M. Chan, Zhengcheng Huang. 71-84 [doi]
- On the Edge-Length Ratio of 2-TreesVáclav Blazej, Jirí Fiala 0001, Giuseppe Liotta. 85-98 [doi]
- HOTVis: Higher-Order Time-Aware Visualisation of Dynamic GraphsVincenzo Perri, Ingo Scholtes. 99-114 [doi]
- VAIM: Visual Analytics for Influence MaximizationAlessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani. 115-123 [doi]
- Odd Wheels Are Not Odd-distance GraphsGábor Damásdi. 124-134 [doi]
- Polygons with Prescribed Angles in 2D and 3DAlon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth. 135-147 [doi]
- On Mixed Linear Layouts of Series-Parallel GraphsPatrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze. 151-159 [doi]
- Schematic Representation of Biconnected GraphsGiuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais. 160-172 [doi]
- Drawing Tree-Based Phylogenetic Networks with Minimum Number of CrossingsJonathan Klawitter, Peter Stumpf. 173-180 [doi]
- A Tipping Point for the Planarity of Small and Medium Sized GraphsEmanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani. 181-188 [doi]
- 0-VPG Cocomparability GraphsSreejith K. Pallathumadam, Deepak Rajendraprasad. 191-204 [doi]
- Planar L-Drawings of Bimodal GraphsPatrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo. 205-219 [doi]
- Layered Drawing of Undirected Graphs with Generalized Port ConstraintsJulian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff 0001. 220-234 [doi]
- An Integer-Linear Program for Bend-Minimization in Ortho-Radial DrawingsBenjamin Niedermann, Ignaz Rutter. 235-249 [doi]
- On Turn-Regular Orthogonal RepresentationsMichael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein 0001, Maurizio Patrignani, Ignaz Rutter. 250-264 [doi]
- Extending Partial Orthogonal DrawingsPatrizio Angelini, Ignaz Rutter, Sandhya T. P. 265-278 [doi]
- Topological Drawings Meet Classical Theorems from Convex GeometryHelena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner. 281-294 [doi]
- Towards a Characterization of Stretchable Aligned GraphsMarcel Radermacher, Ignaz Rutter, Peter Stumpf. 295-307 [doi]
- Exploring the Design Space of Aesthetics with the Repertory Grid TechniqueDavid Baum. 308-323 [doi]
- Storyline Visualizations with Ubiquitous ActorsEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini. 324-332 [doi]
- Drawing Shortest Paths in Geodetic GraphsSabine Cornelsen, Maximilian Pfister 0002, Henry Förster, Martin Gronemann, Michael Hoffmann 0001, Stephen G. Kobourov, Thomas Schneck. 333-340 [doi]
- Limiting Crossing Numbers for Geodesic Drawings on the SphereMarthe Bonamy, Bojan Mohar, Alexandra Wesolek. 341-355 [doi]
- Crossings Between Non-homotopic EdgesJános Pach, Gábor Tardos, Géza Tóth 0001. 359-371 [doi]
- Improvement on the Crossing Number of Crossing-Critical GraphsJános Barát, Géza Tóth 0001. 372-381 [doi]
- n with No Empty LensStefan Felsner, Michael Hoffmann 0001, Kristin Knorr, Irene Parada. 382-389 [doi]
- Simple Topological Drawings of k-Planar GraphsMichael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth. 390-402 [doi]
- 2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and PathwidthPatrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck. 403-419 [doi]
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear TimeFabrizio Frati. 423-435 [doi]
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear TimeWalter Didimo, Michael Kaufmann 0001, Giuseppe Liotta, Giacomo Ortali. 436-449 [doi]
- New Quality Metrics for Dynamic Graph DrawingAmyra Meidiana, Seok-Hee Hong, Peter Eades. 450-465 [doi]
- The Turing Test for Graph Drawing AlgorithmsHelen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu. 466-481 [doi]
- nOswin Aichholzer, Michael Hoffmann 0001, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger. 482-489 [doi]
- Augmenting Geometric Graphs with MatchingsAlexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz 0001. 490-504 [doi]
- Graph Drawing Contest ReportPhilipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter. 507-519 [doi]