David S. Johnson

Researcher Next ID · RN-002065

Researcher · Computer Science

Ilmenau, Germany

Not currently recruitingFunding unknown

Research interests

Computer Science

Engineering

Complexity and Algorithms in Graphs

Optimization and Search Problems

Optimization and Packing Problems

Advanced Graph Theory Research

Parallel Computing and Optimization Techniques

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Operations Research · 1989 · https://doi.org/10.1287/opre.37.6.865
Computers and Intractability: A Guide to the Theory of NP-Completeness
Journal · 1979
The Rectilinear Steiner Tree Problem is $NP$-Complete
SIAM Journal on Applied Mathematics · 1977 · https://doi.org/10.1137/0132071
Some simplified NP-complete graph problems
Theoretical Computer Science · 1976 · https://doi.org/10.1016/0304-3975(76)90059-1
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences · 1974 · https://doi.org/10.1016/s0022-0000(74)80044-9

No projects listed.