{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:14:29Z","timestamp":1648876469334},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0020-0190(92)90262-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"99-102","source":"Crossref","is-referenced-by-count":4,"title":["Finding a maximum set of independent chords in a circle"],"prefix":"10.1016","volume":"41","author":[{"given":"R.C.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.S.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90262-T_BIB1","first-page":"133","article-title":"A faster algorithm for finding a maximum weight independent set of a circle graph","author":"Asano","year":"1989","journal-title":"Inform. Process. Soc. Japan SIGAL Report AL5\u201318"},{"key":"10.1016\/0020-0190(92)90262-T_BIB2","series-title":"Ph.D. Dissertation","article-title":"Circle graphs","author":"Buckingham","year":"1980"},{"key":"10.1016\/0020-0190(92)90262-T_BIB3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","article-title":"Algorithms for a maximum clique and a maximum independent set of a circle graph","volume":"3","author":"Gavril","year":"1973","journal-title":"Networks"},{"issue":"2","key":"10.1016\/0020-0190(92)90262-T_BIB4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0020-0190(88)90097-X","article-title":"On decomposing polygons into uniformly monotone parts","volume":"27","author":"Liu","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90262-T_BIB5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/jgt.3190060309","article-title":"Orientations of circle graphs","volume":"6","author":"Read","year":"1982","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/0020-0190(92)90262-T_BIB6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TCAD.1987.1270250","article-title":"Finding a maximum planar subsets of a set of nets in a channel","volume":"6","author":"Supowit","year":"1989","journal-title":"IEEE Trans. Computer-Aided Design"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290262T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290262T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:10Z","timestamp":1555129570000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290262T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["002001909290262T"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90262-t","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}