Abstract is missing.
- Aligned Drawings of Planar GraphsTamara Mchedlidze, Marcel Radermacher, Ignaz Rutter. 3-16 [doi]
- On the Edge-Length Ratio of Outerplanar GraphsSylvain Lazard, William Lenhart, Giuseppe Liotta. 17-23 [doi]
- On Vertex- and Empty-Ply Proximity DrawingsPatrizio Angelini, Steven Chaplick, Felice De Luca, Jirí Fiala 0001, Jaroslav Hancl Jr., Niklas Heinsohn, Michael Kaufmann 0001, Stephen G. Kobourov, Jan Kratochvíl, Pavel Valtr. 24-37 [doi]
- An Interactive Tool to Explore and Improve the Ply Number of DrawingsNiklas Heinsohn, Michael Kaufmann 0001. 38-51 [doi]
- Experimental Analysis of the Accessibility of Drawings with Few SegmentsPhilipp Kindermann, Wouter Meulemans, André Schulz 0001. 52-64 [doi]
- Obstacle Numbers of Planar GraphsJohn Gimbel, Patrice Ossona de Mendez, Pavel Valtr. 67-80 [doi]
- Grid-Obstacle Representations with Connections to Staircase GuardingTherese C. Biedl, Saeed Mehrabi 0001. 81-87 [doi]
- Reconstructing Generalized Staircase Polygons with Uniform Step LengthNodari Sitchinava, Darren Strash. 88-101 [doi]
- 3D Visibility Representations of 1-planar GraphsPatrizio Angelini, Michael A. Bekos, Michael Kaufmann 0001, Fabrizio Montecchiani. 102-109 [doi]
- Lombardi Drawings of Knots and LinksPhilipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz 0001, Birgit Vogtenhuber. 113-126 [doi]
- Arrangements of Pseudocircles: Triangles and DrawingsStefan Felsner, Manfred Scheucher. 127-139 [doi]
- Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic GraphsTherese C. Biedl, Veronika Irvine. 140-152 [doi]
- Many Touchings Force Many CrossingsJános Pach, Géza Tóth. 153-159 [doi]
- Thrackles: An Improved Upper BoundRadoslav Fulek, János Pach. 160-166 [doi]
- On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky DrawingsMichael A. Bekos, Henry Förster, Michael Kaufmann 0001. 169-183 [doi]
- EPG-representations with Small Grid-SizeTherese C. Biedl, Martin Derka, Vida Dujmovic, Pat Morin. 184-196 [doi]
- Mixed Linear Layouts of Planar GraphsSergey Pupyrev. 197-209 [doi]
- Upward Partitioned Book EmbeddingsHugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu. 210-223 [doi]
- Experimental Evaluation of Book Drawing AlgorithmsJonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg. 224-238 [doi]
- Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing FactorsKathrin Ballweg, Margit Pohl, Günter Wallner, Tatiana Von Landesberger. 241-255 [doi]
- GiViP: A Visual Profiler for Distributed Graph Processing SystemsAlessio Arleo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani. 256-271 [doi]
- Drawing Big Graphs Using Spectral SparsificationPeter Eades, Quan Nguyen, Seok-Hee Hong. 272-286 [doi]
- Revisited Experimental Comparison of Node-Link and Matrix RepresentationsMershack Okoe, Radu Jianu, Stephen G. Kobourov. 287-302 [doi]
- Improved Bounds for Drawing Trees on Fixed Points with L-Shaped EdgesTherese C. Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw. 305-317 [doi]
- On Upward Drawings of Trees on a Given GridTherese C. Biedl, Debajyoti Mondal. 318-325 [doi]
- Simple Compact Monotone Tree DrawingsAnargyros Oikonomou, Antonios Symvonis. 326-333 [doi]
- Visualizing Co-phylogenetic ReconciliationsTiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani. 334-347 [doi]
- Anisotropic Radial Layout for Visualizing Centrality and Structure in GraphsMukund Raj, Ross T. Whitaker. 351-364 [doi]
- Computing Storyline Visualizations with Few Block CrossingsThomas C. van Dijk, Fabian Lipp, Peter Markfelder, Alexander Wolff. 365-378 [doi]
- MLSEB: Edge Bundling Using Moving Least Squares ApproximationJieting Wu, Jianping Zeng, Feiyu Zhu, Hongfeng Yu. 379-393 [doi]
- Drawing Dynamic Graphs Without TimeslicesPaolo Simonetto, Daniel W. Archambault, Stephen G. Kobourov. 394-409 [doi]
- Colored Point-Set Embeddings of Acyclic GraphsEmilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta, Alfredo Navarra. 413-425 [doi]
- Planar Drawings of Fixed-Mobile BigraphsMichael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis. 426-439 [doi]
- Ordered Level Planarity, Geodesic Planarity and Bi-MonotonicityBoris Klemz, Günter Rote. 440-453 [doi]
- Non-crossing Paths with Geographic ConstraintsRodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek. 454-461 [doi]
- Planar L-Drawings of Directed GraphsSteven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff. 465-478 [doi]
- NodeTrix Planarity Testing with Small ClustersEmilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani, Alessandra Tappini. 479-491 [doi]
- The Painter's Problem: Covering a Grid with Colored Connected PolygonsArthur van Goethem, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Max Sondag, Jules Wulms. 492-505 [doi]
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge CountDavid Eppstein. 506-513 [doi]
- 1-Fan-Bundle-Planar Drawings of GraphsPatrizio Angelini, Michael A. Bekos, Michael Kaufmann 0001, Philipp Kindermann, Thomas Schneck. 517-530 [doi]
- Gap-Planar GraphsSang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth. 531-545 [doi]
- Beyond OuterplanaritySteven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, Alexander Wolff. 546-559 [doi]
- The Effect of Planarization on WidthDavid Eppstein. 560-572 [doi]
- Graph Drawing Contest ReportWilliam E. Devanny, Philipp Kindermann, Maarten Löffler, Ignaz Rutter. 575-582 [doi]