Congratulations to all the authors, but especially to my PhD student Kyle Fox on his first solo paper, his second student-only paper, and his second paper!
Mohammad Ali Abam, Mark De Berg, and Amirali Khosravi.
Piecewise-Linear Approximations of Uncertain Functions
Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, and Claudio Squarcella.
On the Area Requirements of Euclidean Minimum Spanning Trees
Spyros Angelopoulos, Alejandro Lopez-Ortiz, and Konstantinos Panagiotou.
Multi-target Ray Searching Problems
Esther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, and Shang Yang.
Boris Aronov and Muriel Dulieu.
How to Cover a Point Set with a V-Shape of Minimum Width
Boris Aronov, Muriel Dulieu, and Ferran Hurtado.
Witness Rectangle Graphs
Mark de Berg, Amirali Khosravi, Sander Verdonschot, and Vincent Van Der Weele.
On Rectilinear Partitions with Minimum Stabbing Number
Therese Biedl, Stephane Durocher, Celine Engelbeen, Samuel Fiorini, and Maxwell Young.
Faster Optimal Algorithms For Segment Minimization With Small Maximal Value
Therese Biedl and Lesvia Elena Ruiz Velázquez.
Orthogonal cartograms with few corners per face
Markus Bläser, Bodo Manthey, and B. V. Raghavendra Rao.
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Flatland, Matthew Katz, and Anil Maheshwari.
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance
Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, and Rodrigo Silveira.
Adjacency-Preserving Spatial Treemaps
Erin Chambers, Sandor Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph Mitchell, Venkatesh Srinivasan, Ulrike Stege, and Sue Whitesides.
Connecting a Set of Circles with Minimum Sum of Radii
Timothy M. Chan and Vinayak Pathak.
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions
Danny Z. Chen and Haitao Wang.
New Algorithms for 1-D Facility Location and Path Equipartition Problems
Beyond Triangulation: Covering Polygons with Triangles
Atlas F. Cook IV, Anne Driemel, Sariel Har-Peled, Jessica Sherette, and Carola Wenk.
Computing the Fréchet Distance Between Folded Polygons
Anne Driemel, Herman Haverkort, Maarten Löffler, and Rodrigo Silveira.
Flow Computations on Imprecise Terrains
David Eppstein, Michael Goodrich, and Maarten Löffler.
Tracking Moving Objects with Few Handovers
P. Thomas Fletcher, John Moeller, Jeff Phillips, and Suresh Venkatasubramanian.
Horoball Hulls and Extents in Positive Definite Space
Jie Gao and Dengpan Zhou.
Resilient and Low Stretch Routing Through Embedding into Tree Metrics
Andreas Gemsa, Martin Nöllenburg and Ignaz Rutter.
Consistent Labeling of Rotating Maps
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba Toth, and Emo Welzl.
Counting Plane Graphs: Flippability and its Applications
Allan Jorgensen, Maarten Löffler, and Jeff Phillips.
Geometric Computations on Indecisive Points
Pegah Kamousi, Timothy Chan, and Subhash Suri.
Closest Pair and the Post Office Problem for Stochastic Points
A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
Valentin Polishchuk and Mikko Sysikaski.
Faster algorithms for minimum-link paths with restricted orientations
The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light
Paul Christiano, Erik D. Demaine, and Shaunak Kishore.
Lossless Fault-Tolerant Data Structures with Additive Overhead
Pooya Davoodi, Gerth Stølting Brodal, and Srinivasa Rao Satti.
Path Minima Queries in Dynamic Weighted Trees
Inducing the LCP-Array
Upper Bounds for Maximally Greedy Binary Search Trees
On the matter of dynamic optimality in an extended model for tree access operations
Jing He, Hongyu Liang, and Guang Yang.
Reversing Longest Previous Factor Tables is Hard
Meng He and Ian Munro.
Space Efficient Data Structures for Dynamic Orthogonal Range Counting
Brent Heeringa, Marius Cătălin Iordan, and Louis Theran.
Searching in Dynamic Tree-Like Partial Orders
Shoshana Neuburger and Dina Sokol.
Succinct 2D Dictionary Matching With No Slowdown
Improved Distance Queries in Planar Graphs