Optimal binary space partitions in the plane
From MaRDI portal
Publication:3578320
Recommendations
Cited in
(24)- Generalizing geometric graphs
- Additive approximation algorithm for geodesic centers in -hyperbolic graphs
- Minimizing corners in colored rectilinear grids
- 1-extendability of independent sets
- On the geometric red-blue set cover problem
- scientific article; zbMATH DE number 2115904 (Why is no real title available?)
- On the minimum eccentricity shortest path problem
- On complexity of total vertex cover on subcubic graphs
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete
- Linear planar 3-SAT
- On the optimal binary plane partition for sets of isothetic rectangles
- Computing realistic terrains from imprecise elevations
- 1-extendability of independent sets
- Complexity of solo chess with unlimited moves
- Range assignment of base-stations maximizing coverage area without interference
- scientific article; zbMATH DE number 7662168 (Why is no real title available?)
- Recognition complexity of subgraphs of \({\mathbf{k}}\)-connected planar cubic graphs
- Augmenting Geometric Graphs with Matchings
- Optimal binary space partitions for orthogonal objects
- Maximum centre-disjoint mergeable disks
- An algorithmic study of switch graphs
- Optimal binary space partitions for segments in the plane
- Perfect binary space partitions
This page was built for publication: Optimal binary space partitions in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578320)