*from the titles*as either computational geometry or data structures. As usual, I can't guarantee that these lists are either exclusive or exhaustive; if a paper qualified for both lists, I just picked one. Sorry if I missed your paper.

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!

### Computational Geometry

Mohammad Ali Abam, Mark De Berg, and Amirali Khosravi.

Piecewise-Linear Approximations of Uncertain FunctionsPatrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, and Claudio Squarcella.

On the Area Requirements of Euclidean Minimum Spanning TreesSpyros Angelopoulos, Alejandro Lopez-Ortiz, and Konstantinos Panagiotou.

Multi-target Ray Searching ProblemsEsther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, and Shang Yang.

Convex TransversalsBoris Aronov and Muriel Dulieu.

How to Cover a Point Set with a V-Shape of Minimum WidthBoris Aronov, Muriel Dulieu, and Ferran Hurtado.

Witness Rectangle GraphsMark de Berg, Amirali Khosravi, Sander Verdonschot, and Vincent Van Der Weele.

On Rectilinear Partitions with Minimum Stabbing NumberTherese Biedl, Stephane Durocher, Celine Engelbeen, Samuel Fiorini, and Maxwell Young.

Faster Optimal Algorithms For Segment Minimization With Small Maximal ValueTherese Biedl and Lesvia Elena Ruiz Velázquez.

Orthogonal cartograms with few corners per faceMarkus Bläser, Bodo Manthey, and B. V. Raghavendra Rao.

Smoothed Analysis of Partitioning Algorithms for Euclidean FunctionalsProsenjit Bose, Paz Carmi, Mirela Damian, Robin Flatland, Matthew Katz, and Anil Maheshwari.

Switching to Directional Antennas with Constant Increase in Radius and Hop DistanceKevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, and Rodrigo Silveira.

Adjacency-Preserving Spatial TreemapsErin 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 RadiiTimothy M. Chan and Vinayak Pathak.

Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High DimensionsDanny Z. Chen and Haitao Wang.

New Algorithms for 1-D Facility Location and Path Equipartition ProblemsTobias Christ.

Beyond Triangulation: Covering Polygons with TrianglesAtlas F. Cook IV, Anne Driemel, Sariel Har-Peled, Jessica Sherette, and Carola Wenk.

Computing the Fréchet Distance Between Folded PolygonsAnne Driemel, Herman Haverkort, Maarten Löffler, and Rodrigo Silveira.

Flow Computations on Imprecise TerrainsDavid Eppstein, Michael Goodrich, and Maarten Löffler.

Tracking Moving Objects with Few HandoversP. Thomas Fletcher, John Moeller, Jeff Phillips, and Suresh Venkatasubramanian.

Horoball Hulls and Extents in Positive Definite SpaceJie Gao and Dengpan Zhou.

Resilient and Low Stretch Routing Through Embedding into Tree MetricsAndreas Gemsa, Martin Nöllenburg and Ignaz Rutter.

Consistent Labeling of Rotating MapsMichael Hoffmann, Micha Sharir, Adam Sheffer, Csaba Toth, and Emo Welzl.

Counting Plane Graphs: Flippability and its ApplicationsAllan Jorgensen, Maarten Löffler, and Jeff Phillips.

Geometric Computations on Indecisive PointsPegah Kamousi, Timothy Chan, and Subhash Suri.

Closest Pair and the Post Office Problem for Stochastic PointsYakov Nekrich.

A Fast Algorithm for Three-Dimensional Layers of Maxima ProblemValentin Polishchuk and Mikko Sysikaski.

Faster algorithms for minimum-link paths with restricted orientationsShay Solomon.

The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light

### Data Structures

Paul Christiano, Erik D. Demaine, and Shaunak Kishore.

Lossless Fault-Tolerant Data Structures with Additive OverheadPooya Davoodi, Gerth Stølting Brodal, and Srinivasa Rao Satti.

Path Minima Queries in Dynamic Weighted TreesJohannes Fischer.

Inducing the LCP-ArrayKyle Fox.

Upper Bounds for Maximally Greedy Binary Search TreesMichael Fredman.

On the matter of dynamic optimality in an extended model for tree access operationsJing He, Hongyu Liang, and Guang Yang.

Reversing Longest Previous Factor Tables is HardMeng He and Ian Munro.

Space Efficient Data Structures for Dynamic Orthogonal Range CountingBrent Heeringa, Marius Cătălin Iordan, and Louis Theran.

Searching in Dynamic Tree-Like Partial OrdersShoshana Neuburger and Dina Sokol.

Succinct 2D Dictionary Matching With No SlowdownYahav Nussbaum.

Improved Distance Queries in Planar Graphs

## Comments