Abstract is missing.
- Stick Graphs with Length ConstraintsSteven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff 0001, Alexander Zaft, Johannes Zink. 3-17 [doi]
- Representing Graphs and Hypergraphs by Touching Polygons in 3DWilliam S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff 0001. 18-32 [doi]
- Optimal Morphs of Planar Orthogonal Drawings IIArthur van Goethem, Bettina Speckmann, Kevin Verbeek. 33-45 [doi]
- Computing Stable Demers CartogramsSoeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg. 46-60 [doi]
- Bundled Crossings RevisitedSteven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-Won Park, Alexander Ravsky, Alexander Wolff 0001. 63-77 [doi]
- Crossing Numbers of Beyond-Planar GraphsMarkus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr. 78-86 [doi]
- On the 2-Colored Crossing NumberOswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, Francisco Zaragoza. 87-100 [doi]
- Minimal Representations of Order Types by Geometric GraphsOswin Aichholzer, Martin Balko, Michael Hoffmann 0001, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl. 101-113 [doi]
- Balanced Schnyder Woods for Planar Triangulations: An Experimental Study with Applications to Graph Drawing and Graph SeparatorsLuca Castelli Aleardi. 114-121 [doi]
- A Quality Metric for Visualization of Clusters in GraphsAmyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim. 125-138 [doi]
- Multi-level Graph Drawing Using Infomap ClusteringSeok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi. 139-146 [doi]
- On Strict (Outer-)Confluent GraphsHenry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg. 147-161 [doi]
- On the Edge-Length Ratio of Planar GraphsManuel Borrazzo, Fabrizio Frati. 165-178 [doi]
- Node Overlap Removal Algorithms: A Comparative StudyFati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry. 179-192 [doi]
- Graphs with Large Total Angular ResolutionOswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber. 193-199 [doi]
- Computing Height-Optimal Tangles FasterOksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff 0001, Johannes Zink. 203-215 [doi]
- On Arrangements of Orthogonal CirclesSteven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff 0001. 216-229 [doi]
- Extending Simple DrawingsAlan Arroyo, Martin Derka, Irene Parada. 230-243 [doi]
- Coloring Hasse Diagrams and Disjointness Graphs of CurvesJános Pach, István Tomon. 244-250 [doi]
- Efficient Generation of Different Topological Representations of Graphs Beyond-PlanarityPatrizio Angelini, Michael A. Bekos, Michael Kaufmann 0001, Thomas Schneck. 253-267 [doi]
- The QuaSEFE ProblemPatrizio Angelini, Henry Förster, Michael Hoffmann 0001, Michael Kaufmann 0001, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani. 268-275 [doi]
- ChordLink: A New Hybrid Visualization ModelLorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini. 276-290 [doi]
- Stress-Plus-X (SPX) Graph LayoutSabin Devkota, Abu Reyan Ahmed, Felice De Luca, Katherine E. Isaacs, Stephen G. Kobourov. 291-304 [doi]
- Exact Crossing Number Parameterized by Vertex CoverPetr Hlinený, Abhisekh Sankaran. 307-319 [doi]
- Maximizing Ink in Partial Edge Drawings of k-plane GraphsMatthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg. 323-336 [doi]
- Graph Drawing with Morphing Partial EdgesKazuo Misue, Katsuya Akasaka. 337-349 [doi]
- A Note on Universal Point Sets for Planar GraphsManfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner. 350-362 [doi]
- Parameterized Algorithms for Book Embedding ProblemsSujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg. 365-378 [doi]
- Sketched Representations and Orthogonal Planarity of Bounded Treewidth GraphsEmilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. 379-392 [doi]
- 4-Connected Triangulations on Few LinesStefan Felsner. 395-408 [doi]
- Line and Plane Cover Numbers RevisitedTherese C. Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff 0001. 409-415 [doi]
- Drawing Planar Graphs with Few Segments on a Polynomial GridPhilipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis. 416-429 [doi]
- Variants of the Segment Number of a GraphYoshio Okamoto, Alexander Ravsky, Alexander Wolff 0001. 430-443 [doi]
- Local and Union Page NumbersLaura Merker, Torsten Ueckerdt. 447-459 [doi]
- Mixed Linear Layouts: Complexity, Heuristics, and ExperimentsPhilipp de Col, Fabian Klute, Martin Nöllenburg. 460-467 [doi]
- Homotopy Height, Grid-Major Height and Graph-Drawing HeightTherese C. Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders. 468-481 [doi]
- On the Edge-Vertex Ratio of Maximal ThracklesOswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber. 482-495 [doi]
- Symmetry Detection and Classification in Drawings of GraphsFelice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov. 499-513 [doi]
- An SPQR-Tree-Like Embedding Representation for Upward PlanarityGuido Brückner, Markus Himmel, Ignaz Rutter. 517-531 [doi]
- A Natural Quadratic Approach to the Generalized Graph Layering ProblemSven Mallach. 532-544 [doi]
- Graph Stories in Small AreaManuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani. 545-558 [doi]
- Level-Planar Drawings with Few SlopesGuido Brückner, Nadine Davina Krisam, Tamara Mchedlidze. 559-572 [doi]
- Graph Drawing Contest ReportPhilipp Kindermann, Tamara Mchedlidze, Ignaz Rutter. 575-583 [doi]