M. R. Garey
According to our database^{1}, M. R. Garey
Awards
ACM Fellow
ACM Fellow 1995, "For fundamental contributions to the theory of complexity and algorithms and for outstanding service to ACM.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at viaf.org

at id.loc.gov
On csauthors.net:
Bibliography
2002
Perfect Packing Theorems and the AverageCase Behavior of Optimal and Online Bin Packing.
SIAM Review, 2002
2000
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings.
SIAM J. Discrete Math., 2000
1993
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive TwoProcessor Scheduling.
J. ACM, 1993
1991
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive TwoProcessor Scheduling
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Fundamental Discrepancies between AverageCase Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
1989
The Complexity of Collapsing Reachability Graphs.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989
1988
Asymptotic results for partial concentrators.
IEEE Trans. Communications, 1988
On the Fractional Covering Number of Hypergraphs.
SIAM J. Discrete Math., 1988
OneProcessor Scheduling with Symmetric Earliness and Tardiness Penalties.
Math. Oper. Res., 1988
The complexity of searching a graph.
J. ACM, 1988
1987
Bin packing with divisible item sizes.
J. Complexity, 1987
1985
Composing Functions to Minimize Image Size.
SIAM J. Comput., 1985
Scheduling File Transfers.
SIAM J. Comput., 1985
Strongly connected orientations of mixed multigraphs.
Networks, 1985
A 71/60 theorem for bin packing.
J. Complexity, 1985
1984
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors.
IEEE Trans. Computers, 1984
Diameter bounds for altered graphs.
Journal of Graph Theory, 1984
1983
Dynamic Bin Packing.
SIAM J. Comput., 1983
Scheduling File Transfers in a Distributed Network.
Proceedings of the Second Annual ACM SIGACTSIGOPS Symposium on Principles of Distributed Computing, 1983
1982
The complexity of the generalized Lloyd  Max problem.
IEEE Trans. Information Theory, 1982
1981
Scheduling UnitTime Tasks with Arbitrary Release Times and Deadlines.
SIAM J. Comput., 1981
The Complexity of Searching a Graph (Preliminary Version)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1980
The Complexity of Coloring Circular Arcs and Chords.
SIAM J. Matrix Analysis Applications, 1980
Performance Bounds for LevelOriented TwoDimensional Packing Algorithms.
SIAM J. Comput., 1980
1979
Computers and Intractability: A Guide to the Theory of NPCompleteness.
W. H. Freeman, ISBN: 0716710447, 1979
1978
An Application of BinPacking to Multiprocessor Scheduling.
SIAM J. Comput., 1978
A note on bisecting minimum spanning trees.
Networks, 1978
"Strong" NPCompleteness Results: Motivation, Examples, and Implications.
J. ACM, 1978
A LinearTime Algorithm for Finding All Feedback Vertices.
Inf. Process. Lett., 1978
Triangulating a Simple Polygon.
Inf. Process. Lett., 1978
Performance Guarantees for Scheduling Algorithms.
Operations Research, 1978
The Complexity of Checkers on an N * N Board  Preliminary Report
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978
1977
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units.
IEEE Trans. Computers, 1977
TwoProcessor Scheduling with StartTimes and Deadlines.
SIAM J. Comput., 1977
The Rectilinear Steiner Tree Problem in NP Complete.
SIAM Journal of Applied Mathematics, 1977
Rectilinear steiner trees: Efficient specialcase algorithms.
Networks, 1977
Scheduling EqualLength Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness.
Math. Oper. Res., 1977
1976
Some Simplified NPComplete Graph Problems.
Theor. Comput. Sci., 1976
The Planar Hamiltonian Circuit Problem is NPComplete.
SIAM J. Comput., 1976
The Complexity of Flowshop and Jobshop Scheduling.
Math. Oper. Res., 1976
Resource Constrained Scheduling as Generalized Bin Packing.
J. Comb. Theory, Ser. A, 1976
Scheduling Tasks with Nonuniform Deadlines on Two Processors.
J. ACM, 1976
The Complexity of NearOptimal Graph Coloring.
J. ACM, 1976
On the distance matrix of a tree.
Discrete Mathematics, 1976
Computational aspects of deciding if all roots of a polynomial lie within the unit circle.
Computing, 1976
Some NPComplete Geometric Problems
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976
1975
Complexity Results for Multiprocessor Scheduling under Resource Constraints.
SIAM J. Comput., 1975
Bounds for Multiprocessor Scheduling with Resource Constraints.
SIAM J. Comput., 1975
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters.
J. ACM, 1975
An Application of Graph Coloring to Printed Circuit Testing (Working Paper)
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975
1974
WorstCase Performance Bounds for Simple OneDimensional Packing Algorithms.
SIAM J. Comput., 1974
Optimal Binary Search Trees with Restricted Maximal Depth.
SIAM J. Comput., 1974
Performance Bounds on the Splitting Algorithm for Binary Testing.
Acta Inf., 1974
Some Simplified NPComplete Problems
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974
1973
Optimal task sequencing with precedence constraints.
Discrete Mathematics, 1973
Bounds on Scheduling with Limited Resources.
Proceedings of the Fourth Symposium on Operating System Principles, 1973
1972
Simple Binary Identification Problems.
IEEE Trans. Computers, 1972
ResidentBubble Cellular Logic Using Magnetic Domains.
IEEE Trans. Computers, 1972
The Transitive Reduction of a Directed Graph.
SIAM J. Comput., 1972
WorstCase Analysis of Memory Allocation Algorithms
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972