• Michael Hirsch, Henk Meijer and David Rappaport. Biclique Edge Cover Graphs and Confluent Drawings
  • Balázs Keszegh, János Pach, Dömötör Pálvölgyi and Géza Tóth. Drawing cubic graphs with at most five slopes
  • Eric Fusy. Straight-line drawing of quadrangulations
  • Tim Dwyer, Kim Marriott and Michael Wybrow. Integrating Edge Routing into Force-Directed Layout
  • Ulrich Lauther. Multipole-Based Force Approximation Revisited - a Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree
  • Stephen Kobourov and Matthew Landis. Morphing Planar Graphs in Spherical Space
  • Alejandro Estrella-Balderrama, Joe Fowler and Stephen Kobourov. Characterization of Unlabeled Level Planar (ULP) Trees
  • David Wood and Jan Arne Telle. Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
  • Rolf Klein and Martin Kutz. Computing Geometric Minimum-Dilation Graphs is NP-Hard
  • Emilio Di Giacomo, Luca Grilli and Giuseppe Liotta. Drawing Bipartite Graphs on Two Curves
  • Emilio Di Giacomo, Walter Didimo and Giuseppe Liotta. Radial Drawings of Graphs: Geometric Constraints and Trade-offs
  • Stephen Wismath, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer and Francesco Trotta. k-chromatic point-set embeddability of outerplanar graphs
  • Stefan Felsner and Florian Zickfeld. Schnyder Woods and Orthogonal Surfaces
  • Cornelia Dangelmayr and Stefan Felsner. Chordal Graphs as Intersection Graphs of Pseudosegments
  • Mareike Massow and Stefan Felsner. Thickness of Bar 1-Visibility Graphs
  • Petr Hlineny and Gelasio Salazar. On the Crossing Number of  Almost Planar Graphs
  • Bruno Pinaud, Pascale Kuntz and Fabien Picarougne. The Website for Graph Visualization Software References (GVSR)
  • Carsten Gutwenger, Karsten Klein and Petra Mutzel. Planarity Testing and Optimal Edge Insertion with Embedding Constraints
  • Ulrik Brandes and Barbara Schlieper. Angle and Distance Constraints on Tree Drawings
  • Damian Merrick and Joachim Gudmundsson. Path Simplification for Metro Map Layout
  • Kazuyuki Miura, Tetsuya Matsuno and Takao Nishizeki. Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
  • Fabrizio Frati. Embedding Graphs Simultaneously with Fixed Edges
  • Joachim Gudmundsson, Marc van Kreveld and Damian Merrick. Schematisation of Tree Drawings
  • Josiah Carlson and David Eppstein. Trees with Convex Faces and Optimal Angles
  • David Eppstein. Upright-Quad Drawing of st-Planar Learning Spaces
  • Katharina Anna Lehmann and Stephan Kottler. Visualizing Large and Clustered Networks
  • Michael B. Dillencourt, David Eppstein and Michael T. Goodrich. Choosing Colors for Geometric Graphs via Color Space Embeddings
  • Jacob Fox and Csaba Toth. On the decay of crossing numbers
  • Fabrizio Frati and Giuseppe Di Battista. Three Dimensional Drawings of Bounded Degree Trees
  • Canan Yildiz, Petra Mutzel and Wilhelm Barth. A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
  • Justin Cappos, Alejandro Estrella-Balderrama, Joe Fowler and Stephen Kobourov. Simultaneous Graph Embedding with Bends and Circular Arcs
  • Helen C. Purchase, Eve Hoggan and Carsten Goerg. How Important is the "Mental Map"? -- an Empirical Investigation of a Dynamic Graph Layout Algorithm
  • Emden R. Gansner and Yehuda Koren. Improved circular layouts
  • Therese Biedl and Franz J. Brandenburg. Partitions of Graphs into Trees
  • Ali Civril, Malik-Magdon Ismail and Eli-Bocek Rivele. SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
  • Huamin Qu, Hong Zhou and Yingcai Wu. Controllable and Progressive Edge Clustering for Large Networks
  • Christopher Homan, Andrew Pavlo and Jonathan Schull. Smoother transitions between breadth-first-spanning-tree-based drawings
  • Tim Dwyer, Kim Marriott and Peter J. Stuckey. Fast Node Overlap Removal - Correction
  • Charalampos Papamanthou and Ioannis G. Tollis. Parameterized st-Orientations of Graphs: Algorithms and Experiments
  • Ulrik Brandes and Christian Pich. Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
  • Marc Benkert, Martin Nöllenburg, Takeaki Uno and Alexander Wolff. Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps
  • Martin Siebenhaller. Partitioned Drawings