Presentations

• Marcus Schaefer. Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
   
• Glencora Borradaile, David Eppstein and Pingan Zhu. Planar Induced Subgraphs of Sparse Graphs
   
• Markus Chimani, Giuseppe Di Battista, Fabrizio Frati and Karsten Klein. Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
   
• Therese Biedl. Height-preserving transformations of planar graph drawings
   
• Andres Ruiz-Vargas, Andrew Suk and Csaba Toth. Disjoint edges in topological graphs and the tangled-thrackle conjecture
   
• Eyal Ackerman and Marcus Schaefer. A crossing lemma for the pair-crossing number
   
• Jan Christoph Athenstädt, Tanja Hartmann and Martin Nöllenburg. Simultaneous Embeddability of Two Partitions
   
• Ulf Rüegg, Steve Kieffer, Tim Dwyer, Kim Marriott and Michael Wybrow. Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
   
• Martin Nöllenburg, Roman Prutkin and Ignaz Rutter. On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
   
• Radoslav Fulek, Jan Kyncl, Igor Malinović and Dömötör Pálvölgyi. Clustered Planarity Testing Revisited
   
• Michael J. Bannister, William E. Devanny, David Eppstein and Michael Goodrich. The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
   
• Yifan Hu and Lei Shi. A Coloring Algorithm for Disambiguating Graph and Map Drawings
   
• Michael Bekos, Martin Gronemann, Michael Kaufmann and Robert Krug. Planar Octilinear Drawings with One Bend Per Edge
   
• Zachary Abel, Erik D. Demaine, Martin Demaine, David Eppstein, Anna Lubiw and Ryuhei Uehara. Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
   
• Thomas Bläsius and Ignaz Rutter. A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
   
• Michael Marner, Karsten Klein, Ross Smith, Bruce Thomas, Peter Eades and Seok-Hee Hong. GION: Interactively untangling large graphs on wall-sized displays
   
• Timothy Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel and Marcus Schaefer. Drawing Partially Embedded and Simultaneously Planar Graphs
   
• Stephen Kobourov, Sergey Pupyrev and Bahador Saket. Are Crossings Important for Drawing Large Graphs?
   
• Philipp Kindermann, André Schulz, Joachim Spoerhase and Alexander Wolff. On Monotone Drawings of Trees
   
• Martin Fink, Alexander Wolff, Julian Schuhmann and Maximilian Aulbach. Drawing Graphs within Restricted Area
   
• Fidel Barrera-Cruz, Penny Haxell and Anna Lubiw. Morphing Schnyder drawings of planar triangulations (video)
   
• Martin Gronemann. Bitonic st-orderings of biconnected planar graphs
   
• Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani and Ioannis Tollis. Fan-planar Graphs: Combinatorial Properties and Complexity Results
   
• Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen Kobourov and Sergey Pupyrev. Balanced Circle Packings for Planar Graphs
   
• Luca Grilli, Seok-Hee Hong, Jan Kratochvíl and Ignaz Rutter. Drawing Simultaneously Embedded Graphs with Few Bends
   
• Walter Didimo, Giuseppe Liotta and Maurizio Patrignani. On the Complexity of HV-Rectilinear Planarity Testing
   
• Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer and Stephen Wismath. Planar and Quasi Planar Simultaneous Geometric Embedding
   
• Emilio Di Giacomo, Giuseppe Liotta and Fabrizio Montecchiani. Drawing Outer 1-planar graphs with few slopes
   
• Stephane Durocher and Debajyoti Mondal. Drawing Planar Graphs with Reduced Height
   
• Alon Efrat, Yifan Hu, Stephen Kobourov and Sergey Pupyrev. MapSets: Visualizing Embedded and Clustered Graphs
   
• Michael J. Bannister and David Eppstein. Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
   
• Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Vincenzo Roselli and Giuseppe Di Battista. The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity)
   
• Arlind Nocaj, Mark Ortmann and Ulrik Brandes. Untangling Hairballs: From 3 to 14 Degrees of Separation
   
• Philipp Kindermann, Fabian Lipp and Alexander Wolff. Boundary Labeling for Annotations in Texts
   
• William Evans, Vincent Kusters, Maria Saumell and Bettina Speckmann. Column Planarity and Partial Simultaneous Geometric Embedding
   
• Linda Kleist and Benjamin Rahman. Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
   
• Stephane Durocher and Debajyoti Mondal. Trade-offs in Planar Polyline Drawings
   
• Hooman Reisi Dehkordi, Fabrizio Frati and Joachim Gudmundsson. Increasing-Chord Graphs On Point Sets
   
• Michael Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong and Michael Kaufmann. On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
   
• Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze and Birgit Vogtenhuber. Embedding Four-directional Paths on Convex Point Sets
   
• Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani and Vincenzo Roselli. Anchored Drawings of Planar Graphs