Let d be a positive integer. For a finite set X ⊆ℝ^d,
we define its inte...
We consider non-clairvoyant scheduling with online precedence constraint...
We solve the Bin Packing problem in O^*(2^k) time, where k is the number...
Makespan minimization on parallel identical machines is a classical and
...
An influential 1990 paper of Hochbaum and Shanthikumar made it common wi...
This paper considers parallel machine scheduling with incompatibilities
...
We consider ILPs, where each variable corresponds to an integral point w...
We consider fundamental algorithmic number theoretic problems and their
...
An important area of combinatorial optimization is the study of packing ...
Assigning jobs onto identical machines with the objective to minimize th...
We study an important case of ILPs {c^Tx Ax = b, l
≤ x ≤ u, x ∈Z^n t...