{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:19Z","timestamp":1759638259755},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":7899,"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":[[1991,12]]},"DOI":"10.1016\/0890-5401(91)90045-4","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"218-224","source":"Crossref","is-referenced-by-count":20,"title":["On finding the minimum bandwidth of interval graphs"],"prefix":"10.1016","volume":"95","author":[{"given":"R.","family":"Mahesh","sequence":"first","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90045-4_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0890-5401(91)90045-4_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(91)90045-4_BIB3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","article-title":"Finding hamiltonian cycles in interval graphs","volume":"20","author":"Keil","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90045-4_BIB4","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/0890-5401(87)90028-9","article-title":"Finding the minimum bandwidth of interval graphs","volume":"74","author":"Kratsch","year":"1987","journal-title":"Inform. Comput."},{"key":"10.1016\/0890-5401(91)90045-4_BIB5","series-title":"An efficient algorithm to compute a minimum weighted maximal irredundant set in an interval graph","author":"Marathe","year":"1989"},{"key":"10.1016\/0890-5401(91)90045-4_BIB6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","article-title":"A unified approach to domination problems on interval graphs","volume":"27","author":"Ramalingam","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90045-4_BIB7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(89)90184-1","article-title":"A linear algorithm for the domatic number of interval graphs","volume":"33","author":"Rao","year":"1989","journal-title":"Inform. Process. Lett."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900454?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900454?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:25:35Z","timestamp":1548897935000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540191900454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0890540191900454"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90045-4","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}