Table of Contents

• FlipsProsenjit Bose. 1 [doi]
• Interactive Network Exploration to Derive Insights: Filtering, Clustering, Grouping, and SimplificationBen Shneiderman, Cody Dunne. 2-18 [doi]
• Counting Plane Graphs: Cross-Graph Charging SchemesMicha Sharir, Adam Sheffer. 19-30 [doi]
• Disconnectivity and Relative Positions in Simultaneous EmbeddingsThomas Bläsius, Ignaz Rutter. 31-42 [doi]
• Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working StorageMichael T. Goodrich, Olga Ohrimenko, Roberto Tamassia. 43-54 [doi]
• Graph Drawing by Classical Multidimensional Scaling: New PerspectivesMirza Klimenta, Ulrik Brandes. 55-66 [doi]
• Progress on Partial Edge DrawingsTill Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff. 67-78 [doi]
• Implementing a Partitioned 2-Page Book Embedding Testing AlgorithmPatrizio Angelini, Marco Di Bartolomeo, Giuseppe Di Battista. 79-89 [doi]
• Shrinking the Search Space for Clustered PlanarityMarkus Chimani, Karsten Klein. 90-101 [doi]
• Open Rectangle-of-Influence Drawings of Non-triangulated Planar GraphsSoroush Alamdari, Therese C. Biedl. 102-113 [doi]
• The Approximate Rectangle of Influence Drawability ProblemEmilio Di Giacomo, Giuseppe Liotta, Henk Meijer. 114-125 [doi]
• Planar Lombardi Drawings for Subcubic GraphsDavid Eppstein. 126-137 [doi]
• Circle-Representations of Simple 4-Regular Planar GraphsMichael A. Bekos, Chrysanthi N. Raftopoulou. 138-149 [doi]
• Smooth Orthogonal LayoutsMichael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis. 150-161 [doi]
• Toward a Theory of Planarity: Hanani-Tutte and Planarity VariantsMarcus Schaefer. 162-173 [doi]
• Planar Graphs as VPG-GraphsSteven Chaplick, Torsten Ueckerdt. 174-186 [doi]
• On Representing Graphs by Touching CuboidsDavid Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides. 187-198 [doi]
• Touching Triangle Representations for 3-Connected Planar GraphsStephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat. 199-210 [doi]
• Proportional Contact Representations of 4-Connected Planar GraphsMd. Jawaherul Alam, Stephen G. Kobourov. 211-223 [doi]
• Edge-Weighted Contact Representations of Planar GraphsMartin Nöllenburg, Roman Prutkin, Ignaz Rutter. 224-235 [doi]
• Column-Based Graph LayoutsGregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter, Dorothea Wagner. 236-247 [doi]
• Upward Planarity Testing via SATMarkus Chimani, Robert Zeranski. 248-259 [doi]
• Self-approaching GraphsSoroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak. 260-271 [doi]
• Homotopic $\mathcal{C}$-Oriented RoutingKevin Verbeek. 272-278 [doi]
• Kinetic and Stationary Point-Set Embeddability for Plane GraphsZahed Rahmati, Sue Whitesides, Valerie King. 279-290 [doi]
• Point-Set Embeddability of 2-Colored TreesFabrizio Frati, Marc Glisse, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Rahnuma Islam Nishat. 291-302 [doi]
• Covering Paths for Planar Point SetsAdrian Dumitrescu, Csaba D. Tóth. 303-314 [doi]
• Grid Drawings and the Chromatic NumberMartin Balko. 315-326 [doi]
• On the Density of Maximal 1-Planar GraphsFranz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber. 327-338 [doi]
• Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract)Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki. 339-345 [doi]
• Tangles and Degenerate TanglesAndres J. Ruiz-Vargas. 346-351 [doi]
• Density Theorems for Intersection Graphs of t-Monotone CurvesAndrew Suk. 352-363 [doi]
• The Visible Perimeter of an Arrangement of DisksGabriel Nivasch, János Pach, Gábor Tardos. 364-375 [doi]
• Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line DrawingsLuca Castelli Aleardi, Olivier Devillers, Éric Fusy. 376-387 [doi]
• Planar Preprocessing for Spring EmbeddersJ. Joseph Fowler, Stephen G. Kobourov. 388-399 [doi]
• StreamEB: Stream Edge BundlingQuan Hoang Nguyen, Peter Eades, Seok-Hee Hong. 400-413 [doi]
• Force-Directed Graph Drawing Using Social Gravity and ScalingMichael J. Bannister, David Eppstein, Michael T. Goodrich, Lowell Trott. 414-425 [doi]
• Drawing Clustered Graphs as Topographic MapsMartin Gronemann, Michael Jünger. 426-438 [doi]
• Visualizing Streaming Text Data with Dynamic Graphs and MapsEmden R. Gansner, Yifan Hu, Stephen C. North. 439-450 [doi]
• On the Usability of Lombardi Graph DrawingsHelen C. Purchase, John Hamer, Martin Nöllenburg, Stephen G. Kobourov. 451-462 [doi]
• Drawing Metro Maps Using Bézier CurvesMartin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell Roberts, Julian Schuhmann, Alexander Wolff. 463-474 [doi]
• Mental Map Preservation Helps User Orientation in Dynamic GraphsDaniel Archambault, Helen C. Purchase. 475-486 [doi]
• Clustering, Visualizing, and Navigating for Large Dynamic GraphsArnaud Sallaberry, Chris Muelder, Kwan-Liu Ma. 487-498 [doi]
• DAGView: An Approach for Visualizing Large GraphsEvgenios M. Kornaropoulos, Ioannis G. Tollis. 499-510 [doi]
• Time-Space Maps from TriangulationsSandra Bies, Marc J. van Kreveld. 511-516 [doi]
• Graph Drawing in TikZTill Tantau. 517-528 [doi]
• Optical Graph RecognitionChristopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Josef Reislhuber. 529-540 [doi]
• Interactive Random Graph Generation with Evolutionary AlgorithmsBenjamin Bach, Andre Suslik Spritzer, Evelyne Lutton, Jean-Daniel Fekete. 541-552 [doi]
• Visualizing Large Hierarchically Clustered Graphs with a Landscape MetaphorJan Christoph Athenstädt, Robert Görke, Marcus Krug, Martin Nöllenburg. 553-554 [doi]
• On Sparse Maximal 2-Planar GraphsChristopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer. 555-556 [doi]
• Testing Planarity by Switching TrainsChristopher Auer, Andreas Gleißner, Kathrin Hanauer, Sebastian Vetter. 557-558 [doi]
• Weak Dominance Drawings for Directed Acyclic GraphsEvgenios M. Kornaropoulos, Ioannis G. Tollis. 559-560 [doi]
• Planar Lombardi Drawings of OuterpathsMaarten Löffler, Martin Nöllenburg. 561-562 [doi]
• The First Simple Symmetric 11-Venn DiagramKhalegh Mamakani, Frank Ruskey. 563-565 [doi]
• On the Faithfulness of Graph VisualizationsQuan Hoang Nguyen, Peter Eades, Seok-Hee Hong. 566-568 [doi]
• More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar GraphsMichael T. Goodrich, Joseph A. Simons. 569-570 [doi]
• Theory and Practice of Graph DrawingTim Dwyer, Fabrizio Frati, Seok-Hee Hong, Karsten Klein. 571-574 [doi]
• Graph Drawing Contest ReportChristian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander. 575-579 [doi]