{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:51Z","timestamp":1770994011340,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1016\/0196-6774(85)90001-x","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"309-321","source":"Crossref","is-referenced-by-count":82,"title":["Domination in permutation graphs"],"prefix":"10.1016","volume":"6","author":[{"given":"Martin","family":"Farber","sequence":"first","affiliation":[]},{"given":"J","family":"Mark Keil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90001-X_BIB1","series-title":"Proc. 8th Southeastern Conf. Combinatorics, Graph Theory, and Computing","first-page":"321","article-title":"Independent domination in trees","author":"Beyer","year":"1977"},{"key":"10.1016\/0196-6774(85)90001-X_BIB2","article-title":"Dominating Sets in Chordal Graphs","author":"Booth","year":"1980"},{"key":"10.1016\/0196-6774(85)90001-X_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90001-X_BIB4","unstructured":"G. J. Chang, private communication."},{"key":"10.1016\/0196-6774(85)90001-X_BIB5","article-title":"The k-Domination and k-Stability Problem on Graphs","author":"Chang","year":"1982"},{"key":"10.1016\/0196-6774(85)90001-X_BIB6","first-page":"41","article-title":"A linear algorithm for the domination number of a tree","volume":"4","author":"Cockayne","year":"1975"},{"key":"10.1016\/0196-6774(85)90001-X_BIB7","unstructured":"D. G. Corneil and J. M. Keil, A dynamic programming approach to the dominating set problem on k-trees, submitted."},{"key":"10.1016\/0196-6774(85)90001-X_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(85)90001-X_BIB9","series-title":"Fast Turing Reductions between Problems in NP","author":"Dewdney","year":"1981"},{"key":"10.1016\/0196-6774(85)90001-X_BIB10","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","article-title":"Independent domination in chordal graphs","volume":"1","author":"Farber","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0196-6774(85)90001-X_BIB11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(85)90001-X_BIB12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","article-title":"A linear algorithm for the domination number of a series-parallel graph","volume":"5","author":"Kikuno","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0196-6774(85)90001-X_BIB13","first-page":"261","article-title":"Optimum domination in weighted trees","volume":"7","author":"Natarajan","year":"1978"},{"key":"10.1016\/0196-6774(85)90001-X_BIB14","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pnueli","year":"1971","journal-title":"Canad. J. Math."},{"key":"10.1016\/0196-6774(85)90001-X_BIB15","series-title":"Proc. 15th Annu. ACM Sympos. on Theory of Computing","first-page":"457","article-title":"Transitive orientation in O(n2) time","author":"Spinrad","year":"1983"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748590001X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748590001X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:26:12Z","timestamp":1548725172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667748590001X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["019667748590001X"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90001-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}