We give a polynomial-time constant-factor approximation algorithm for the maximum
independent set of (axis-aligned) rectangles problem in the plane. Using a polynomial-time …

We study the d-dimensional hypercube knapsack problem where we are given a set of d-
dimensional hypercubes with associated profits, and a knapsack which is a unit d …

In the Unsplittable Flow on a Path problem (UFP) we are given a path with edge capacities,
and a set of tasks where each task is characterized by a subpath, a demand, and a weight …

We consider the problem of maintaining an approximate maximum independent set of
geometric objects under insertions and deletions. We present data structures that maintain a …

We prove that for any triangle-free intersection graph of $ n $ axis-parallel segments in the
plane, the independence number $\alpha $ of this graph is at least $\alpha\ge n/4+\Omega …

We study the generalized multidimensional bin packing problem (GVBP) that generalizes
both geometric packing and vector packing. Here, we are given $ n $ rectangular items …

Geometric intersection graphs are graphs arising from families of geometric objects in the
plane (and, more generally, in R^ d). This class has captured the attention of many …

In the Strip Packing problem (SP), we are given a vertical half-strip $[0, W]\times [0,\infty) $
and a set of $ n $ axis-aligned rectangles of width at most $ W $. The goal is to find a non …

In the Maximum Independent Set of Hyperrectangles problem, we are given a set of $ n
$(possibly overlapping) $ d $-dimensional axis-aligned hyperrectangles, and the goal is to …

Abstract Kovaleva and Spieksma (SIAM J Discrete Math 20 (3): 48–768, 2006) considered
the problem of stabbing a given set of horizontal line segments with the smallest number of …