Presentations

• Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander Holroyd and Xiaoji Chen. GraphMaps: Browsing Large Graphs as Interactive Maps
   
• Henning Meyerhenke, Martin Nöllenburg and Christian Schulz: Drawing Large Graphs by Multilevel Maxent-Stress Optimization
   
• Alessio Arleo, Walter Didimo, Giuseppe Liotta and Fabrizio Montecchiani: A Million Edge Drawing for a Fistful of Dollars
   
• Fabian Lipp, Alexander Wolff and Johannes Zink: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
   
• Marcus Schaefer and Daniel Stefankovic: The Degenerate Crossing Number and Higher-Genus Embeddings
   
• Drago Bokal, Mojca Bracic, Marek Dernár and Petr Hlinený: On Degree Properties of Crossing-critical Families of Graphs
   
• Vida Dujmovic, David Eppstein and David R. Wood: Genus, Treewidth, and Local Crossing Number
   
• Alexander Igamberdiev, Wouter Meulemans and André Schulz. Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments
   
• Michael Bekos, Michael Kaufmann and Christian Zielke: The Book Embedding Problem from a SAT-Solving Perspective
   
• Ulf Rüegg, Christoph Daniel Schulze, John Julian Carstens and Reinhard Von Hanxleden: Size- and Port-Aware Horizontal Node Coordinate Assignment
   
• Therese Biedl and Jens M. Schmidt: Small-Area Orthogonal Drawings of 3-Connected Graphs
   
• Fabrizio Frati, Michael Hoffmann and Vincent Kusters: Simultaneous Embeddings with Few Bends and Crossings
   
• David Auber, Nicolas Bonichon, Paul Dorbec and Claire Pennarun: Rook-drawing for Plane Graphs
   
• Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz and Darren Strash: On Minimizing Crossings in Storyline Visualizations
   
• Christian Duncan: Maximizing the Degree of (Geometric) Thickness-t Regular Graphs
   
• Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Ignaz Rutter: Intersection-Link Representations of Graphs
   
• Jonathan Klawitter, Martin Nöllenburg and Torsten Ueckerdt: Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
   
• Björn Zimmer and Andreas Kerren: Displaying User Behavior in the Collaborative Graph Visualization System OnGraX (video)
   
• Michael J. Bannister, David A. Brown and David Eppstein: Confluent Orthogonal Drawings of Syntax Diagrams
   
• W. Didimo, F. Giacchà and F. Montecchiani: "Kojaph: Visual Definition and Exploration of Patterns in Graph Databases"
   
• Carla Binucci, Markus Chimani, Walter Didimo, Martin Gronemann, Karsten Klein, Jan Kratochvil, Fabrizio Montecchiani and Ioannis Tollis: 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
   
• Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta and Fabrizio Montecchiani: Recognizing and Drawing IC-planar Graphs
   
• Jan Kyncl: Simple Realizability of Complete Abstract Topological Graphs Simplified
   
• Vida Dujmovic: The Utility of Untangling
   
• Oswin Aichholzer, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader and Birgit Vogtenhuber: Representing Directed Trees as Straight Skeletons
   
• Ignacio Garcia Marco and Kolja Knauer: Drawing graphs with vertices and edges in convex position
   
• Martin Balko, Josef Cibulka and Pavel Valtr: Drawing graphs using a small number of obstacles
   
• Radoslav Fulek and Rados Radoicic: Vertical Visibility among Parallel Polygons in Three Dimensions
   
• Will Evans, Giuseppe Liotta, Henk Meijer and Steve Wismath: Alternating Paths and Cycles of Minimum Length
   
• Till Bruckdorfer, Michael Kaufmann, Stephen Kobourov and Sergey Pupyrev: On Embeddability of Buses in Point Sets
   
• Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, and Tamara Mchedlidze: A Universal Point Set for 2-Outerplanar Graphs
   
• Maarten Löffler and Csaba D. Tóth: Linear-size Universal Point Sets for One-bend Drawings
   
• Boris Klemz, Martin Nöllenburg and Roman Prutkin: Recognizing Weighted Disk Contact Graphs
   
• Clinton Bowen, Stephane Durocher, Maarten Löffler, Anika Rounds, André Schulz and Csaba D. Tóth: Realization of simply connected polygonal linkages and recognition of unit disk contact trees
   
• Vincent Kusters and Bettina Speckmann: Towards Characterizing Graphs with a Sliceable Rectangular Dual
   
• Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter, Torsten Ueckerdt and Alexander Wolff: Pixel and Voxel Representations of Graphs
   
• Wouter Meulemans and André Schulz: A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams
   
• Peter Eades, Seok-Hee Hong, Karsten Klein and An Nguyen: Shape-based Quality Metrics for Large Graph Visualization
   
• Lukas Barth, Andreas Gemsa, Benjamin Niedermann and Martin Nöllenburg: On the Readability of Boundary Labeling