Computational Geometry

All Items

• A Note on Reachability and Distance Oracles for Transmission Graphs

  Mark de Berg

  4:1-4:15

• A SAT Attack on Erdős-Szekeres Numbers in R^d and the Empty Hexagon Theorem

  Manfred Scheucher

  2:1-2:13

• Subtrajectory Clustering: Finding Set Covers for Set Systems of Subcurves

  Frederik Brüning, Hugo Akitaya, Erin Chambers, Anne Driemel

  1:1-1:48

• The Complexity of Sharing a Pizza

  Patrick Schnider

  4:1-4:19

• Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem

  Justin Dallant, Patrick Schnider

  5:1-5:27

• Approximating Bottleneck Spanning Trees on Partitioned Tuples of Points

  Ahmad Biniaz, Anil Maheshwari, Michiel Smid

  3:1-3:18

• Obstructing Classification via Projection

  Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek

  2:1-2:21