{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:56:51Z","timestamp":1778295411590,"version":"3.51.4"},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1016\/0196-6774(82)90011-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"89-99","source":"Crossref","is-referenced-by-count":46,"title":["The NP-completeness column: An ongoing guide"],"prefix":"10.1016","volume":"3","author":[{"given":"David S","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90011-6_BIB1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0020-0190(80)90034-4","article-title":"On the area of binary tree layouts","volume":"11","author":"Brent","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(82)90011-6_BIB2","series-title":"Proc. 1981 Conf. on Information Sciences and Systems","article-title":"Some additional examples of bandwidth-constrained NP-complete problems","author":"Chung","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB3","article-title":"The embedding dimension of a graph","author":"Dewdney","year":"1979"},{"key":"10.1016\/0196-6774(82)90011-6_BIB4","series-title":"On linear area embedding of planar graphs","author":"Dolev","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB5","series-title":"Proceedings 12th Ann. ACM Symp. on Theory of Computing","first-page":"177","article-title":"Optimal tree layout","author":"Fischer","year":"1980"},{"key":"10.1016\/0196-6774(82)90011-6_BIB6","unstructured":"M. R. Garey and D. S. Johnson, unpublished result, 1981."},{"key":"10.1016\/0196-6774(82)90011-6_BIB7","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","article-title":"An application of graph coloring to printed circuit testing","author":"Garey","year":"1976","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0196-6774(82)90011-6_BIB8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0196-6774(82)90011-6_BIB9","series-title":"Proceedings 18th Ann. Allerton Conf. on Communication, Control, and Computing","first-page":"650","article-title":"Bandwidth problems in graphs","author":"Gurari","year":"1980"},{"key":"10.1016\/0196-6774(82)90011-6_BIB10","series-title":"Proceedings 19th Ann. Allerton Conf. on Communication, Control, and Computing","article-title":"Cut width problems in graphs","author":"Gurari","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB11","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0196-6774(82)90011-6_BIB12","doi-asserted-by":"crossref","unstructured":"A. Itai, C. H. Papadimitriou, and J. Szwarcfiter, Hamilton paths in grid graphs, SIAM J. Comput., to appear.","DOI":"10.1137\/0211056"},{"key":"10.1016\/0196-6774(82)90011-6_BIB13","unstructured":"D. S. Johnson, unpublished result, 1981."},{"key":"10.1016\/0196-6774(82)90011-6_BIB14","series-title":"Proceedings 21st Ann. Symp. on Foundations of Computer Science","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/0196-6774(82)90011-6_BIB15","series-title":"On the complexity of the general coloring problem","author":"Maurer","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB16","series-title":"Proceedings 13th Ann. ACM Symp. on Theory of Computing","first-page":"207","article-title":"Bandwidth-constrained NP-complete problems","author":"Monien","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB17","series-title":"Mathematical Foundations of Computer Science 1981","first-page":"78","article-title":"Time and space bounded complexity classes and bandwidth constrained problems (A survey)","author":"Monien","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB18","series-title":"Proceedings 13th Ann. ACM Symp. on Theory of Computing","first-page":"293","article-title":"Bounds on minimax edge length for complete binary trees","author":"Paterson","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","article-title":"Tidier drawings of trees","author":"Reingold","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0196-6774(82)90011-6_BIB20","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00288886","article-title":"Data encodings and their costs","volume":"9","author":"Rosenberg","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/0196-6774(82)90011-6_BIB21","article-title":"Uniform data encodings","author":"Rosenberg","year":"1978"},{"key":"10.1016\/0196-6774(82)90011-6_BIB22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(80)90043-2","article-title":"Uniform data encodings","volume":"11","author":"Rosenberg","year":"1980","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0196-6774(82)90011-6_BIB23","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0601042","article-title":"Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time","volume":"1","author":"Saxe","year":"1980","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/0196-6774(82)90011-6_BIB24","article-title":"Two papers on graph embedding problems","author":"Saxe","year":"1980"},{"key":"10.1016\/0196-6774(82)90011-6_BIB25","unstructured":"J. B. Saxe, private communication (1981)."},{"key":"10.1016\/0196-6774(82)90011-6_BIB26","series-title":"Proceedings 12th Ann. ACM Symp. on Theory of Computing","first-page":"201","article-title":"The node cost measure for embedding graphs on the planar grid","author":"Storer","year":"1980"},{"key":"10.1016\/0196-6774(82)90011-6_BIB27","series-title":"On minimal node cost planar embeddings","author":"Storer","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB28","series-title":"The complexity of drawing trees nicely","author":"Supowit","year":"1980"},{"key":"10.1016\/0196-6774(82)90011-6_BIB29","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI Circuits","volume":"C-30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0196-6774(82)90011-6_BIB30","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TSE.1979.234212","article-title":"Tidy drawings of trees","author":"Wetherell","year":"1979","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0196-6774(82)90011-6_BIB31","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10233-7","article-title":"Grammar and L Forms: An Introduction","author":"Wood","year":"1980"},{"key":"10.1016\/0196-6774(82)90011-6_BIB32","article-title":"Drawing Planar Graphs","author":"Woods","year":"1981"},{"key":"10.1016\/0196-6774(82)90011-6_BIB33","series-title":"Proceedings 10th Ann. Symp. on Foundations of Computer Science","first-page":"1","article-title":"On some theoretical aspects of position-location problems","author":"Yemeni","year":"1979"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900116?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900116?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:52:04Z","timestamp":1548744724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["0196677482900116"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90011-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}