The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
M. R. Garey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  44. Computational aspects of deciding if all roots of a polynomial lie within the unit circle. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002