Covering boxes by points
From MaRDI portal
Recommendations
Cites work
Cited in
(27)- On point covers of \(c-\)oriented polygons
- Piercing all translates of a set of axis-parallel rectangles
- Covering the 3-dimensional unit cube by six rectangular boxes
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- Transversal numbers of translates of a convex body
- Coloring the complements of intersection graphs of geometric figures
- Enclosing many boxes by an optimal pair of boxes
- On Wegner's inequality for axis-parallel rectangles
- Gallai-type results for multiple boxes and forests
- Piercing all translates of a set of axis-parallel rectangles
- From a \((p,2)\)-theorem to a tight \((p,q)\)-theorem
- Stabbing boxes with finitely many axis-parallel lines and flats
- Fast stabbing of boxes in high dimensions
- Intersection of parallelepipeds in \(\mathbb R^d\)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
- From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem
- Construction of minimal bracketing covers for rectangles
- On point covers of multiple intervals and axis-parallel rectangles
- How many atoms can be defined by boxes ?
- Separating pairs of points of standard boxes
- Containment problems in high-dimensional spaces
- Covering a set of points by two axis-parallel boxes
- An extremal problem of orthants containing at most one point besides the origin
- Covering the \(d\)-dimensional unit cube by \(n\) rectangular boxes of smaller diameter
- Piercing axis-parallel boxes
- Piercing translates and homothets of a convex body
- Lower bounds for piercing and coloring boxes
This page was built for publication: Covering boxes by points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687139)
