{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T18:38:10Z","timestamp":1766428690861},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":7655,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0166-218x(92)90116-r","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"87-93","source":"Crossref","is-referenced-by-count":12,"title":["Generalized vertex covering in interval graphs"],"prefix":"10.1016","volume":"39","author":[{"given":"Madhav V.","family":"Marathe","sequence":"first","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90116-R_BIB1","unstructured":"S. Aravind, R. Mahesh and C. Pandu Rangan, Bandwidth optimization for interval graphs revisted, Inform. and Comput., to appear."},{"key":"10.1016\/0166-218X(92)90116-R_BIB2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(88)90086-8","article-title":"The complexity of generalized clique covering","volume":"22","author":"Corneil","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90116-R_BIB3","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(92)90116-R_BIB4","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\/0166-218X(92)90116-R_BIB5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","article-title":"A unified approach to domination problems in interval graphs","volume":"27","author":"Ramalingam","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90116-R_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0020-0190(89)90184-1","article-title":"A linear algorithm for domatic number of interval graphs","volume":"33","author":"Srinivas Rao","year":"1989","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290116R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290116R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:57Z","timestamp":1555136637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290116R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["0166218X9290116R"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90116-r","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}