The following papers (in submission order) have been accepted for presentation:

• Guilherme da Fonseca. Fitting Flats to Points with Outliers
• Florian Berger and Rolf Klein. A Traveller's Problem
• Rainer Penninger, Elmar Langetepe and Jan Tulke. Computing the visibility area between two simple polygons in linear time
• Oswin Aichholzer, Franz Aurenhammer, Katerina Cech Dobiasova, Bert Juettler and Wolfgang Aigner. Arc Triangulations
• Andre Berger, Alexander Grigoriev and Natalya Usotskaya. The time-optimal helicopter trajectory is a circle segment
• Stefan Felsner and Pavel Valtr. Coding and Counting Arrangements of Pseudolines
• David Eppstein and Elena Mumford. Steinitz Theorems for Orthogonal Polyhedra
• Shuhei Takahashi and Kokichi Sugihara. How to cope with undesired side effects of symbolic perturbation
• Herman Haverkort. Recursive tilings and space-filling curves with little fragmentation
• Sudeshna Kolay, Subhas Nandy and Susmita Sur-Kolay. 2-Factor Approximation Algorithm for Computing Maximum Independent Set of a Unit Disk Graph
• Eric Berberich, Dan Halperin, Michael Kerber and Roza Pogalnikova. Polygonal Reconstruction from Approximate Offsets
• Anne Driemel, Sariel Har-Peled and Carola Wenk. Approximating the Frechet Distance for Realistic Curves in Near Linear Time
• Stefan Huber and Martin Held. Straight Skeletons and their Relation to Triangulations
• Yonatan Myers and Leo Joskowicz. Circles with Independent and Dependent Uncertainties
• Christian Knauer, Lena Schlipf, Jens M. Schmidt and Hans Raj Tiwary. Largest Inscribed Rectangles in Convex Polygons
• Mark de Berg, Elena Mumford and Marcel Roeloffzen. Finding Structures on Imprecise Points
• Chris Gray. Nearest-neighbor queries with well-spaced points
• Boris Kozorovitzky and Dan Halperin. Snap Rounding on the Sphere
• Sang Won Bae, Matias Korman and Yoshio Okamoto. The geodesic diameter of polygonal domains
• Mark de Berg and AmirAli Khosravi. On Rectilinear Partitions with Minimum Stabbing Number
• Mark de Berg and Dirk H.P. Gerrits. Approximation algorithms for free-label maximization
• Mark de Berg, Dirk Gerrits, Amirali Khosravi, Ignaz Rutter, Constantinos Tsirogiannis and Alexander Wolff. How Alexander the Great Brought the Greeks Together while Inflicting Minimal Damage to the Barbarians
• Asish Mukhopadhyay, Harshit Rathod, Chong Wang and Bryan St. Amour. Certifying curve-reconstruction algorithms
• Greg Aloupis, Brad Ballinger, Sebastien Collette, Stefan Langerman, Attila Por and David Wood. Blocking Coloured Point Sets
• Amit Chattopadhyay, Sijbo Holtman and Gert Vegter. Certified Computation of planar Morse-Smale Complexes
• Bernardo Abrego, Ruy Fabila, Silvia Fernandez-Merchant, David Flores, Ferran Hurtado, Henk Meijer, Vera Sacristan and Maria Saumell. Proximity Graphs inside Large Weighted Graphs
• Natasa Jovanovic, Jan Korst, Zharko Aleksovski and Radivoje Jovanovic. Hiding in the Crowd: Asymptotic Bounds on Blocking Sets
• Fabian Stehn, Christian Knauer and Klaus Kriegel. Towards Non-Uniform Geometric Matchings
• Sergey Bereg, Sergio Cabello, José-Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara and Inmaculada Ventura Molina. The Class Cover Problem with Boxes
• Andreas von Dziegielewski, Rainer Erbes and Elmar Schömer. Real-Time Offset Surfaces
• Victor Chepoi, Nicolas Catusse and Yann Vaxes. Planar Hop Spanners for Unit Disk Graphs
• Victor Chepoi, Nicolas Catusse and Yann Vaxes. Embedding into the rectilinear plane in optimal O(n²) time
• Jan Foniok, Komei Fukuda and Lorenz Klaus. Combinatorial Proof for fast Pivoting in K-matrix Linear Complementarity
• Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer, Alexander Pilz and Birgit Vogtenhuber. 3-Colorability of Pseudo-Triangulations
• Sándor Fekete, Tom Kamphans, Alexander Kröller and Christiane Schmidt. Robot Swarms for Exploration and Triangulation of Unknown Environments
• Panos Giannopoulos, Christian Knauer, Magnus Wahlström and Daniel Werner. Hardness of discrepancy and related problems parameterized by the dimension
• Sándor Fekete, Chris Gray and Alexander Kröller. Evacuation of rectilinear polygons
• Hee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf and Antoine Vigneron. Computing the discrete Fréchet distance with imprecise input
• Victor Alvarez. Even Triangulation of Planar Set of Points with Steiner Points
• Manuel Caroli and Monique Teillaud. Delaunay Triangulations of Point Sets in Closed Euclidean d-Manifolds
• Dan Chen, Luc Devroye, Vida Dujmović and Pat Morin. Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
• Andrei Asinowski, Gill Barequet, Toufik Mansour and Ron Y. Pinter. Order types of segments in floorplan partitions
• Atlas F. Cook IV, Chenglin Fan and Jun Luo. Hide-and-Seek: A Linear Time Algorithm for Polygon Walk Problems
• Afra Zomorodian. The Tidy Set: A Minimal Simplicial Set for Computing Homology of Clique Complexes
• Esther M. Arkin, Delia Garijo, Alberto Márquez, Joseph S. B. Mitchell and Carlos Seara. Separability of Point Sets by k-Level Linear Classification Trees
• Vicente H. F. Batista, Fábio Protti and Fernando L. B. Ribeiro. On the complexity of the edge guarding problem
• Chris Gray, Frank Kammer, Maarten Löffler and Rodrigo Silveira. Removing Local Extrema from Imprecise Terrains
• Yan Mayster, Mohammed Al-Bow, Catherine Durso and Mario Lopez. Locating an Obnoxious Line Through a Set of Weighted Points
• Yan Mayster, Riquelmi Cardona and Mario Lopez. On Widest Empty Wedges
• Mostafa Nouri Baygi and Mohammad Ghodsi. Partial Visibility Polygon with Semi-Transparent Objects
• Daniel Peterseim. Triangulating a System of Disks
• Marwan Al-Jubeh, Gill Barequet, Mashhood Ishaque, Diane Souvaine, Csaba Toth and Andrew Winslow. Connecting Obstacles in Vertex-Disjoint Paths
• Atsuhiro Nakamoto and Shoichi Tsuchiya. Geometric realization of a triangulation on the Klein bottle with one face removed
• Bahram Kouhestani, Mohammad Asgaripour, Salma Sadat Mahdavi, Arash Nouri and Ali Mohades. Visibility Polygons in the Presence of a Mirror Edge
• Isabel Fernández Delgado, Clara Isabel Grima Ruiz, Alberto Márquez Pérez, Atsuhiro Nakamoto, Rafael Robles Arias and Jesús Valenzuela Muñoz. Even and quasi-even triangulations of point sets in the plane
• Khaled Elbassioni, Domagoj Matijevic and Domagoj Severdija. Guarding 1.5D Terrains with Demands
• Ahmad Javad, Ali Mohades, Mansoor Davoodi and Farnaz Sheikhi. Convex Hull Of Imprecise Points Modeled By Segments
• Javier Cano, Mayra Corvera Espinoza, José Miguel Díaz-Báñez, Joel Espinosa Longi, Clemens Huemer and Jorge Urrutia. The edge rotation graph
• Arman Didandeh, Mehdi Khosravian and Bahram Sadeghi Bigham. A Reactive-Agent Based Approach for a Facility Location Problem Using Dynamic Additively Weighted Voronoi Diagram
• Helmut Alt and Ludmila Scharf. Computing the depth of an arrangement of axis-aligned rectangles in parallel
• Guillaume Batog. From invariants to predicates: example of line transversals to lines
• Saladi Rahul and Rajan K.S.. One-Reporting Queries
• Ioannis Emiris, Vissarion Fisikopoulos and Christos Konaxis. Regular triangulations and resultant polytopes
• Günter Rote. Partial Least-Squares Point Matching under Translations
• Crevel Bautista-Santiago, Javier Cano, Ruy Fabila-Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento and Jorge Urrutia. On the Diameter of a Geometric Johnson Type Graph
• Ioannis Emiris, Theocharis Malamatos and Elias Tsigaridas. Approximate Nearest Neighbor Queries among Parallel Segments
• Farhad Shahrokhi. A new separation theorem with geometric applications
• Kai Werth and Elmar Schömer. A fast and easy-to-implement algorithm for the Minimal Translational Distance (MTD) of boxes