Michael Randolph Garey
#64,953
Most Influential Person Now
Michael Randolph Garey's AcademicInfluence.com Rankings
Michael Randolph Gareymathematics Degrees
Mathematics
#2878
World Rank
#4354
Historical Rank
Measure Theory
#162
World Rank
#246
Historical Rank
Download Badge
Computer Science Mathematics
Michael Randolph Garey's Degrees
- PhD Computer Science University of California, Berkeley
- Masters Computer Science University of California, Berkeley
- Bachelors Mathematics University of California, Berkeley
Similar Degrees You Can Earn
Why Is Michael Randolph Garey Influential?
(Suggest an Edit or Addition)Michael Randolph Garey's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Computers and Intractability: A Guide to the Theory of NP-Completeness (1978) (49523)
- Johnson: computers and intractability: a guide to the theory of np- completeness (freeman (1979) (8033)
- Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran (1979) (2818)
- The Complexity of Flowshop and Jobshop Scheduling (1976) (2421)
- Some Simplified NP-Complete Graph Problems (1976) (2177)
- Approximation algorithms for bin packing: a survey (1996) (1109)
- The Rectilinear Steiner Tree Problem is NP Complete (1977) (1065)
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (1974) (913)
- Crossing Number is NP-Complete (1983) (745)
- The Transitive Reduction of a Directed Graph (1972) (705)
- An Application of Bin-Packing to Multiprocessor Scheduling (1978) (697)
- `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications (1978) (669)
- Some simplified NP-complete problems (1974) (635)
- The Complexity of Computing Steiner Minimal Trees (1977) (577)
- The Planar Hamiltonian Circuit Problem is NP-Complete (1976) (532)
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms (1980) (517)
- Complexity Results for Multiprocessor Scheduling under Resource Constraints (1975) (513)
- Approximation Algorithms for Bin-Packing — An Updated Survey (1984) (468)
- The Complexity of Coloring Circular Arcs and Chords (1980) (425)
- The complexity of searching a graph (1981) (396)
- Some NP-complete geometric problems (1976) (387)
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties (1988) (364)
- Johnson: "computers and intractability (1979) (354)
- Resource Constrained Scheduling as Generalized Bin Packing (1976) (340)
- Triangulating a Simple Polygon (1978) (314)
- The Complexity of Near-Optimal Graph Coloring (1976) (299)
- COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION (1978) (275)
- Bounds for Multiprocessor Scheduling with Resource Constraints (1975) (264)
- Two-Processor Scheduling with Start-Times and Deadlines (1977) (245)
- Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness (1979) (237)
- On Packing Two-Dimensional Bins (1982) (231)
- Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines (1981) (209)
- The complexity of the generalized Lloyd - Max problem (1982) (205)
- Worst-case analysis of memory allocation algorithms (1972) (185)
- Scheduling File Transfers (1985) (182)
- An application of graph coloring to printed circuit testing (1975) (168)
- Optimal Binary Identification Procedures (1972) (167)
- Dynamic Bin Packing (1983) (161)
- Performance Guarantees for Scheduling Algorithms (1978) (153)
- The Rectilinear Steiner Problem is NP-Complete (1977) (145)
- Scheduling Tasks with Nonuniform Deadlines on Two Processors (1976) (144)
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness (1977) (122)
- Approximation Algorithms for Bin Packing Problems: A Survey (1981) (116)
- A 71/60 theorem for bin packing (1985) (106)
- Bin packing with divisible item sizes (1987) (104)
- Stockmeyer: some simplified np-complete graph problems (1976) (103)
- Rectilinear steiner trees: Efficient special-case algorithms (1977) (97)
- Diameter bounds for altered graphs (1984) (91)
- On the distance matrix of a tree (1976) (90)
- Optimal task sequencing with precedence constraints (1973) (86)
- Scheduling Opposing Forests (1983) (84)
- Optimal Binary Search Trees with Restricted Maximal Depth (1974) (75)
- Approximation algorithms for bin-packing (1984) (74)
- The complexity of checkers on an N × N board (1978) (66)
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors (1984) (64)
- Approximation algorithms for combinatorial problems: an annotated bibliography (1976) (57)
- Strongly connected orientations of mixed multigraphs (1985) (57)
- Performance bounds on the splitting algorithm for binary testing (1974) (53)
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings (2000) (47)
- Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters (1975) (46)
- Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study (1991) (43)
- Minimizing expected makespans on uniform processor systems (1987) (42)
- Scheduling file transfers in a distributed network (1983) (39)
- On cubical graphs (1975) (36)
- L worst-case performance bounds for rumple one-dimensional packing algorithms siam j (1974) (35)
- On the Fractional Covering Number of Hypergraphs (1988) (28)
- Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing (2002) (28)
- Some simplified polynomial complete problems (1974) (24)
- Representing Boolean Functions with If-Then-Else DAGs (1988) (23)
- Worst case bounds for simple one-dimensional packing algorithms (1974) (22)
- Isolating a Single Defective Using Group Testing (1974) (22)
- Bounds on scheduling with limited resources (1973) (21)
- Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling (1991) (20)
- Two Results Concerning Multicoloring (1978) (20)
- The Complexity of Searching a Graph (Preliminary Version) (1981) (19)
- Optimal test point selection for sequential manufacturing processes (1972) (19)
- Optimal binary decision trees for diagnostic identification problems (1970) (15)
- Computational aspects of deciding if all roots of a polynomial lie within the unit circle (1976) (13)
- Simple Binary Identification Problems (1972) (13)
- On enumerating tournaments that admit exactly one Hamiltonian circuit (1972) (12)
- A Linear-Time Algorithm for Finding All Feedback Vertices (1978) (12)
- Asymptotic results for partial concentrators (1988) (11)
- Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling (1993) (11)
- Resident-Bubble Cellular Logic Using Magnetic Domains (1972) (10)
- Restrictions of Minimum Spanner Problems (1997) (9)
- 2 APPROXIMATION ALGORITHMS FOR BIN PACKING : A SURVEY (2014) (6)
- The Complexity of Computig Steiner Minimal Tree (1977) (4)
- Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units (1977) (3)
- Bounded Component Spanning Forest (1979) (3)
- A note on "A note on 'Some simplified NP-complete graph problems'" (1978) (2)
- A Other Related Work (1993) (2)
- The Complexity of Collapsing Reachability Graphs (1989) (1)
- A note on bisecting minimum spanning trees (1978) (1)
- Composing Functions to Minimize Image Size (1985) (1)
- In Exaclty One Triple of T. from a Steiner Triple System We Derive a Graph the Cardinality of a Minimum Cover for a Steiner Triple System Deened On (1994) (0)
- LTCC Course on Graph Theory 2013 / 14 Notes 3 Complexity and Algorithms (2013) (0)
- On the Stability Proof of Adaptive Schemes with Static Normalizing Signals and Parameter Projection (1993) (0)
- Computing an Average Cost Allocation for Interrelated Operations (1973) (0)
- Optimum scan-width selection under containment constraints (1984) (0)
- Test Number of Wirelength Gain Problem Elements Test Number of Channel Width Gain Problem Elements Cij C 2 (0)
- Polygons with Identical Diameter Function (1993) (0)
- 5. Concluding Remarks (1975) (0)
- Mathematics for Operations Research (2003) (0)
- Generation of Digit Reversed Address Sequences for Fast Fourier Transforms (1991) (0)
This paper list is powered by the following services:
