Abstract is missing.
- Geometric Problems and Structures Arising from the Study of Wireless NetworksMatthew J. Katz. 1 [doi]
- Low Ply Drawings of Trees and 2-TreesMichael T. Goodrich, Timothy Johnson. 2-10 [doi]
- The Crossing Number of Semi-Pair-Shellable Drawings of Complete GraphsPetra Mutzel, Lutz Oettershagen. 11-17 [doi]
- Learning Simplicial Complexes from Persistence DiagramsRobin Lynne Belton, Brittany Terese Fasy, Rostik Mertz, Samuel Micka, David L. Millman, Daniel Salinas, Anna Schenfisch, Jordan Schupbach, Lucia Williams. 18-27 [doi]
- Sto-Stone is NP-CompleteAddison Allen, Aaron Williams. 28-34 [doi]
- A Paper on Pencils: A Pencil and Paper Puzzle - Pencils is NP-CompleteDaniel Packer, Sophia White, Aaron Williams. 35-41 [doi]
- Switches are PSPACE-CompleteJonathan Gabor, Aaron Williams. 42-48 [doi]
- Packing Plane Spanning Trees into a Point SetAhmad Biniaz, Alfredo García. 49-53 [doi]
- Compatible Paths on Labelled Point SetsElena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth. 54-60 [doi]
- Ladder-Lottery RealizationKatsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno, Kunihiro Wasa. 61-67 [doi]
- Away from RivalsKazuyuki Amano, Shin-Ichi Nakano. 68-71 [doi]
- An Efficient Approximation for Point-set Diameter in Higher DimensionsMahdi Imanparast, Seyed Naser Hashemi, Ali Mohades. 72-77 [doi]
- Computing the Shift-Invariant Bottleneck Distance for Persistence DiagramsDon Sheehy, Oliver Kisielius, Nicholas J. Cavanna. 78-84 [doi]
- Hitting a Set of Line Segments with One or Two Discrete CentersXiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu. 85-90 [doi]
- Finding Intersections of Algebraic curves in a Convex Region using EncasementJoseph Masterjohn, Victor Milenkovic, Elisha Sacks. 91-97 [doi]
- Geometric Fingerprint Recognition via Oriented Point-Set Pattern MatchingDavid Eppstein, Michael T. Goodrich, Jordan Jorgensen, Manuel R. Torres. 98-113 [doi]
- The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular TessellationsKaiying Hou, Jayson Lynch. 114-128 [doi]
- Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform DisksIoana Orianna Bercea. 129-141 [doi]
- Width and Bounding Box of Imprecise PointsVahideh Keikha, Maarten Löffler, Ali Mohades, Zahed Rahmati. 142-148 [doi]
- Open Problems from CCCG 2017Joseph O'Rourke. 149-154 [doi]
- On Map Construction, Map Comparison, and Trajectory ClusteringCarola Wenk. 155-157 [doi]
- On the Coverage of Points in the Plane by Disks Centered at a LineLogan Pedersen, Haitao Wang. 158-164 [doi]
- A Composable Coreset for k-Center in Doubling MetricsSepideh Aghamolaei, Mohammad Ghodsi. 165-171 [doi]
- Approximation Schemes for Covering and Packing in the Streaming ModelChristopher Liaw, Paul Liu, Robert Reiss. 172-179 [doi]
- Formigrams: Clustering Summaries of Dynamic DataWoojin Kim, Facundo Mémoli. 180-188 [doi]
- Unfolding Low-Degree Orthotrees with Constant RefinementMirela Damian, Robin Y. Flatland. 189-208 [doi]
- Dihedral Rigidity and DeformationNina Amenta, Carlos Rojas. 209-216 [doi]
- Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive ResultsLuis Garcia, Andres Gutierrez, Isaac Ruiz, Andrew Winslow. 217-222 [doi]
- Approximate Free Space Construction and Maximum Clearance Path Planning for a Four Degree of Freedom RobotChloe Arluck, Victor Milenkovic, Elisha Sacks. 223-229 [doi]
- Integral Unit Bar-Visibility GraphsTherese C. Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte. 230-246 [doi]
- Continuous Terrain Guarding with Two-Sided GuardsWei-Yu Lai, Tien-Ruey Hsiang. 247-252 [doi]
- Finding Minimum Witness Sets in Orthogonal PolygonsIsrael Aldana-Galvan, Carlos Alegría-Galicia, Jose Luis Alvarez-Rebollar, Nestaly Marín-Nevárez, Erick Solís-Villareal, Jorge Urrutia, Carlos Velarde. 253-258 [doi]
- Red-Blue-Partitioned MST, TSP, and MatchingMatthew P. Johnson. 259-264 [doi]
- Optimal Solutions for a Geometric Knapsack Problem using Integer ProgrammingRafael G. Cano, Cid C. de Souza, Pedro J. de Rezende. 265-271 [doi]
- Approximate Data Depth RevisitedDavid Bremner, Rasoul Shahsavarifar. 272-281 [doi]
- Approximate Range Closest-Pair SearchJie Xue, Yuan Li, Ravi Janardan. 282-287 [doi]
- Time-Dependent Shortest Path Queries Among Growing DiscsAnil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack. 288-295 [doi]
- Trajectory Planning for an Articulated ProbeOvidiu Daescu, Kyle Fox, Ka Yaw Teo. 296-303 [doi]
- Distance-Two Coloring of Barnette GraphsTomás Feder, Pavol Hell, Carlos S. Subi. 304-310 [doi]
- Emanation Graph: A New t-SpannerBardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal. 311-317 [doi]
- Uniform 2D-Monotone Minimum Spanning GraphsKonstantinos Mastakas. 318-325 [doi]
- On Nonogram and Graph Planarity Puzzle GenerationMarc J. van Kreveld. 326-327 [doi]
- Threadable CurvesJoseph O'Rourke, Emmely Rogers. 328-333 [doi]
- Looking for Bird Nests: Identifying Stay Points with Bounded GapsAli Gholami Rudi. 334-339 [doi]
- When Can We Treat Trajectories as Points?Parasara Duggirala, Donolad R. Sheehy. 340-345 [doi]
- Compatible 4-Holes in Point SetsAhmad Biniaz, Anil Maheshwari, Michiel H. M. Smid. 346-352 [doi]
- Some Heuristics for the Homological Simplification ProblemErin W. Chambers, Tao Ju, David Letscher, Mao Li, Christopher N. Topp, Yajie Yan. 353-359 [doi]
- Isomorphism Elimination by Zero-Suppressed Binary Decision DiagramsTakashi Horiyama, Masahiro Miyasaka, Riku Sasaki. 360-366 [doi]
- On Error Representation in Exact-Decisions Number TypesMartin Wilhelm. 367-373 [doi]