1. J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, American Elsevier, New York, 1976.
2. E. L. Lawler and J. Labetoulle, On pre-emptive scheduling of unrelated parallel processors by linear programming,J. Assoc. Comput. Mach.,25 (1978), 612–619.
3. J. L. Lewandowski and C. L. Liu, SS/TDMA satellite communication withk-permutation switching modes, Preprint, Department of Computer Science, University of Illinois, Urbana, 1982.
4. C. L. Liu, L. Liu, and J. L. Lewandowski, An algorithmic proof of a generalization of the Birkhoff-von Neumann theorem, Preprint, Department of Computer Science, University of Illinois, Urbana, 1982.
5. G. Bongiovanni, D. Coppersmith, and C. K. Wong, An optimum time slot assignment algorithm for an SS/TDMA system with variable number of transponders,IEEE Trans. Comm.,29 (1981), 721–726.