The following pages link to David S. Johnson (Q721935):
Displaying 50 items.
- (Q209588) (redirect page) (← links)
- Min-sum bin packing (Q721936) (← links)
- A 71/60 theorem for bin packing (Q1083194) (← links)
- The computational complexity of inferring rooted phylogenies by parsimony (Q1086183) (← links)
- On generating all maximal independent sets (Q1108809) (← links)
- How easy is local search? (Q1109573) (← links)
- Unit disk graphs (Q1174134) (← links)
- Approximation algorithms for combinatorial problems (Q1213733) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- The densest hemisphere problem (Q1242681) (← links)
- Triangulating a simple polygon (Q1249042) (← links)
- Resource constrained scheduling as generalized bin packing (Q1249132) (← links)
- Fast algorithms for bin packing (Q1845315) (← links)
- A brief history of NP-completeness, 1954--2012 (Q1946035) (← links)
- The combinatorics of hidden diversity (Q2297852) (← links)
- (Q2768348) (← links)
- Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing (Q2780629) (← links)
- (Q2934701) (← links)
- Resource-based corruptions and the combinatorics of hidden diversity (Q2986890) (← links)
- Bin packing with discrete item sizes, part II: Tight bounds on First Fit (Q3122907) (← links)
- (Q3138967) (← links)
- On the sum-of-squares algorithm for bin packing (Q3191987) (← links)
- On a dual version of the one-dimensional bin packing problem (Q3219761) (← links)
- Crossing Number is NP-Complete (Q3320398) (← links)
- (Q3347319) (← links)
- Generalized planar matching (Q3357535) (← links)
- The geometric maximum traveling salesman problem (Q3452505) (← links)
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning (Q3476605) (← links)
- On the Sum-of-Squares algorithm for bin packing (Q3546292) (← links)
- Dynamic Bin Packing (Q3657446) (← links)
- (Q3673102) (← links)
- (Q3693290) (← links)
- (Q3701213) (← links)
- (Q3728034) (← links)
- Composing Functions to Minimize Image Size (Q3738610) (← links)
- Scheduling File Transfers (Q3741046) (← links)
- The NP-completeness column: an ongoing guide (Q3747723) (← links)
- The complexity of searching a graph (Q3777477) (← links)
- Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081) (← links)
- (Q3840359) (← 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)
- The NP-completeness column: An ongoing gulde (Q3968457) (← links)
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning (Q3978838) (← links)
- (Q4035170) (← links)
- (Q4038710) (← links)
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (Q4051589) (← links)
