## Computers and Intractability: A Guide to the Theory of NP-Completeness

- M. Garey, David S. Johnson
- Computer Science
- 1978

## Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran

- M. Garey, David S. Johnson
- Computer Science
- 1979

## Some Simplified NP-Complete Graph Problems

- M. Garey, David S. Johnson, L. Stockmeyer
- Mathematics, Computer ScienceTheoretical Computer Science
- 1 February 1976

## The Complexity of Flowshop and Jobshop Scheduling

- M. Garey, D. S. Johnson, R. Sethi
- Business, Computer ScienceMathematics of Operations Research
- 1 May 1976

## Crossing Number is NP-Complete

- M. Garey, David S. Johnson
- Computer Science, Mathematics
- 1 September 1983

## Approximation algorithms for bin packing: a survey

- E. Coffman, M. Garey, David S. Johnson
- Computer Science
- 1 August 1996

## The Rectilinear Steiner Tree Problem is NP Complete

- M. Garey, David S. Johnson
- MathematicsSIAM Journal of Applied Mathematics
- 1 June 1977

## Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

- David S. Johnson, A. Demers, J. Ullman, M. Garey, R. Graham
- Computer ScienceSIAM journal on computing (Print)
- 1 December 1974

## The Transitive Reduction of a Directed Graph

## Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

- E. Coffman, M. Garey, David S. Johnson, R. Tarjan
- Mathematics, Computer ScienceSIAM journal on computing (Print)
- 1 November 1980

...

1

2

3

4

5

...