dblp.uni-trier.dewww.uni-trier.de

M. R. Garey Vis

Michael R. Garey

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2000
45EEEdward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis: Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. SIAM J. Discrete Math. 13(3): 384-402 (2000)
1993
44EEEdward G. Coffman Jr., M. R. Garey: Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. J. ACM 40(5): 991-1018 (1993)
1991
43 Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis: Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study STOC 1991: 230-240
42 Edward G. Coffman Jr., M. R. Garey: Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling STOC 1991: 241-248
1989
41EESudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey: The Complexity of Collapsing Reachability Graphs. Automatic Verification Methods for Finite State Systems 1989: 264-274
1988
40EENimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou: The complexity of searching a graph. J. ACM 35(1): 18-44 (1988)
39 Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham: On the Fractional Covering Number of Hypergraphs. SIAM J. Discrete Math. 1(1): 45-49 (1988)
1987
38EEEdward G. Coffman Jr., M. R. Garey, David S. Johnson: Bin packing with divisible item sizes. J. Complexity 3(4): 406-428 (1987)
1985
37EEDavid S. Johnson, M. R. Garey: A 71/60 theorem for bin packing. J. Complexity 1(1): 65-106 (1985)
36 M. R. Garey, David S. Johnson: Composing Functions to Minimize Image Size. SIAM J. Comput. 14(2): 500-503 (1985)
35 Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh: Scheduling File Transfers. SIAM J. Comput. 14(4): 743-780 (1985)
1984
34 Ashok K. Agrawala, Edward G. Coffman Jr., M. R. Garey, Satish K. Tripathi: A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniform Processors. IEEE Trans. Computers 33(4): 351-356 (1984)
1983
33 Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh: Scheduling File Transfers in a Distributed Network. PODC 1983: 254-266
32 Edward G. Coffman Jr., M. R. Garey, David S. Johnson: Dynamic Bin Packing. SIAM J. Comput. 12(2): 227-258 (1983)
1982
31 M. R. Garey, David S. Johnson, Hans S. Witsenhausen: The complexity of the generalized Lloyd - Max problem. IEEE Transactions on Information Theory 28(2): 255- (1982)
1981
30 Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou: The Complexity of Searching a Graph (Preliminary Version) FOCS 1981: 376-385
29 M. R. Garey, David S. Johnson, Barbara B. Simons, Robert Endre Tarjan: Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. SIAM J. Comput. 10(2): 256-269 (1981)
1980
28 Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms. SIAM J. Comput. 9(4): 808-826 (1980)
1979
27 M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979
1978
26 Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha: The Complexity of Checkers on an N * N Board - Preliminary Report FOCS 1978: 55-64
25 M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan: Triangulating a Simple Polygon. Inf. Process. Lett. 7(4): 175-179 (1978)
24 M. R. Garey, Robert Endre Tarjan: A Linear-Time Algorithm for Finding All Feedback Vertices. Inf. Process. Lett. 7(6): 274-276 (1978)
23EEM. R. Garey, David S. Johnson: ``Strong'' NP-Completeness Results: Motivation, Examples, and Implications. J. ACM 25(3): 499-508 (1978)
22 Edward G. Coffman Jr., M. R. Garey, David S. Johnson: An Application of Bin-Packing to Multiprocessor Scheduling. SIAM J. Comput. 7(1): 1-17 (1978)
1977
21 M. R. Garey, Frank K. Hwang, David S. Johnson: Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units. IEEE Trans. Computers 26(4): 321-328 (1977)
20 M. R. Garey, David S. Johnson: Two-Processor Scheduling with Start-Times and Deadlines. SIAM J. Comput. 6(3): 416-426 (1977)
19 M. R. Garey, David S. Johnson: The Rectilinear Steiner Tree Problem in NP Complete. SIAM Journal of Applied Mathematics 32: 826-834 (1977)
1976
18 M. R. Garey, Ronald L. Graham, David S. Johnson: Some NP-Complete Geometric Problems STOC 1976: 10-22
17EEP. G. Anderson, M. R. Garey, L. E. Heindel: Computational aspects of deciding if all roots of a polynomial lie within the unit circle. Computing 16(4): 293-304 (1976)
16EEM. R. Garey, David S. Johnson: The Complexity of Near-Optimal Graph Coloring. J. ACM 23(1): 43-49 (1976)
15EEM. R. Garey, David S. Johnson: Scheduling Tasks with Nonuniform Deadlines on Two Processors. J. ACM 23(3): 461-467 (1976)
14 M. R. Garey, Ronald L. Graham, David S. Johnson: Resource Constrained Scheduling as Generalized Bin Packing. J. Comb. Theory, Ser. A 21(3): 257-298 (1976)
13 M. R. Garey, David S. Johnson, Robert Endre Tarjan: The Planar Hamiltonian Circuit Problem is NP-Complete. SIAM J. Comput. 5(4): 704-714 (1976)
12 M. R. Garey, David S. Johnson, Larry J. Stockmeyer: Some Simplified NP-Complete Graph Problems. Theor. Comput. Sci. 1(3): 237-267 (1976)
1975
11 M. R. Garey, David S. Johnson, H. C. So: An Application of Graph Coloring to Printed Circuit Testing (Working Paper) FOCS 1975: 178-183
10EEYehoshua Perl, M. R. Garey, Shimon Even: Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters. J. ACM 22(2): 202-214 (1975)
9 M. R. Garey, Ronald L. Graham: Bounds for Multiprocessor Scheduling with Resource Constraints. SIAM J. Comput. 4(2): 187-200 (1975)
8 M. R. Garey, David S. Johnson: Complexity Results for Multiprocessor Scheduling under Resource Constraints. SIAM J. Comput. 4(4): 397-411 (1975)
1974
7 M. R. Garey, David S. Johnson, Larry J. Stockmeyer: Some Simplified NP-Complete Problems STOC 1974: 47-63
6 M. R. Garey, Ronald L. Graham: Performance Bounds on the Splitting Algorithm for Binary Testing Acta Inf. 3: 347-355 (1974)
5 M. R. Garey: Optimal Binary Search Trees with Restricted Maximal Depth. SIAM J. Comput. 3(2): 101-110 (1974)
4 David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM J. Comput. 3(4): 299-325 (1974)
1973
3 M. R. Garey, Ronald L. Graham: Bounds on Scheduling with Limited Resources. SOSP 1973: 104-111
1972
2 M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman: Worst-Case Analysis of Memory Allocation Algorithms STOC 1972: 143-150
1 Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman: The Transitive Reduction of a Directed Graph. SIAM J. Comput. 1(2): 131-137 (1972)

