The complexity of searching a graph von MEGIDDO, N, HAKIMI, S. L, GAREY, M. R, JOHNSON, D. S, PAPADIMITRIOU, C. H

Volltext

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing von Coffman, E. G., Courcoubetis, C., Garey, M. R., Johnson, D. S., Shor, P. W., Weber, R. R., Yannakakis, M.

Volltext

Crossing Number is NP-Complete von Garey, M. R, Johnson, D. S

Volltext

Bin packing with discrete item sizes, part I: Perfect packing theorems and the average case behavior of optimal packings von COFFMAN, E. G, COURCOUBETIS, C, GAREY, M. R, JOHNSON, D. S, SHORE, P. W, WEBER, R. R, YANNAKAKIS, M

Volltext

The Rectilinear Steiner Tree Problem is NP-Complete von Garey, M. R., Johnson, D. S.

Volltext

The Complexity of Flowshop and Jobshop Scheduling von Garey, M. R, Johnson, D. S, Sethi, Ravi

Volltext

The Complexity of Computing Steiner Minimal Trees von Garey, M. R., Graham, R. L., Johnson, D. S.

Volltext

The Complexity of Coloring Circular Arcs and Chords von Garey, M. R, Johnson, D. S, Miller, G. L, Papadimitriou, C. H

Volltext

Scheduling file transfers von COFFMAN, E. G. JR, GAREY, M. R, JOHNSON, D. S, LAPAUGH, A. S

Volltext

The Complexity of Near-Optimal Graph Coloring von Garey, M R, Johnson, D S

Volltext

Diameter bounds for altered graphs von Chung, F. R. K., Garey, M. R.

Volltext

One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties von Garey, Michael R, Tarjan, Robert E, Wilfong, Gordon T

Volltext

An Application of Bin-Packing to Multiprocessor Scheduling von Coffman, Jr, E. G., Garey, M. R., Johnson, D. S.

Volltext

On Packing Two-Dimensional Bins von Chung, F. R. K, Garey, M. R, Johnson, D. S

Volltext

Dynamic Bin Packing von Coffman, Jr, E. G., Garey, M. R., Johnson, D. S.

Volltext

Performance Guarantees for Scheduling Algorithms von Garey, M. R, Graham, R. L, Johnson, D. S

Volltext

Complexity Results for Bandwidth Minimization von Garey, M. R., Graham, R. L., Johnson, D. S., Knuth, D. E.

Volltext

Optimal Binary Identification Procedures von Garey, M. R.

Volltext

Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines von Garey, M. R., Johnson, D. S., Simons, B. B., Tarjan, R. E.

Volltext

Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness von Brucker, Peter, Garey, M. R, Johnson, D. S

Volltext