Accepted papers

Instructions for the formatting and submission of final versions are now available from Sheridan Printing.

A total of 55 papers were accepted this year:

• A. Karim Abu-Affash, Paz Carmi, Matthew Katz and Michael Segal. The Euclidean Bottleneck Steiner Path Problem
• A. Karim Abu-Affash. On the Euclidean Bottleneck Full Steiner Tree Problem
• Alexander Gilbers and Rolf Klein. A New Upper Bound for the VC-Dimension of Visibility Regions
• Benjamin A. Burton and Melih Ozlen. A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
• Benjamin A. Burton. The Pachner graph and the simplification of 3-sphere triangulations
• Boris Bukh and Alfredo Hubard. Space crossing numbers
• Chao Chen and Michael Kerber. An Output-Sensitive Algorithm for Persistent Homology
• Ciprian Borcea and Ileana Streinu. Exact Workspace Boundary by Extremal Reaches
• Ciprian Borcea and Ileana Streinu. Extremal Reaches in Polynomial Time
• Daniel Reem. The geometric stability of Voronoi diagrams with respect to small changes of the sites
• David Eppstein and Maarten Löffler. Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension
• Dominique Attali, Andre Lieutier and David Salinas. Efficient data structure for representing and simplifying simplicial complexes in high dimension
• Dominique Attali, Andre Lieutier and David Salinas. Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
• Eric Berberich, Dan Halperin, Michael Kerber and Roza Pogalnikova. Deconstructing Approximate Offsets
• Eric Berberich, Michael Hemmer and Michael Kerber. A Generic Algebraic Kernel for Non-linear Geometric Applications
• Esther Ezra and Wolfgang Mulzer. Convex Hull of Imprecise Points in o(n log n) Time after Preprocessing
• Frédéric Chazal, Leonidas Guibas, Steve Oudot and Primoz Skraba. Persistence-Based Clustering in Riemannian Manifolds
• Friedrich Eisenbrand, Nicolai Hähnle and Martin Niemeier. Covering Cubes and the Closest Vector Problem
• Gary Miller, Todd Phillips and Don Sheehy. Beating the Spread: Time-Optimal Point Meshing
• Ge Xia. Improved Upper Bound on the Stretch Factor of Delaunay Triangulations
• Janos Pach and Gabor Tardos. Tight lower bounds for the size of epsilon-nets
• Jeff Erickson. Shortest nontrivial cycles in directed surface graphs
• John Hershberger. Stable Snap Rounding
• John Iacono. A static optimality transformation with applications to planar point location
• Justin Iwerks, Joseph Mitchell, Joondong Kim, Mohammad Irfan and Therese Biedl. Guarding Polyominoes
• Leonidas Guibas, Quentin Merigot and Dmitriy Morozov. Witnessed k-distance
• Manuel Caroli and Monique Teillaud. Delaunay Triangulations of Point Sets in Closed Euclidean d-Manifolds
• Mark de Berg, Marcel Roeloffzen and Bettina Speckmann. Kinetic Convex Hulls and Delaunay Triangulations in the Black-Box Model
• Mashood Ishaque, Diane Souvaine and Csaba Toth. Disjoint Compatible Geometric Matchings
• Menelaos I. Karavelas and Eleni Tzanaki. Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
• Mohammad Ali Abam, Boris Aronov, Mark de Berg and Amirali Khosravi. Approximation Algorithms for Computing Partitions with Minimum Stabbing Number of Rectilinear and Simple Polygons
• Mridul Aanjaneya, Frederic Chazal, Daniel Chen, Marc Glisse, Leonidas Guibas and Dmitriy Morozov. Metric Graph Reconstruction from Noisy Data
• Nathan Dunfield and Anil Hirani. The Least Spanning Area of a Knot and the Optimal Bounding Chain Problem
• Nicolas Chevallier and Yvan Maillot. Boundary of a non-uniform point cloud for reconstruction
• Nikola Milosavljevic, Dmitriy Morozov and Primož Škraba. Zigzag Persistent Homology in Matrix Multiplication Time
• Panagiotis Cheilaris, Shakhar Smorodinsky and Marek Sulovsky. The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
• Pankaj K. Agarwal, Thomas Mølhave, Hai Yu and Jim S. Clark. Exploiting Temporal Coherence in Forest Dynamics Simulation
  
• Pegah Kamousi, Timothy Chan and Subhash Suri. Stochastic Minimum Spanning Trees in Euclidean Spaces
• René Brandenberg and Stefan König. No dimension independent core sets for Containment under Homothetics
• Rishi Gupta, Piotr Indyk, Eric Price and Yaron Rachlin. Compressive sensing with local geometric features
• Ross J. Kang and Tobias Mueller. Sphere and dot product representations of graphs
• Sarang Joshi, Raj Varma Kommaraju, Jeff Phillips and Suresh Venkatasubramanian. Comparing Distributions and Shapes using the Kernel Distance
• Sariel Har-Peled and Benjamin Raichel. The Frechet Distance Revisited and Extended
• Seth Pettie. On the Structure and Composition of Forbidden Sequences, with Geometric Applications
• Siu-Wing Cheng and Jiongxin Jin. Edge Flips and Deforming Surface Meshes
• Stefan Felsner and Mathew Francis. Contact representations of planar graphs with cubes
• Stefan Huber and Martin Held. Theoretical and Practical Results on Straight Skeletons of Planar Straight-Line Graphs
• Tamal Dey and Yusu Wang. Reeb Graphs: Approximation and Persistence
• Timothy M. Chan, Kasper Green Larsen and Mihai Patrascu. Orthogonal Range Searching on the RAM, Revisited
• Timothy M. Chan. Three Problems about Dynamic Convex Hulls
• Tobias Müller, Erik Jan van Leeuwen and Jan van Leeuwen. Integer Representations of Convex Polygon Intersection Graphs
• Uli Wagner. Complete Minors of Hypergraphs, I. Random and Expanding Hypergraphs
• Umut Acar, Benoît Hudson and Duru Türkoglu. Kinetic Mesh Refinement in 2D
• Vida Dujmovic and Stefan Langerman. A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing
• Vít Jelínek, Jan Kratochvíl and Ignaz Rutter. A Kuratowski-type Theorem for Planarity of Partially Embedded Graphs