Coauthor Index

1Sudhir Aggarwal [41]
2Ashok K. Agrawala [34]
3Alfred V. Aho [1]
4P. G. Anderson [17]
5Daniel Barbará [41]
6Fan R. K. Chung (Fan Chung Graham) [39]
7Edward G. Coffman Jr. [22] [28] [32] [33] [34] [35] [38] [42] [43] [44] [45]
8Costas Courcoubetis [43] [45]
9Walter Cunto [41]
10Alan J. Demers [4]
11Shimon Even [10]
12Aviezri S. Fraenkel [26]
13Zoltán Füredi [39]
14Ronald L. Graham [2] [3] [4] [6] [9] [14] [18] [39]
15S. Louis Hakimi [30] [40]
16L. E. Heindel [17]
17Frank K. Hwang (Frank Kwang-Ming Hwang) [21]
18David S. Johnson [4] [7] [8] [11] [12] [13] [14] [15] [16] [18] [19] [20] [21] [22] [23] [25] [26] [27] [28] [29] [30] [31] [32] [33] [35] [36] [37] [38] [40] [43] [45]
19Andrea S. LaPaugh [33] [35]
20Lyle A. McGeoch [43]
21Nimrod Megiddo [30] [40]
22Christos H. Papadimitriou [30] [40]
23Yehoshua Perl [10]
24Franco P. Preparata [25]
25T. Schaefer [26]
26Peter W. Shor [43] [45]
27Barbara B. Simons (Barbara Simons) [29]
28H. C. So [11]
29Larry J. Stockmeyer [7] [12]
30Robert Endre Tarjan [13] [24] [25] [28] [29]
31Satish K. Tripathi [34]
32Jeffrey D. Ullman [1] [2] [4]
33Richard R. Weber [43] [45]
34Hans S. Witsenhausen [31]
35Mihalis Yannakakis [43] [45]
36Yaacov Yesha [26]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)