Given a set B of d-dimensional boxes (i.e., axis-aligned hyperrectangles), a minimum coverage kernel is a subset of B of minimum size covering the same region as B. Computing it is NP-hard, but as for many similar NP-hard ...

We show that a set of small box counting dimension can be covered by a H¨older graph from all but a small set of directions, and give sharp bounds for the dimension of the exceptional set, improving a result of B. Hunt and ...

Given a finite set of weighted points in Rd (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is ...

Given disjoint finite point sets R and B in the plane, where the elements of R are colored red and the elements of B are colored blue, the maximum box problem asks for an axis-aligned rectangle (i.e. box) containing the ...

The study of the interactions between multidimensional boxes (i.e., axis aligned d-dimensional hyperrectangles) has found important applications in distinct areas, including computational geometry, databases, graph theory ...

We provide bounds on the upper box-counting dimension of negatively invariant subsets of Banach spaces, a problem that is easily reduced to covering the image of the unit ball under a linear map by a collection of balls ...