Abstract is missing.
- Near-Delaunay MetricsNathan van Beusekom, Kevin Buchin, Hidde Koerts, Wouter Meulemans, Benjamin Rodatz, Bettina Speckmann. 1-11
- Shortcut Hulls: Vertex-restricted Outer Simplications of PolygonsAnnika Bonerath, Jan-Henrik Haunert, Joseph S. B. Mitchell, Benjamin Niedermann. 12-23
- Stochastic Analysis of Empty-Region GraphsOlivier Devillers, Charles Duménil. 24-35
- Rearranging a Sequence of Points onto a LineTaehoon Ahn, Jongmin Choi, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Sang Duk Yoon. 36-46
- Mapping Points to the Grid with Bounded Hausdor DistanceMaarten Löffler, Jérôme Urhausen. 47-55
- Angles of Arc-Polygons and Lombardi Drawings of CactiDavid Eppstein, Daniel Frishberg, Martha C. Osegueda. 56-64
- Practical Methods for the Embroidery ProblemMichelle Tran. 65-71
- Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315Oswin Aichholzer. 72-77
- Generalized LR-Drawings of TreesTherese C. Biedl, Giuseppe Liotta, Jayson Lynch, Fabrizio Montecchiani. 78-88
- Massively Winning Congurations in the Convex Grabbing Game on the PlaneMartin Dvorak, Sara Nicholson. 89-96
- Yin-Yang Puzzles are NP-completeErik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno. 97-106
- Constant Delay Lattice Train SchedulesJean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Sasanka Roy, Lus Fernando Schultz Xavier da Silveira. 107-113
- Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together)Austin Barr, Calvin Chung, Aaron Williams. 114-125
- Flood Risk Analysis on TerrainsPankaj K. Agarwal. 126
- Automatically Testing Containedness between Geometric Graph Classes defined by Inclusion, Exclusion and Transfer AxiomsHannes Frey, Lucas Böltz. 127-138
- Algorithms for Covering Barrier Points by Mobile Sensors with Line ConstraintPrincy Jain, Haitao Wang. 139-148
- Approximability of (Simultaneous) Class Cover for BoxesJean Cardinal, Justin Dallant, John Iacono. 149-156
- Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-TheoremJustin Dallant, Patrick Schnider. 157-166
- Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in Moderate DimensionsPeyman Afshani, Rasmus Killmann. 167-174
- Decomposing Polygons into Fat ComponentsMaike Buchin, Leonie Selbach. 175-184
- Convex Bichromatic Quadrangulation of Point Sets with Minimum Color FlipsAllan Sapucaia, André A. Ciré, Pedro J. de Rezende, Cid C. de Souza. 185-194
- An Improved Kernel for the Flip Distance Problem on Simple Convex PolygonsMiguel Bosch Calvo, Steven Kelk. 195-199
- Minimum-Link Shortest Paths for Polygons amidst Rectilinear ObstaclesMincheol Kim, Hee-Kap Ahn. 200-210
- An Optimal Algorithm for L1 Shortest Paths in Unit-Disk GraphsHaitao Wang 0001, Yiming Zhao. 211-218
- Total Domination in Geometric Unit Disk GraphsSangram K. Jena, Gautam K. Das. 219-227
- Simple Linear Time Algorithms For Piercing Pairwise Intersecting DisksAhmad Biniaz, Prosenjit Bose, Yunkai Wang. 228-236
- Extensions of the Maximum Bichromatic Separating Rectangle ProblemBogdan Armaselu. 237-247
- Twisted Topological Tangles or: the Knot Theory of KnittingElisabetta A. Matsumoto. 248
- Axis-Aligned Square Contact RepresentationsAndrew Nathenson. 249-259
- Folding Polyiamonds into OctahedraEva Bolle, Linda Kleist. 260-270
- Folding Points to a Point and Lines to a LineHugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt 0001. 271-278
- Cut Locus Realizations on Convex PolyhedraJoseph O'Rourke, Costin Vîlcu. 279-285
- Unfolding a New Class of Orthographs of Arbitrary GenusMirela Damian, Robin Y. Flatland. 286-296
- Dispersion on IntervalsTetsuya Araki, Hiroyuki Miyata, Shin-Ichi Nakano. 297-302
- Approximation Algorithms for the Euclidean Dispersion ProblemsPawan K. Mishra, Gautam K. Das. 303-311
- The Discrete Median and Center Line Segment Problems in the PlaneOvidiu Daescu, Ka Yaw Teo. 312-319
- Oblivious Median Slope SelectionThore Thießen, Jan Vahrenhold. 320-331
- Any Regular Polyhedron Can Transform to Another by O(1) RefoldingsErik D. Demaine, Martin L. Demaine, Yevhenii Diomidov, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang. 332-342
- Edge-Unfolding Prismatoids: Tall or Rectangular BaseVincent Bian, Erik D. Demaine, Rachana Madhukara. 343-347
- On Guarding Polygons with HolesSharareh Alipour. 348-350
- An Acrophobic Guard Watchtower Problem on TerrainsRitesh Seth, Anil Maheshwari, Subhas C. Nandy. 351-361
- Constrained Obnoxious Facility Location on a Line SegmentVishwanath R. Singireddy, Manjanna Basappa. 362-367
- Succinct Euler-Tour TreesTravis Gagie, Sebastian Wild. 368-376
- Turning Around and Around: Motion Planning through Thick and Thin TurnstilesAster Greenblatt, Oscar Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow. 377-387
- Integer Cow-path Problem and Simple Robot Street SearchAzadeh Tabatabaei, Farehe Soheil, Mohammad Aletaha, Mohammad Ghodsi. 388-398