Euclidean TSP on Two Polygons. Jeff Abrahamson, Ali Shokoufandeh.
Flexibility of Subdivided Polyhedral Complexes. Audrey Lee, Ileana
Streinu.
Optimal Shape of a Blob. Carl M. Bender, Michael A. Bender.
Combining Discrete and Continuous Optimization to Detect Protein
Substructure Similarity. L. Paul Chew.
Travel Depth: A New Shape Descriptor for Macromolecules. Ryan G. Coleman,
Kim A. Sharp.
Unfolding Well-Separated Orthotrees. Mirela Damian, Robin Flatland, Henk
Meijer, and Joseph O'Rourke.
Bounded-velocity Approximations of the Mobile Euclidean 2-centre. Stephane
Durocher, David Kirkpatrick.
BSP Visibility on S2. John Fedorkiw, Sherif Ghali, and Todd Keeler.
Representing Topological Structures Using Cell-Chains. David E. Cardoze,
Gary L. Miller, Todd Phillips.
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted
Payoff Games are all LP-type Problems. Nir Halman.
How to Water Carrots: Geometric Coverage Problems for Point Sets. Helmut
Alt, Esther M. Arkin, Herve Bršonnimann, Jeff Erickson, SŽandor P. Fekete,
Christian Knauer, Jonathan Lenchnerk, Joseph S. B. Mitchell, Sue
Whitesides, Kim Whittlesey.
Opposite-quadrant depth in the plane. HervŽe Bršonnimann, JŽanos Pach.
Depth Explorer ? A Software Tool for Analysis of Depth Measures. J. Hugg,
E. Rafalin, D. L. Souvaine.
Bounding the Number of Plane Graphs. Oswin Aichholzer, Thomas Hackl,
Clemens Huemer, Ferran Hurtado, Hannes Krasser, Birgit Vogtenhuber.
Data Structures for Halfplane Proximity Queries and Incremental Voronoi
Diagrams. Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim
Gudmundsson, John Iacono, Stefan Langerman, Michiel Smid.
The Complexity of Diffuse Reflections in a Simple Polygon. Boris Aronov,
Alan R. Davis, John Iacono, Albert Siu Cheong Yu.
Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem. Jie
Gao, Michael Langberg, Leonard J. Schulman.
Efficient Algorithm for Approximating Maximum Inscribed Sphere in High
Dimensional Polytope. Yulai Xie and Jinhui Xu.
Local Overlaps in Unfoldings of Polyhedra. Anna Lubiw, Brendan Lucier.
On the Importance of Idempotence. Sunil Arya, Theocharis Malamatos, David
M. Mount.
Iterated Snap Rounding with Steiner Points. Eli Packer.
On Guarding and Partitioning Polygons. Yoav Amit, Joseph S. B. Mitchell,
Eli Packer.
An Experimental Study of Weighted k-Link Shortest Path Algorithms. Ovidiu
Daescu, Joseph S.B. Mitchell, Simeon Ntafos, James D. Palmer, Chee
K. Yap.
The Hunting of the Bump: On Maximizing Statistical Discrepancy. Deepak
Agarwal, Jeff M. Phillips, Suresh Venkatasubramanian.
Thick Non-crossing Paths. Joseph S. B. Mitchell, Valentin Polishchuk.
Dynamic Ham-Sandwich Cuts for Two Point Sets with Bounded
Convex-Hull-Peeling Depth. M. A. Burr, J. Hugg, E. Rafalin, K. Seyboth,
D. L. Souvaine.
Combinatorial and Algorithmic Applications of the Borsuk-Ulam
Theorem. Sambudda Roy, William Steiger.
Sublinear Projective Clustering with Outliers. Nina Mishra, Rajeev
Motwani, Sergei Vassilvitskii.
Path Length in Proximity Graphs as a Data Depth Measure. Kathryn Seyboth,
Eynat Rafalin, Diane Souvaine.
