Concepedia

D. S. Johnson

DS

8

Publications

2.9K

Citations

8

H-Index

1972

Active since

Affiliations

Massachusetts Institute of Technology(Current)

D. S. Johnson is an author at Massachusetts Institute of Technology specializing in engineering, computer science, and computational complexity.

Top concepts

Publications per year

1972–1994

8

Publications

8

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

D. S. Johnson, Alan Demers, Jeffrey D. Ullman et al. · SIAM Journal on Computing · 1974 · 907 citations

, , +19

The Complexity of Multiterminal Cuts

Elias Dahlhaus, D. S. Johnson, Christos H. Papadimitriou et al. · SIAM Journal on Computing · 1994 · 659 citations

, , +18

Some simplified NP-complete problems

M. R. Garey, D. S. Johnson, Larry Stockmeyer · 1974 · 595 citations · Full text

, , +17

The Planar Hamiltonian Circuit Problem is NP-Complete

M. R. Garey, D. S. Johnson, Robert E. Tarjan · SIAM Journal on Computing · 1976 · 520 citations

, , +17

Testing containment of conjunctive queries under functional and inclusion dependencies

D. S. Johnson, Anthony C. Klug · 1982 · 54 citations

, , +17

Rows per page

1–5 of 8