{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:09:55Z","timestamp":1676826595311},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"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":9055,"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":[[1988,10]]},"DOI":"10.1016\/0166-218x(88)90064-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"177-183","source":"Crossref","is-referenced-by-count":25,"title":["Finding a minimum independent dominating set in a permutation graph"],"prefix":"10.1016","volume":"21","author":[{"given":"Mikhail J.","family":"Atallah","sequence":"first","affiliation":[]},{"given":"Glenn K.","family":"Manacher","sequence":"additional","affiliation":[]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90064-9_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"1","key":"10.1016\/0166-218X(88)90064-9_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00625277","article-title":"Some modified algorithms for Dijkstra's longest upsequence problem","volume":"18","author":"Dewar","year":"1982","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/0166-218X(88)90064-9_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288531","article-title":"Some beautiful arguments using mathematical induction","volume":"13","author":"Dijkstra","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0166-218X(88)90064-9_BIB4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","article-title":"Domination in permutation graphs","volume":"6","author":"Farber","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(88)90064-9_BIB5","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0166-218X(88)90064-9_BIB6","series-title":"Tech. Rept. 641","article-title":"An efficient algorithm for maxdominance, with applications","author":"Atallah","year":"1987"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900649?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900649?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:50:33Z","timestamp":1555116633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0166218X88900649"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90064-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}