Follow
David S. Johnson
David S. Johnson
Visiting Professor, Columbia University Computer Science Department
Verified email at research.att.com - Homepage
Title
Cited by
Cited by
Year
Computers and intractability
MR Garey, DS Johnson
freeman, 1979
733471979
Initial sequencing and analysis of the human genome
ES Lander, LM Linton, B Birren, C Nusbaum, MC Zody, J Baldwin, ...
Macmillan Publishers Ltd., 2001
279972001
Mobility support in IPv6
D Johnson, C Perkins, J Arkko
RFC 3775, june 6 (30), 2004, 2004
80752004
Initial sequencing and comparative analysis of the mouse genome
RH Waterston, L Pachter
Nature 420 (6915), 520-562, 2002
79052002
Estimating the reproducibility of psychological science
Open Science Collaboration
Science 349 (6251), aac4716, 2015
65612015
Some simplified NP-complete problems
MR Garey, DS Johnson, L Stockmeyer
Proceedings of the sixth annual ACM symposium on Theory of computing, 47-63, 1974
35171974
The complexity of flowshop and jobshop scheduling
MR Garey, DS Johnson, R Sethi
Mathematics of operations research 1 (2), 117-129, 1976
33551976
Approximation algorithms for combinatorial problems
DS Johnson
Journal of computer and system sciences 9 (3), 256-278, 1974
31661974
Chemotherapy in non-small cell lung cancer: a meta-analysis using updated data on individual patients from 52 randomised clinical trials
Non-small Cell Lung Cancer Collaborative Group
Bmj 311 (7010), 899-909, 1995
31521995
Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning
DS Johnson, CR Aragon, LA McGeoch, C Schevon
Operations research 37 (6), 865-892, 1989
2775*1989
Approximation algorithms for bin packing: A survey
EGC man Jr, MR Garey, DS Johnson
Approximation algorithms for NP-hard problems, 46-93, 1996
2042*1996
The traveling salesman problem: A case study in local optimization
DS Johnson, LA McGeoch
Local search in combinatorial optimization 1 (1), 215-310, 1997
18671997
Unit disk graphs
BN Clark, CJ Colbourn, DS Johnson
Discrete mathematics 86 (1-3), 165-177, 1990
17761990
The genome of the social amoeba Dictyostelium discoideum
L Eichinger, JA Pachebat, G Glöckner, MA Rajandream, R Sucgang, ...
Nature 435 (7038), 43-57, 2005
15072005
Computers and Intractability: A Guide to the Theory of NP-completeness
MR Gary, DS Johnson
WH Freeman and Company, New York, 1979
14541979
The Rectilinear Steiner Tree Problem is -Complete
MR Garey, DS Johnson
SIAM Journal on Applied Mathematics 32 (4), 826-834, 1977
14451977
Worst-case performance bounds for simple one-dimensional packing algorithms
DS Johnson, A Demers, JD Ullman, MR Garey, RL Graham
SIAM Journal on computing 3 (4), 299-325, 1974
11871974
Crossing number is NP-complete
MR Garey, DS Johnson
SIAM Journal on Algebraic Discrete Methods 4 (3), 312-316, 1983
10611983
On generating all maximal independent sets
DS Johnson, M Yannakakis, CH Papadimitriou
Information Processing Letters 27 (3), 119-123, 1988
9771988
The NP-completeness column: an ongoing guide
DS Johnson
Journal of algorithms 6 (3), 434-451, 1985
920*1985
The system can't perform the operation now. Try again later.
Articles 1–20