M. R. Garey

51 papers A* 10Journal 39Unranked 1
YearRankTypeTitle / Venue / Authors
2000 J jnl
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings.
SIAM J. Discret. Math.
Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
1993 J jnl
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling.
J. ACM
Edward G. Coffman Jr., M. R. Garey
1991 A* conf
Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study
STOC
Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
1991 A* conf
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling
STOC
Edward G. Coffman Jr., M. R. Garey
1989 — conf
The Complexity of Collapsing Reachability Graphs.
Automatic Verification Methods for Finite State Systems
Sudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey
1988 J jnl
On the Fractional Covering Number of Hypergraphs.
SIAM J. Discret. Math.
Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham
1988 J jnl
The complexity of searching a graph.
J. ACM
Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
1987 J jnl
Bin packing with divisible item sizes.
J. Complex.
Edward G. Coffman Jr., M. R. Garey, David S. Johnson
1985 J jnl
A 71/60 theorem for bin packing.
J. Complex.
David S. Johnson, M. R. Garey
1985 J jnl
Composing Functions to Minimize Image Size.
SIAM J. Comput.
M. R. Garey, David S. Johnson
1985 J jnl
Scheduling File Transfers.
SIAM J. Comput.
Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
1984 J jnl
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.
IEEE Trans. Computers
Ashok K. Agrawala, Edward G. Coffman Jr., M. R. Garey, Satish K. Tripathi
1984 J jnl
Diameter bounds for altered graphs.
J. Graph Theory
F. R. K. Chung, M. R. Garey
1983 J jnl
Dynamic Bin Packing.
SIAM J. Comput.
Edward G. Coffman Jr., M. R. Garey, David S. Johnson
1983 A* conf
Scheduling File Transfers in a Distributed Network.
PODC
Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
1982 J jnl
The complexity of the generalized Lloyd - Max problem.
IEEE Trans. Inf. Theory
M. R. Garey, David S. Johnson, Hans S. Witsenhausen
1981 J jnl
Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines.
SIAM J. Comput.
M. R. Garey, David S. Johnson, Barbara B. Simons, Robert Endre Tarjan
1981 A* conf
The Complexity of Searching a Graph (Preliminary Version)
FOCS
Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
1980 J jnl
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms.
SIAM J. Comput.
Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan
1980 J jnl
The Complexity of Coloring Circular Arcs and Chords.
SIAM J. Algebraic Discret. Methods
M. R. Garey, David S. Johnson, Gerald L. Miller, Christos H. Papadimitriou
1979 — book
Computers and Intractability: A Guide to the Theory of NP-Completeness.
M. R. Garey, David S. Johnson
1978 J jnl
"Strong" NP-Completeness Results: Motivation, Examples, and Implications.
J. ACM
M. R. Garey, David S. Johnson
1978 J jnl
A Linear-Time Algorithm for Finding All Feedback Vertices.
Inf. Process. Lett.
M. R. Garey, Robert Endre Tarjan
1978 J jnl
A note on bisecting minimum spanning trees.
Networks
William M. Boyce, M. R. Garey, David S. Johnson
1978 J jnl
An Application of Bin-Packing to Multiprocessor Scheduling.
SIAM J. Comput.
Edward G. Coffman Jr., M. R. Garey, David S. Johnson
1978 J jnl
Performance Guarantees for Scheduling Algorithms.
Oper. Res.
M. R. Garey, Ronald L. Graham, David S. Johnson
1978 A* conf
The Complexity of Checkers on an N * N Board - Preliminary Report
FOCS
Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha
1978 J jnl
Triangulating a Simple Polygon.
Inf. Process. Lett.
M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan
1977 J jnl
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units.
IEEE Trans. Computers
M. R. Garey, Frank K. Hwang, David S. Johnson
1977 J jnl
The Rectilinear Steiner Tree Problem is NP Complete.
SIAM Journal of Applied Mathematics
M. R. Garey, David S. Johnson
1977 J jnl
Two-Processor Scheduling with Start-Times and Deadlines.
SIAM J. Comput.
M. R. Garey, David S. Johnson
1976 J jnl
Computational aspects of deciding if all roots of a polynomial lie within the unit circle.
Computing
Peter Gordon Anderson, M. R. Garey, Lee E. Heindel
1976 J jnl
On the distance matrix of a tree.
Discret. Math.
M. Edelberg, M. R. Garey, Ronald L. Graham
1976 J jnl
Resource Constrained Scheduling as Generalized Bin Packing.
J. Comb. Theory A
M. R. Garey, Ronald L. Graham, David S. Johnson, Andrew Chi-Chih Yao
1976 J jnl
Scheduling Tasks with Nonuniform Deadlines on Two Processors.
J. ACM
M. R. Garey, David S. Johnson
1976 A* conf
Some NP-Complete Geometric Problems
STOC
M. R. Garey, Ronald L. Graham, David S. Johnson
1976 J jnl
Some Simplified NP-Complete Graph Problems.
Theor. Comput. Sci.
M. R. Garey, David S. Johnson, Larry J. Stockmeyer
1976 J jnl
The Complexity of Near-Optimal Graph Coloring.
J. ACM
M. R. Garey, David S. Johnson
1976 J jnl
The Planar Hamiltonian Circuit Problem is NP-Complete.
SIAM J. Comput.
M. R. Garey, David S. Johnson, Robert Endre Tarjan
1975 A* conf
An Application of Graph Coloring to Printed Circuit Testing (Working Paper)
FOCS
M. R. Garey, David S. Johnson, Hing C. So
1975 J jnl
Bounds for Multiprocessor Scheduling with Resource Constraints.
SIAM J. Comput.
M. R. Garey, Ronald L. Graham
1975 J jnl
Complexity Results for Multiprocessor Scheduling under Resource Constraints.
SIAM J. Comput.
M. R. Garey, David S. Johnson
1975 J jnl
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters.
J. ACM
Yehoshua Perl, M. R. Garey, Shimon Even
1974 J jnl
Optimal Binary Search Trees with Restricted Maximal Depth.
SIAM J. Comput.
M. R. Garey
1974 J jnl
Performance Bounds on the Splitting Algorithm for Binary Testing.
Acta Informatica
M. R. Garey, Ronald L. Graham
1974 A* conf
Some Simplified NP-Complete Problems
STOC
M. R. Garey, David S. Johnson, Larry J. Stockmeyer
1974 J jnl
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms.
SIAM J. Comput.
David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham
1973 A* conf
Bounds on Scheduling with Limited Resources.
SOSP
M. R. Garey, Ronald L. Graham
1973 J jnl
Optimal task sequencing with precedence constraints.
Discret. Math.
M. R. Garey
1972 J jnl
The Transitive Reduction of a Directed Graph.
SIAM J. Comput.
Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman
1972 A* conf
Worst-Case Analysis of Memory Allocation Algorithms
STOC
M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman