Similar Items: Two Results on Outer-String Graphs
- The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
- Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
- A dynamic $(1+varepsilon)$-spanner for disk intersection graphs
- Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
- Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
- Conic locus of inversive Poncelet circumcenter and two points of invariant circle power