The following pages link to David S. Johnson (Q721935):
Displaying 7 items.
- How easy is local search? (Q1109573) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- On the Sum-of-Squares algorithm for bin packing (Q3546292) (← 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)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
