{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T16:21:17Z","timestamp":1722702077048},"reference-count":12,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0304-3975(87)90067-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"257-265","source":"Crossref","is-referenced-by-count":97,"title":["The NP-completeness of steiner tree and dominating set for chordal bipartite graphs"],"prefix":"10.1016","volume":"53","author":[{"given":"Haiko","family":"M\u00fcller","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90067-3_BIB1","unstructured":"G. Ausiello, Personal communication, FCT '85"},{"key":"10.1016\/0304-3975(87)90067-3_BIB2","series-title":"Research Report CS-85-02","article-title":"Permutation graphs: connected domination and Steiner trees","author":"Colbourn","year":"1985"},{"key":"10.1016\/0304-3975(87)90067-3_BIB3","series-title":"Proc. of the FCT '85 Conf.","first-page":"53","article-title":"On the restriction of some NP-complete graph problems to permutation graphs","volume":"199","author":"Brandst\u00e4dt","year":"1985"},{"issue":"2, 3","key":"10.1016\/0304-3975(87)90067-3_BIB4","article-title":"On domination problems for permutations and other graphs","volume":"54","author":"Brandst\u00e4dt","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90067-3_BIB5","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\/0304-3975(87)90067-3_BIB6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(87)90067-3_BIB7","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0304-3975(87)90067-3_BIB8","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(87)90067-3_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(87)90067-3_BIB10","series-title":"Techn. Report 428","article-title":"NP-completeness of total and connected domination and irredundance for bipartite graphs","author":"Pfaff","year":"1983"},{"key":"10.1016\/0304-3975(87)90067-3_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite permutation graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discr. Appl. Math."},{"key":"10.1016\/0304-3975(87)90067-3_BIB12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230150109","article-title":"Steiner trees, connected domination and strongly chordal graphs","volume":"15","author":"White","year":"1985","journal-title":"Networks"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900673?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900673?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:46Z","timestamp":1555127566000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900673"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90067-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}