Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Burkhard Monien, Ivan Hal Sudborough. Bandwidth Constrained NP-Complete Problems. In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, 11-13 May 1981, Milwaukee, Wisconsin, USA. pages 207-217, ACM, 1981.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Bandwidth Constrained NP-Complete ProblemsBurkhard Monien, Ivan Hal Sudborough. TCS, 41:141-167, 1985. Bounding the Bandwidth of NP-Complete ProblemsBurkhard Monien. criwg 1981: 279-292
The following publications are possibly variants of this publication: