The following pages link to Michael R. Garey (Q1083193):
Displaying 50 items.
- A 71/60 theorem for bin packing (Q1083194) (← links)
- Bin packing with divisible item sizes (Q1100914) (← links)
- (Q1215633) (redirect page) (← links)
- On cubical graphs (Q1215634) (← links)
- Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130) (← links)
- On the distance matrix of a tree (Q1226493) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- Triangulating a simple polygon (Q1249042) (← links)
- Resource constrained scheduling as generalized bin packing (Q1249132) (← links)
- A linear-time algorithm for finding all feedback vertices (Q1250830) (← links)
- Performance bounds on the splitting algorithm for binary testing (Q1393276) (← links)
- On enumerating tournaments that admit exactly one Hamiltonian circuit (Q2551106) (← links)
- Optimal task sequencing with precedence constraints (Q2558248) (← links)
- Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing (Q2780629) (← links)
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors (Q3309057) (← links)
- Crossing Number is NP-Complete (Q3320398) (← links)
- (Q3347319) (← links)
- Dynamic Bin Packing (Q3657446) (← links)
- (Q3673102) (← links)
- Optimum Scan-Width Selection Under Containment Constraints (Q3703813) (← links)
- (Q3735092) (← links)
- Composing Functions to Minimize Image Size (Q3738610) (← links)
- Scheduling File Transfers (Q3741046) (← links)
- Minimizing expected makespans on uniform processor systems (Q3754427) (← links)
- The complexity of searching a graph (Q3777477) (← links)
- Asymptotic results for partial concentrators (Q3787932) (← links)
- Strongly connected orientations of mixed multigraphs (Q3789374) (← links)
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties (Q3824090) (← links)
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms (Q3893333) (← links)
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines (Q3925879) (← links)
- The complexity of the generalized Lloyd - Max problem (Corresp.) (Q3932726) (← links)
- On Packing Two-Dimensional Bins (Q3958477) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (Q4051589) (← links)
- The Complexity of Near-Optimal Graph Coloring (Q4083458) (← links)
- Bounds for Multiprocessor Scheduling with Resource Constraints (Q4099212) (← links)
- Scheduling Tasks with Nonuniform Deadlines on Two Processors (Q4105798) (← links)
- An application of graph coloring to printed circuit testing (Q4110937) (← links)
- The Planar Hamiltonian Circuit Problem is NP-Complete (Q4115165) (← links)
- Rectilinear steiner trees: Efficient special-case algorithms (Q4120589) (← links)
- Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units (Q4131010) (← links)
- (Q4133108) (← links)
- Complexity Results for Multiprocessor Scheduling under Resource Constraints (Q4140712) (← links)
- Two-Processor Scheduling with Start-Times and Deadlines (Q4146529) (← links)
- Performance Guarantees for Scheduling Algorithms (Q4147833) (← links)
- An Application of Bin-Packing to Multiprocessor Scheduling (Q4151721) (← links)
- (Q4155835) (← links)
- `` Strong '' NP-Completeness Results (Q4158479) (← links)
- (Q4161330) (← links)
- Complexity Results for Bandwidth Minimization (Q4165413) (← links)
