{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:12Z","timestamp":1759638072356},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9482,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1016\/0890-5401(87)90028-9","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"140-158","source":"Crossref","is-referenced-by-count":20,"title":["Finding the minimum bandwidth of an interval graph"],"prefix":"10.1016","volume":"74","author":[{"given":"Dieter","family":"Kratsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(87)90028-9_BIB1","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\/0890-5401(87)90028-9_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(87)90028-9_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0890-5401(87)90028-9_BIB4","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\/0890-5401(87)90028-9_BIB5","author":"Garey","year":"1979"},{"key":"10.1016\/0890-5401(87)90028-9_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graphs of directed paths in directed trees","volume":"13","author":"Gavril","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0890-5401(87)90028-9_BIB7","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0890-5401(87)90028-9_BIB8","author":"Golumbic","year":"1980"},{"key":"10.1016\/0890-5401(87)90028-9_BIB9","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","article-title":"Improved dynamic programming algorithms for the bandwidth minimization and the mincut linear arrangement problem","volume":"5","author":"Gurari","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0890-5401(87)90028-9_BIB10","first-page":"434","article-title":"The NP-completeness column: An ongoing guide","volume":"6","author":"Johnson","year":"1985"},{"key":"10.1016\/0890-5401(87)90028-9_BIB11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","article-title":"Finding hamiltonian circuits in interval graphs","volume":"20","author":"Keil","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(87)90028-9_BIB12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(86)90022-0","article-title":"Total domination in interval graphs","volume":"22","author":"Keil","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(87)90028-9_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/0890-5401(87)90028-9_BIB14","series-title":"Graphs and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/0890-5401(87)90028-9_BIB15","author":"Monien","year":"1983"},{"key":"10.1016\/0890-5401(87)90028-9_BIB16","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"},{"key":"10.1016\/0890-5401(87)90028-9_BIB17","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"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:26:07Z","timestamp":1548897967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540187900289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["0890540187900289"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(87)90028-9","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}