Michael R. Garey
- Y. Perl, M. R. Garey, and S. Even. Efficient generation of optimal
prefix code: Equiprobable words using unequal cost letters.
Journal of the ACM, 22(2):202-214, April 1975.
Citations.
- M. R. Garey and D. S. Johnson. The complexity of near-optimal graph
coloring. Journal of the ACM, 23(1):43-49, January
1976.
Citations.
- M. R. Garey and D. S. Johnson. Scheduling tasks with nonuniform
deadlines on two processors. Journal of the ACM,
23(3):461-467, July 1976.
Citations.
- M. R. Garey and D. S. Johnson. ``Strong'' NP-completeness results:
Motivation, examples, and implications. Journal of the
ACM, 25(3):499-508, July 1978.
Citations.
- N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H.
Papadimitriou. The
complexity of searching a graph. Journal of the ACM,
35(1):18-44, January 1988.
Citations.
- E. G. Coffman, Jr. and M. R. Garey. Proof of the 4/3 conjecture for
preemptive vs. nonpreemptive two-processor scheduling. Journal
of the ACM, 40(5):991-1018, November 1993.
References
and Citations.
Shortcuts: