Abstract is missing.
- Planar Induced Subgraphs of Sparse GraphsGlencora Borradaile, David Eppstein, Pingan Zhu. 1-12 [doi]
- Picking Planar Edges; or, Drawing a Graph with a Planar SubgraphMarcus Schaefer. 13-24 [doi]
- Drawing Partially Embedded and Simultaneously Planar GraphsTimothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer. 25-39 [doi]
- Drawing Simultaneously Embedded Graphs with Few BendsLuca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter. 40-51 [doi]
- Planar and Quasi Planar Simultaneous Geometric EmbeddingEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath. 52-63 [doi]
- Simultaneous Embeddability of Two PartitionsJan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg. 64-75 [doi]
- Luatodonotes: Boundary Labeling for Annotations in TextsPhilipp Kindermann, Fabian Lipp, Alexander Wolff. 76-88 [doi]
- A Coloring Algorithm for Disambiguating Graph and Map DrawingsYifan Hu, Lei Shi. 89-100 [doi]
- Untangling Hairballs - From 3 to 14 Degrees of SeparationArlind Nocaj, Mark Ortmann, Ulrik Brandes. 101-112 [doi]
- GION: Interactively Untangling Large Graphs on Wall-Sized DisplaysMichael R. Marner, Ross T. Smith, Bruce H. Thomas, Karsten Klein, Peter Eades, Seok-Hee Hong. 113-124 [doi]
- Balanced Circle Packings for Planar GraphsMd. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev. 125-136 [doi]
- Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3DLinda Kleist, Benjamin Rahman. 137-148 [doi]
- The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing DrawingsMichael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich. 149-161 [doi]
- Bitonic st-orderings of Biconnected Planar GraphsMartin Gronemann. 162-173 [doi]
- Drawing Outer 1-planar Graphs with Few SlopesEmilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani. 174-185 [doi]
- Fan-Planar Graphs: Combinatorial Properties and Complexity ResultsCarla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis. 186-197 [doi]
- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar GraphsMichael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann. 198-209 [doi]
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded TreewidthMichael J. Bannister, David Eppstein. 210-221 [doi]
- A Crossing Lemma for the Pair-Crossing NumberEyal Ackerman, Marcus Schaefer. 222-233 [doi]
- Are Crossings Important for Drawing Large Graphs?Stephen G. Kobourov, Sergey Pupyrev, Bahador Saket. 234-245 [doi]
- The Importance of Being Proper - (In Clustered-Level Planarity and T-Level Planarity)Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Vincenzo Roselli. 246-258 [doi]
- Column Planarity and Partial Simultaneous Geometric EmbeddingWilliam Evans, Vincent Kusters, Maria Saumell, Bettina Speckmann. 259-271 [doi]
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge LengthsZachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara. 272-283 [doi]
- Disjoint Edges in Topological Graphs and the Tangled-Thrackle ConjectureAndres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth. 284-293 [doi]
- Morphing Schnyder Drawings of Planar TriangulationsFidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw. 294-305 [doi]
- Trade-Offs in Planar Polyline DrawingsStephane Durocher, Debajyoti Mondal. 306-318 [doi]
- Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with PortsUlf Rüegg, Steve Kieffer, Tim Dwyer, Kim Marriott, Michael Wybrow. 319-330 [doi]
- Planar Octilinear Drawings with One Bend Per EdgeMichael A. Bekos, Martin Gronemann, Michael Kaufmann, Robert Krug. 331-342 [doi]
- On the Complexity of HV-rectilinear Planarity TestingWalter Didimo, Giuseppe Liotta, Maurizio Patrignani. 343-354 [doi]
- Embedding Four-Directional Paths on Convex Point SetsOswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, Birgit Vogtenhuber. 355-366 [doi]
- Drawing Graphs within Restricted AreaMaximilian Aulbach, Martin Fink, Julian Schuhmann, Alexander Wolff. 367-379 [doi]
- Height-Preserving Transformations of Planar Graph DrawingsTherese C. Biedl. 380-391 [doi]
- Drawing Planar Graphs with Reduced HeightStephane Durocher, Debajyoti Mondal. 392-403 [doi]
- Anchored Drawings of Planar GraphsPatrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli. 404-415 [doi]
- Advances on Testing C-Planarity of Embedded Flat Clustered GraphsMarkus Chimani, Giuseppe Di Battista, Fabrizio Frati, Karsten Klein. 416-427 [doi]
- Clustered Planarity Testing RevisitedRadoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi. 428-439 [doi]
- A New Perspective on Clustered Planarity as a Combinatorial Embedding ProblemThomas Bläsius, Ignaz Rutter. 440-451 [doi]
- MapSets: Visualizing Embedded and Clustered GraphsAlon Efrat, Yifan Hu, Stephen G. Kobourov, Sergey Pupyrev. 452-463 [doi]
- Increasing-Chord Graphs On Point SetsHooman Reisi Dehkordi, Fabrizio Frati, Joachim Gudmundsson. 464-475 [doi]
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar GraphsMartin Nöllenburg, Roman Prutkin, Ignaz Rutter. 476-487 [doi]
- On Monotone Drawings of TreesPhilipp Kindermann, André Schulz, Joachim Spoerhase, Alexander Wolff. 488-500 [doi]
- Graph Drawing Contest ReportCarsten Gutwenger, Maarten Löffler, Lev Nachmanson, Ignaz Rutter. 501-506 [doi]