Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem

Relationships between nondeterministic and deterministic tape complexities

Walter J. Savitch · Journal of Computer and System Sciences · 1970 · 1.4K citations

Computing, Computer Science, Algorithms +5

The NP-Completeness of the bandwidth minimization problem

Ch. H. Papadimitriou · Computing · 1976 · 409 citations

Computing, Computer Science, Algorithms +11

Complexity Results for Bandwidth Minimization

M. R. Garey, Ronald Graham, David S. Johnson et al. · SIAM Journal on Applied Mathematics · 1978 · 296 citations

Computing, Computer Science, Algorithms +16

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time

James B. Saxe · SIAM Journal on Algebraic and Discrete Methods · 1980 · 148 citations

Computing, Computer Science, Mathematics +13

Large Scale Integration of MOS Complex Logic: A Layout Method

A. Weinberger · IEEE Journal of Solid-State Circuits · 1967 · 118 citations

Engineering, Computer Engineering, Computer Architecture +14