BACK


Accepted Papers
  • Tomas Feder, Pavol Hell and Carlos Subi. "Distance-Two Coloring of Barnette Graphs"
  • Joseph O'Rourke. "Open Problems from CCCG 2017"
  • Ioana Bercea. "Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks"
  • Kazuyuki Amano and Shin-Ichi Nakano. "Away from Rivals"
  • Woojin Kim and Facundo Memoli. "Formigrams: Clustering Summaries of Dynamic Data"
  • Joseph O'Rourke and Emmely Rogers. "Threadable Curves"
  • Mahdi Imanparast, Seyed Naser Hashemi and Ali Mohades. "An efficient approximation for point-set diameter in higher dimensions"
  • Jayson Lynch and Kaiying Hou. "The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations"
  • Ali Gholami Rudi. "Looking for Bird Nests: Identifying Stay Points with Bounded Gaps"
  • Konstantinos Mastakas. "Uniform 2D-Monotone Minimum Spanning Graphs"
  • Mirela Damian and Robin Flatland. "Unfolding Low-Degree Orthotrees with Constant Refinement"
  • Robin Lynne Belton, Brittany Terese Fasy, Rostik Mertz, Samuel Micka, David L. Millman, Daniel Salinas, Anna Schenfisch, Jordan Schupbach and Lucia Williams. "Learning Simplicial Complexes from Persistence Diagrams"
  • Christopher Liaw, Paul Liu and Robert Reiss. "Approximation Schemes for Covering and Packing in the Streaming Model"
  • Wei-Yu Lai and Tien-Ruey Hsiang. "Continuous Terrain Guarding with Two-Sided Guards"
  • Joseph Masterjohn, Victor Milenkovic and Elisha Sacks. "Finding Intersections of Algebraic curves in a Convex Region using Encasement"
  • Chloe Arluck, Victor Milenkovic and Elisha Sacks. "Approximate Free Space Construction and Maximum Clearance Path Planning for a Four Degree of Freedom Robot"
  • Sepideh Aghamolaei and Mohammad Ghodsi. "A Composable Coreset for k-Center in Doubling Metrics"
  • Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng and Binhai Zhu. "Hitting a Set of Line Segments with One or Two Discrete Centers"
  • Logan Pedersen and Haitao Wang. "On the Coverage of Points in the Plane by Disks Centered at a Line"
  • Addison Allen and Aaron Williams. "Sto-Stone is NP-Complete"
  • Daniel Packer, Sophia White and Aaron Williams. "A Paperless Paper on Pencils: A Pencil and Paper Puzzle: Pencils is NP-Complete"
  • Arash Nouri, Anil Maheshwari and Jörg-Rüdiger Sack. "Time-Dependent Shortest Path Queries Among Growing Discs"
  • Jie Xue, Yuan Li and Ravi Janardan. "Approximate range closest-pair search"
  • Lutz Oettershagen and Petra Mutzel. "The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs"
  • Katsuhisa Yamanaka, Takashi Horiyama, Takeaki Uno and Kunihiro Wasa. "Ladder-Lottery Realization"
  • Therese Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla and Alexi Turcotte. "Integral Unit Bar-Visibility Graphs"
  • Martin Wilhelm. "On error representation in exact-decisions number types"
  • Ovidiu Daescu, Kyle Fox and Ka Yaw Teo. "Trajectory Planning for an Articulated Probe"
  • Bardia Hamedmohseni, Zahed Rahmati and Debajyoti Mondal. "Emanation Graph: A New t-Spanner"
  • Timothy Johnson and Michael T. Goodrich. "Low Ply Drawings of Trees and 2-Trees"
  • David Eppstein, Michael Goodrich, Jordan Jorgensen and Manuel Torres. "Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching"
  • Ahmad Biniaz and Alfredo Garcı́a. "Packing Plane Spanning Trees into a Point Set"
  • Ahmad Biniaz, Anil Maheshwari and Michiel Smid. "Compatible 4-Holes in Point Sets"
  • Takashi Horiyama, Masahiro Miyasaka and Riku Sasaki. "Isomorphism Elimination by Zero-Suppressed Binary Decision Diagrams"
  • Israel Aldana-Galván, Carlos Alegría-Galicia, José Luis Álvarez-Rebollar, Nestaly Marin-Nevárez, Erick Solís-Villarreal, Jorge Urrutia and Carlos Velarde. "Finding Minimum Witness Sets in Orthogonal Polygons"
  • Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Elena Khramtcova, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan and Csaba D. Toth. "Compatible Paths on Labelled Point Sets"
  • Erin Chambers, Tao Ju, David Letscher, Mao Li, Christopher Topp and Yajie Yan. "Some Heuristics for the Homological Simplification Problem"
  • Rasoul Shahsavarifar and David Bremner. "Approximate Data Depth Revisited"
  • Don Sheehy and Oliver Kisielius. "Computing the Shift-Invariant Bottleneck Distance for Persistence Diagrams"
  • Parasara Duggirala and Don Sheehy. "When Can We Treat Trajectories as Points?"
  • Luis Garcia, Andres Gutierrez, Isaac Ruiz and Andrew Winslow. "Vertex Unfoldings of Orthogonal Polyhedra: Positive, Negative, and Inconclusive Results"
  • Nina Amenta and Carlos Rojas. "Dihedral Rigidity and Deformation"
  • Rafael Cano, Cid de Souza and Pedro de Rezende. "Optimal Solutions for a Geometric Knapsack Problem using Integer Programming"
  • Vahideh Keikha, Maarten Löffler, Ali Mohades and Zahed Rahmati. "Width and Bounding Box of Imprecise Points"
  • Matthew P. Johnson. "Red-Blue-Partitioned Matching, MST, and TSP"
  • Jonathan Gabor and Aaron Williams. "Switches are PSPACE-Complete"