M. R. Garey
- Some simplified NP-complete graph problems
1976/02/01 by M. R. Garey, M.R. Garey, David S. Johnson +3 · 28 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Corollary #Discrete mathematics #Graph #Hamiltonian path #Hamiltonian path problem #Mathematics #NP-complete #Optimization and Search Problems #Time complexity
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
1974/12/01 by D. S. Johnson, A. Demers, Alan Demers +4 · 47 citations
Engineering · Computer Science · #Optimization and Packing Problems #Advanced Manufacturing and Logistics Optimization #Optimization and Search Problems
- The Complexity of Coloring Circular Arcs and Chords
1980/06/01 by M. R. Garey, David S. Johnson, Gary L. Miller +1 · 15 citations
Computer Science · Mathematics · Engineering · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #graph theory and CDMA systems #Mathematics #Combinatorics #Graph coloring #Arc (geometry) #Fractional coloring #Greedy coloring #List coloring #Complete coloring #Discrete mathematics #Graph #Graph power #Line graph #Geometry
- The Rectilinear Steiner Tree Problem is NP-Complete
1977/06/01 by M. R. Garey, David S. Johnson · 5 citations
Engineering · Computer Science · Mathematics · #VLSI and FPGA Design Techniques #Interconnection Networks and Systems #Computational Geometry and Mesh Generation #Steiner tree problem #Mathematics #Combinatorics #Heuristics #Tree (set theory) #Discrete mathematics #Graph #Polyomino #Plane (geometry) #Algorithm #Mathematical optimization #Geometry
- `` Strong '' NP-Completeness Results
1978/07/01 by M. R. Garey, David Johnson · 4 citations
Engineering · Computer Science · Mathematics · #VLSI and FPGA Design Techniques #Scheduling and Optimization Algorithms #VLSI and Analog Circuit Testing #Citation #Completeness (order theory) #Computer science #Information retrieval #World Wide Web #Library science #Operations research #Mathematics
- Some simplified NP-complete problems
1974/01/01 by M. R. Garey, D. S. Johnson, Larry Stockmeyer · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Hamiltonian path #Combinatorics #Corollary #Mathematics #Hamiltonian path problem #NP-complete #Discrete mathematics #Time complexity #Computational complexity theory #Undirected graph #Upper and lower bounds #Maximum cut #Graph #Algorithm
- The Complexity of Computing Steiner Minimal Trees
1977/06/01 by M. R. Garey, Ronald Graham, R. L. Graham +2 · 3 citations
Computer Science · Engineering · #Computational Geometry and Mesh Generation #Graph Theory and Algorithms #VLSI and FPGA Design Techniques
- A 7160 theorem for bin packing
1985/10/01 by David S. Johnson, David S Johnson, M. R. Garey +1 · 2 citations
Computer Science · Engineering · Mathematics · #Algorithm #Bin #Bin packing problem #Combinatorics #Computational Geometry and Mesh Generation #Mathematical optimization #Mathematics #Optimization and Packing Problems #Simple (philosophy) #graph theory and CDMA systems
- The Transitive Reduction of a Directed Graph
1972/06/01 by Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman · 1 citation
Computer Science · Engineering · Mathematics · #Computability, Logic, AI Algorithms #Scheduling and Optimization Algorithms #Cellular Automata and Applications #Transitive reduction #Combinatorics #Transitive closure #Mathematics #Directed graph #Discrete mathematics #Vertex (graph theory) #Regular graph #Null graph #Transitive relation #Graph #Voltage graph #Line graph