David S. Johnson
Johnson, David S.
Bookitis has not yet captured a biography for this author, but the catalog links below show the books currently associated with this profile.
Overview
Catalog identity and bibliographic footprint for this author.
Catalog identity
How this author appears inside the active Bookitis catalog.
Display name
Personal name
Source identifier
Featured books
Representative editions for works actually authored by this person.
- Image source: Open LibraryDS
Data structures, near neighbor searches, and methodology
cover - Image source: Open LibraryCC
Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
cover - Image source: Open LibraryNF
Network flows and matching
cover - Image source: Open LibraryDA
Discrete algorithms and complexity
cover - Image source: Open LibraryCA
Computers and intractability
cover - TSThe shortest path problemDavid S. Johnson
The shortest path problem
no cover - NBNear-optimal bin packing algori...David S. Johnson
Near-optimal bin packing algorithms
no cover
Works in catalog
Quick navigation into the work-level grouping pages behind the featured books.
- Open Work
Data structures, near neighbor searches, and methodology
- Open Work
Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
- Open Work
Network flows and matching
- Open Work
Discrete algorithms and complexity
- Open Work
Computers and intractability
- Open Work
The shortest path problem
- Open Work
Near-optimal bin packing algorithms