The Visibility-Voronoi Complex and its Applications
Ron Wein, Jur P. van den Berg, Dan Halperin

Constructing the City Voronoi Diagram Faster
Robert Görke, Alexander Wolff

Computing Transportation Voronoi Diagrams in Optimal Time
Yaron Ostrovsky-Berman

Approximations of 3D Generalized Voronoi Diagrams
Imma Boada, Narcís Coll, Narcís Madern, J. Antoni Sellarès

Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube
Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, Christian Sohler

Lower Bounds for Kinetic Sorting
Mohammad Ali Abam, Mark de Berg

Uncertainty Envelopes
Yaron Ostrovsky-Berman, Leo Joskowicz

Covering Point Sets with Two Convex Objects
J. Miguel Díaz-Báñez, Carlos Seara, J. Antoni Sellarès, Jorge Urrutia, Inma Ventura

Maximum Line-Pair Stabbing Problem and its Variations
Sebastian Böcker, Veli Mäkinen

The Fastest Way to View a Query Point in Simple Polygons
Ramtin Khosravi, Mohammad Ghodsi

The Minimum Area Spanning Tree Problem
Paz Carmi, Matthew J. Katz

Spanning Trees with Few Crossings in Geometric and Topological Graphs
Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff

Bi-Chromatic Minimum Spanning Trees
Magdalene Grantson, Henk Meijer, David Rappaport

Constructing Interference-Minimal Networks
Marc Benkert, Joachim Gudmundsson, Herman Haverkort, Alexander Wolff

A Note on Simultaneous Embedding of Planar Graphs
Emilio Di Giacomo, Giuseppe Liotta