Similar Items: Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
- Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
- A dynamic $(1+varepsilon)$-spanner for disk intersection graphs
- Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
- Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)
- Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
- Computing Planar Convex Hulls with a Promise