{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:57Z","timestamp":1725663357641},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540529217"},{"type":"electronic","value":"9783540471776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52921-7_60","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:47:35Z","timestamp":1330206455000},"page":"109-117","source":"Crossref","is-referenced-by-count":8,"title":["Fast algorithms for the dominating set problem on permutation graphs"],"prefix":"10.1007","author":[{"given":"Kuo-Hui","family":"Tsai","sequence":"first","affiliation":[]},{"given":"Wen-Lian","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(88)90064-9","volume":"21","author":"M. J. Atallah","year":"1988","unstructured":"M. J. Atallah, G. K. Manacher and J. Urrutia, \"Finding a minimum independent dominating set in a permutation graph\", Discrete Applied Math. 21(3), 1988,177\u2013183.","journal-title":"Discrete Applied Math."},{"key":"12_CR2","unstructured":"J. L. Bently, \"Algorithms for Klee's rectangle problems\", Carnegie-Mellon University, Pittsburg, Penn., Department of Computer Science, uunpublished notes, 1977."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(87)90128-9","volume":"54","author":"A. Brandstadt","year":"1987","unstructured":"A. Brandstadt and D. Kratsch, \"On domination problems for permutation and other graphs\", Theoretical Computer Science 54, 1987, 181\u2013198.","journal-title":"Theoretical Computer Science"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","volume":"6","author":"M. Farber","year":"1985","unstructured":"M. Farber and J. M. Keil, \"Domination in permutation graphs\", J. Algorithm 6 1985, 309\u2013321.","journal-title":"J. Algorithm"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"J. Spinrad, \"Transitive orientation in O(n 2) time\", Proc. 15th Annual ACM Symp. on Theory of Computing, 1983, 457\u2013466.","DOI":"10.1145\/800061.808777"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas Van","year":"1977","unstructured":"P. Van Emde Boas, \"Preserving order in a forest in less than logarithmic time and linear space\", Information Processing Letter 6(3), 1977, 80\u201382.","journal-title":"Information Processing Letter"}],"container-title":["Lecture Notes in Computer Science","Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52921-7_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:45Z","timestamp":1605648345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52921-7_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540529217","9783540471776"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-52921-7_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}