On the asymptotic worst case behavior of harmonic fit

Tight Bounds for Online Class-Constrained Packing

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics

Removable Online Knapsack Problems

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

Optimal online bounded space multidimensional packing

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Windows scheduling as a restricted version of Bin Packing

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Tight bounds for online class-constrained packing

Theoretical Computer Science - Latin American theorotical informatics

Windows scheduling as a restricted version of bin packing

ACM Transactions on Algorithms (TALG)

Bin-packing with fragile objects and frequency allocation in cellular networks

Wireless Networks