Abstract is missing.
- Optimally Tracking Labels on an Evolving TreeAditya Acharya, David M. Mount. 1-8
- Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between PolyhedraElena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara. 9-23
- Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern MatchingRobert D. Barish, Tetsuo Shibuya. 16-31
- Optimally Confining Lattice PolymersGill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel. 24-15
- Efficiently Enumerating Scaled Copies of Point Set PatternsAya Bernstine, Yehonatan Mizrahi. 32-39
- A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular ArithmeticBinay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari. 40-47
- Drawing complete outer-1-planar graphs in linear areaTherese Biedl. 48-54
- A 13/9-approximation of the average-2p/3-MSTAhmad Biniaz, Prosenjit Bose, Patrick Devaney. 55-59
- Weighted shortest path in equilateral triangular meshesProsenjit Bose, Guillermo Esteban, Anil Maheshwari. 60-67
- Maximum Subbarcode Matching and Subbarcode DistanceOliver A. Chubet. 68-74
- Approximating Convex Polygons by HistogonsJaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn. 75-82
- dOvidiu Daescu, Ka Yaw Teo. 83-90
- The Median Line Segment Problem: Computational Complexity and Constrained VariantsOvidiu Daescu, Ka Yaw Teo. 91-97
- Computational Complexity of Flattening Fixed-Angle Orthogonal ChainsErik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara. 98-104
- A bound for Delaunay flip algorithms on flat tori (Best Student Paper Award)Loïc Dubois. 105-112
- Computing Batched Depth Queries and the Depth of a Set of PointsStephane Durocher, Alexandre Leblanc, Sachini Rajapakse. 113-120
- Curve Stabbing Depth: Data Depth for Plane CurvesStephane Durocher, Spencer Szabados. 121-128
- Reflections in an Octagonal Mirror MazeDavid Eppstein. 129-134
- Locked and Unlocked Smooth Embeddings of SurfacesDavid Eppstein. 135-142
- Orthogonal Dissection into Few RectanglesDavid Eppstein. 143-150
- Minimum Enclosing Spherical/Cylindrical Shells in High-Dimensional StreamsMohammad Javad Eslamibidgoli, Hamid Zarrabi-Zadeh. 151-155
- On the Geometry of Stable Steiner Tree InstancesJames Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin. 156-161
- Globally linked pairs in braced maximal outerplanar graphsDániel Garamvölgyi, Tibor Jordán. 162-168
- Unstacking Slabs Safely in Megalit is NP-HardKirby Gordon, Jacob Lezberg, Aaron Williams. 169-176
- Computational Complexity of One-Dimensional Origami and Its Application to Digital SignatureJunnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara. 177-183
- Quantitative Helly-type Hypergraph ChainsAttila Jung. 184-188
- Online Square Packing with RotationShahin Kamali, Pooya Nikbakht. 189-197
- A Randomized Algorithm for Non-crossing Matching of Online PointsShahin Kamali, Pooya Nikbakht, Arezoo Sajadpour. 198-204
- Burning Number for the Points in the PlaneJ. Mark Keil, Debajyoti Mondal, Ehsan Moradi. 205-211
- Uniformly Monotone Partitioning of Polygons RevisitedHwi Kim, Jaegun Lee, Hee-Kap Ahn. 212-218
- Opposing Half GuardsErik Krohn, Bengt J. Nilsson, Christiane Schmidt 0001. 219-226
- Computing Realistic Terrains from Imprecise ElevationsAnna Lubiw, Graeme Stroud. 227-234
- Efficient Predicate Evaluation using Statistical Degeneracy DetectionVictor Milenkovic, Elisha Sacks. 235-242
- Unfolding Some Classes of One-Layer PolycubesJosef Minarík. 243-248
- Diverse Non Crossing MatchingsNeeldhara Misra, Harshil Mittal, Saraswati Nanoti. 249-256
- Maximum Weight Convex PolytopeAli Mohammad Lavasani, Denis Pankratov, Mohammad Ali Abam. 257-263
- High-Dimensional Axis-Aligned Bounding Box with OutliersAli Mostafavi, Ali Hamzeh. 264-269
- Quasi-Twisting Convex PolyhedraJoseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec. 270-276
- ZHED is NP-completeSagnik Saha, Erik D. Demaine. 277-283
- Efficient Graph Reconstruction and Representation Using Augmented Persistence DiagramsAnna Schenfisch, Brittany Terese Fasy, Samuel Micka, David L. Millman, Lucia Williams. 284-292
- On the Biplanar and k-Planar Crossing NumbersAlireza Shavali, Hamid Zarrabi-Zadeh. 293-297
- A Constant Time Algorithm for Solving Simple Rolling Cube MazesRandal Tuggle, Davis Murphy, Nicholas Lorch. 298-305
- A Theory of Spherical DiagramsGiovanni Viglietta. 306-313
- Using Existential Theory of the Reals to Bound VC DimensionAustin Watkins, Jeff M. Phillips. 314-321
- Budgeted Steiner Networks: Three Terminals with Equal Path WeightsJingjin Yu, Mario Szegedy. 322-329