1. M. Ajtai, J. Komlós, and G. Tusnády. On optimal matching. Combinatorica, 4:259–264, 1984.
2. N. Alon any Y. Azar, J. Csirik, L. Epstein, S. V. Sevastianov, A. P. A. Vestjens, and G. J. Woeginger. On-line and off-line approximation algorithms for vector covering problems. In Proc. 4th European Symposium on Algorithms, LNCS, pages 406–418. Springer, 1996. To appear in Algorithmica.
3. S. F. Assmann. Problems in Discrete Applied Mathematics. PhD thesis, MIT, Cambridge, MA, 1983.
4. S. F. Assmann, D. S. Johnson, D. J. Kleitman, and J. Y. T. Leung. On a dual version of the one-dimensional bin packing problem. J. Algorithms, 5:502–525, 1984.
5. Y. Azar and L. Epstein. On two dimensional packing. In Proc. 5th Scand. Workshop Alg. Theor., LNCS, pages 321–332. Springer, 1996.