Accepted posters

• Carla Binucci, Walter Didimo and Fabrizio Montecchiani. A 1-planarity Testing and Embedding Algorithm
• Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter and Peter Stumpf. Stretching Two Pseudolines in Planar Straight-Line Drawings
• Panagiotis Lionakis, Giacomo Ortali and Ioannis Tollis. Adventures in Abstraction: Reachability in Hierarchical Drawings
• Michael Kaufmann and Axel Kuckuk. On topological book embedding for k-plane graphs
• Henry Förster and Michael Kaufmann. On Compact RAC Drawings
• Giuseppe Liotta, Ignaz Rutter and Alessandra Tappini. FPQ-choosable Planarity Testing
• Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini and Stephen Wismath. Packing Trees into 1-planar Graphs
• Sarah Schöttler, Tobias Kauer and Benjamin Bach. Geographic Network Visualization Techniques: A Work-In-Progress Taxonomy
• Arjun Pitchanathan and Saswata Shannigrahi. On the Simple Quasi Crossing Number of K11
• Jonathan Klawitter and Peter Stumpf. Minimising Crossings in a Tree-Based Network
• Noushin Saeedi and William Evans. Crossing Families and Their Generalizations
• R. Bruce Richter and Lily Wang. Which Sets of Strings are Pseudospherical?