Abstract is missing.
- Graph Drawing via Layered PartitionsVida Dujmovic. 1
- Maintaining a Centerpoint in the Plane with Amortized Optimal Logarithmic InsertionsMorten Eskildsen, Matias Frank Jensen, Sebastian Kolby, Jesper Steensgaard. 2-8
- I/O Optimal Data Structures for Categorical Range Skyline QueriesDaniel Gibney, Sharma V. Thankachan, Arnab Ganguly 0002, Rahul Shah. 9-16
- Bipartite and Series-Parallel Graphs Without Planar Lombardi DrawingsDavid Eppstein. 17-22
- Three-Coloring Three-Dimensional Uniform HypergraphsAhmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne. 23-28
- Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent FormationsAlyxander Burns, Peter Klemperer, Jaemarie Solyst, Audrey St. John. 29-37
- Geometric Systems of Unbiased RepresentativesAritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval. 38-43
- Chirotopes of Random Points in Space are Realizable on a Small Integer GridJean Cardinal, Ruy Fabila Monroy, Carlos Hidalgo-Toscano. 44-48
- Coordinatizing Data With Lens Spaces and Persistent CohomologyLuis Polanco, Jose A. Perea. 49-58
- Computing Feasible Trajectories for an Articulated Probe in Three DimensionsOvidiu Daescu, Ka Yaw Teo. 59-70
- The Lighthouse Problem - Navigating by Lighthouses in Geometric DomainsBengt J. Nilsson, Pawel Zylinski. 71-77
- An Optimal Algorithm for Maintaining Connectivity of Wireless Network on a LineShimin Li, Zhongjiang Yan, Jingru Zhang. 78-84
- Unfolding PolyhedraJoseph O'Rourke. 85
- Guarantees on Nearest-Neighbor Condensation heuristicsAlejandro Flores-Velazco, David M. Mount. 87-93
- A Simple Randomized Algorithm for All Nearest NeighborsSoroush Ebadian, Hamid Zarrabi-Zadeh. 94-98
- Hardness results on Voronoi, Laguerre and Apollonius diagramsKevin Buchin, Pedro Machado Manhães de Castro, Olivier Devillers, Menelaos Karavelas. 99-104
- A Note on Guarding Staircase PolygonsMatt Gibson 0001, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski. 105-109
- Attraction-convexity and Normal VisibilityProsenjit Bose, Thomas C. Shermer. 110-116
- A MapReduce Algorithm for Metric Anonymity ProblemsSepideh Aghamolaei, Mohammad Ghodsi, Seyyedhamid Miri. 117-123
- Peeling Digital PotatoesLoïc Crombez, Guilherme Dias da Fonseca, Yan Gerard. 124-132
- Largest Triangle inside a TerrainArun Kumar Das, Sandip Das 0001, Joydeep Mukherjee. 133-138
- Reconstructing a Polyhedron between Polygons in Parallel SlicesTherese C. Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen Merkel, Anurag Murty Naredla. 139-145
- On Multi-Dimensional Team FormationThomas Schibler, Ambuj Singh, Subhash Suri. 146-152
- Simple Fold and Cut Problem for Line SegmentsGuoxin Hu, Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno. 153-158
- Rectangular Unfoldings of PolycubesMartin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara. 159-163
- Folding Polyominoes with Holes into a CubeOswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt 0001. 164-170
- Minimum Forcing Sets for Single-Vertex Crease PatternKoji Ouchi, Ryuhei Uehara. 171-176
- Ecient Segment Folding is HardTakashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka. 177-183
- Nurimisaki and Sashigane are NP-completeChuzo Iwamoto, Tatsuya Ide. 184-194
- Constrained Orthogonal Segment StabbingSayan Bandyapadhyay, Saeed Mehrabi 0001. 195-202
- Watchtower for k-crossing VisibilityYeganeh Bahoo, Prosenjit Bose, Stephane Durocher. 203-209
- Rock Climber Distance: Frogs versus DogsHugo Alves Akitaya, Leonie Ryvkin, Csaba D. Tóth. 210-217
- Discrete Planar Map MatchingBin Fu, Robert T. Schweller, Tim Wylie. 218-224
- ETH-Tight Algorithms for Geometric Network Problems Using Geometric SeparatorsMark de Berg. 225
- Minimum Ply Covering of Points with Disks and SquaresTherese C. Biedl, Ahmad Biniaz, Anna Lubiw. 226-235
- Distributed Unit ClusteringKian Mirjalali, Seyed Ali Tabatabaee, Hamid Zarrabi-Zadeh. 236-241
- Local Search for Geometric Partial Covering ProblemsTanmay Inamdar 0002. 242-249
- Ane invariant triangulationsProsenjit Bose, Pilar Cano, Rodrigo I. Silveira. 250-256
- Flipping in SpiralsSander Verdonschot. 257-262
- Graph Realization on a Random EmbeddingSaad Quader, Alexander Russell. 263-274
- The extrinsic nature of the Hausdor distance of optimal triangulations of manifoldsMathijs Wintraecken, Gert Vegter. 275-279