We study the Maximum Independent Set of Rectangles (MISR) problem, where we are given
a set of axis-parallel rectangles in the plane and the goal is to select a subset of non …

We study the fair allocation of indivisible goods among agents with identical, additive
valuations but individual budget constraints. Here, the indivisible goods--each with a specific …

Abstract In the Strip Packing problem, we are given a vertical half-strip [0, W]×[0,+∞) and a
collection of open rectangles of width at most W. Our goal is to find an axis-aligned (non …

We study the geometric knapsack problem in which we are given a set of $ d $-dimensional
objects (each with associated profits) and the goal is to find the maximum profit subset that …

An important goal in algorithm design is determining the best running time for solving a
problem (approximately). For some problems, we know the optimal running time, assuming …

Abstract We consider the Demand Strip Packing problem (DSP), in which we are given a set
of jobs, each specified by a processing time and a demand. The task is to schedule all jobs …

We study a covering problem motivated by spatial models in crowdsourcing markets, where
tasks are ordered according to some geographic or temporal criterion. Assuming that each …

We develop a general framework, called approximately-diverse dynamic programming
(ADDP) that can be used to generate a collection of $ k\ge2 $ maximally diverse solutions to …