Abstract is missing.
- Forbidden Configurations in Discrete GeometryDavid Eppstein. 1
- Power Domination on Triangular GridsProsenjit Bose, Claire Pennarun, Sander Verdonschot. 2-6
- Monochromatic Plane Matchings in Bicolored Point SetA. Karim Abu-Affash, Sujoy Bhore, Paz Carmi. 7-12
- Bottleneck Bichromatic Full Steiner TreesA. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty. 13-18
- Exploring Increasing-Chord Paths and TreesYeganeh Bahoo, Stephane Durocher, Sahar Mehrpour, Debajyoti Mondal. 19-24
- Angle-monotone Paths in Non-obtuse TriangulationsAnna Lubiw, Joseph O'Rourke. 25-30
- A General Algorithm for the Maximum Span of Fixed-Angle ChainsDavid Goering, Ronald Gentle. 31-36
- Covering Points: Minimizing the Maximum DepthSubhas C. Nandy, Supantha Pandit, Sasanka Roy. 37-42
- On the Planar Spherical Depth and Lens DepthDavid Bremner, Rasoul Shahsavarifar. 43-49
- Minimum Enclosing Circle Problem with Base PointBinay Bhattacharya, Lily Li. 50-55
- Snipperclips: Cutting Tools into Desired Polygons using ThemselvesErik D. Demaine, Matias Korman, André van Renssen, Marcel Roeloffzen. 56-61
- Rep-cubes: Unfolding and Dissection of CubesDawei Xu, Takashi Horiyama, Ryuhei Uehara. 62-67
- On the Shortest Separating CycleAdrian Dumitrescu. 68-72
- Open Problems from CCCG 2016Joseph O'Rourke. 73-76
- Burning the Medial AxisErin Wolf Chambers. 77
- The Most-Likely Skyline Problem for Stochastic PointsAkash Agrawal, Yuan Li, Jie Xue, Ravi Janardan. 78-83
- Visibility Testing and Counting for Uncertain SegmentsMohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian. 84-88
- Nearest-Neighbor Search Under UncertaintyBoris Aronov, John Iacono, Khadijeh Sheikhan. 89-94
- A Seed Placement Strategy for Conforming Voronoi MeshingAhmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Scott A. Mitchell. 95-100
- On Compatible Triangulations with a Minimum Number of Steiner PointsAnna Lubiw, Debajyoti Mondal. 101-106
- Planarity Preserving Augmentation of Topological and Geometric Plane Graphs to Meet Parity ConstraintsIsrael Aldana-Galvan, Jose Luis Alvarez-Rebollar, Juan C. Catana-Salazar, Erick Solis-Villareal, Jorge Urrutia, C. Velarde. 107-112
- Interference Minimization in k-Connected Wireless NetworksStephane Durocher, Sahar Mehrpour. 113-119
- Optimal Orientation of Symmetric Directional Antennas on a LineAmirMahdi Ahmadinejad, Fatemeh Baharifard, Khadijeh Sheikhan, Hamid Zarrabi-Zadeh. 120-125
- Range Assignment of Base-Stations Maximizing Coverage Area without InterferenceAnkush Acharyya, Minati De, Subhas C. Nandy. 126-131
- Nonoverlapping Grid-aligned Rectangle Placement for High Value AreasStephen Rowe, Christopher G. Valicka, Scott A. Mitchell, Simon X. Zou. 132-137
- Packing Boundary-Anchored RectanglesTherese C. Biedl, Ahmad Biniaz, Anil Maheshwari, Saeed Mehrabi 0001. 138-143
- Dominating Set of Rectangles Intersecting a Straight LineSupantha Pandit. 144-149
- On Guarding Orthogonal Polygons with Bounded TreewidthTherese C. Biedl, Saeed Mehrabi 0001. 150-155
- Beacon Coverage in Orthogonal PolyhedraIsrael Aldana-Galvan, Jose Luis Alvarez-Rebollar, Juan C. Catana-Salazar, N. Marín-Nevárez, Erick Solís-Villareal, Jorge Urrutia, C. Velarde. 156-161
- : Discrete Surveillance Tours in Polygonal DomainsElmar Langetepe, Bengt J. Nilsson, Eli Packer. 162-167
- Guarding Monotone Polygons with Half-GuardsMatt Gibson, Erik Krohn, Matthew Rayford. 168-173
- Sharing a Pizza: Bisecting Masses with Two CutsLuis Barba, Patrick Schnider. 174-178
- Balanced k-Center Clustering When k Is A ConstantHu Ding. 179-184
- 2D Closest Pair Problem: A Closer LookOvidiu Daescu, Ka Yaw Teo. 185-190
- Supporting Ruled PolygonsNicholas J. Cavanna, Marc Khoury, Donald R. Sheehy. 191-196
- Tilers, Tilemakers, Transformers!Stefan Langerman. 197
- A Problem on Track RunnersAdrian Dumitrescu, Csaba D. Tóth. 198-201
- Common Development of Prisms, Anti-Prisms, Tetrahedra, and WedgesAmartya Shankha Biswas, Erik D. Demaine. 202-207
- Computing 3SAT on a Fold-and-Cut MachineByoungkwon An, Erik D. Demaine, Martin L. Demaine, Jason S. Ku. 208-213
- Data Structures for Fréchet Queries in Trajectory DataMark de Berg, Ali D. Mehrabi, Tim Ophelders. 214-219
- Discretized Approaches to SchematizationMaarten Löffler, Wouter Meulemans. 220-225
- On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectanglesNirman Kumar. 226-231
- Upward Order-Preserving 8-Grid-Drawings of Binary TreesTherese C. Biedl. 232-237