Vikraman Arvind Somenath Biswas On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. 123-134 1989 68 Theor. Comput. Sci. 2 db/journals/tcs/tcs68.html#ArvindB89 http://dx.doi.org/10.1016/0304-3975(89)90125-4