{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T05:33:31Z","timestamp":1767850411988,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"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":[[1985,3]]},"DOI":"10.1016\/0196-6774(85)90016-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"10-16","source":"Crossref","is-referenced-by-count":15,"title":["NP-completeness for minimizing maximum edge length in grid embeddings"],"prefix":"10.1016","volume":"6","author":[{"given":"Z","family":"Miller","sequence":"first","affiliation":[]},{"given":"J.B","family":"Orlin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90016-1_BIB1","series-title":"Graphs and Digraphs","author":"Behzad","year":"1979"},{"issue":"No. 3","key":"10.1016\/0196-6774(85)90016-1_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The bandwidth problem for graphs and matrices: A survey","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0196-6774(85)90016-1_BIB3","unstructured":"S. Bhatt and S. Cosmadakis, Th complexity of minimizing wire lengths in VLSL layouts, manuscript."},{"key":"10.1016\/0196-6774(85)90016-1_BIB4","unstructured":"S. Bhatt and C. Leiserson, Minimizing the longest edge in a VLSI layout, manuscript."},{"key":"10.1016\/0196-6774(85)90016-1_BIB5","article-title":"On the Bandwidth Problem for Graphs","author":"Chvatalova","year":"1980"},{"key":"10.1016\/0196-6774(85)90016-1_BIB6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0196-6774(85)90016-1_BIB7","series-title":"Proceedings 19th Annual Allerton Conference on Communication, Control, and computing","article-title":"Cut width problems in graphs","author":"Gurari","year":"1981"},{"key":"10.1016\/0196-6774(85)90016-1_BIB8","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0196-6774(85)90016-1_BIB9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0196-6774(82)90011-6","article-title":"The NP-completeness column: An ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90016-1_BIB10","series-title":"Twenty-Second Annual Symposium on Foundations of Computer Science","article-title":"New lower bound techniques for VLSI","author":"Leighton","year":"1981"},{"issue":"No. 2","key":"10.1016\/0196-6774(85)90016-1_BIB11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0196-6774(85)90016-1_BIB12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","article-title":"The NP-completeness of the bandwidth minimization problem","volume":"16","author":"Papadimitriou","year":"1976","journal-title":"Computing"},{"issue":"No. 2","key":"10.1016\/0196-6774(85)90016-1_BIB13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0211018","article-title":"Graphs that are almost binary trees","volume":"11","author":"Rosenberg","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90016-1_BIB14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01776564","article-title":"Bounds on the cost of data encodings","volume":"12","author":"Rosenberg","year":"1978","journal-title":"Math. Systems Theory"},{"issue":"No. 4","key":"10.1016\/0196-6774(85)90016-1_BIB15","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 Discrete Methods"},{"key":"10.1016\/0196-6774(85)90016-1_BIB16","first-page":"235","article-title":"The bandwidth of caterpillar graphs","volume":"33","author":"Miller","year":"1981"},{"issue":"No. 4","key":"10.1016\/0196-6774(85)90016-1_BIB17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1137\/0602041","article-title":"The bandwidth of caterpillars with hairs of length 1 and 2","volume":"2","author":"Assman","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0196-6774(85)90016-1_BIB18","unstructured":"F. R. K. Chung, On graph labelings, to appear."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900161?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900161?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:26:36Z","timestamp":1548743196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["0196677485900161"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90016-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}