{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:45Z","timestamp":1759638945735},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,4,25]],"date-time":"2016-04-25T00:00:00Z","timestamp":1461542400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00453-016-0150-y","type":"journal-article","created":{"date-parts":[[2016,4,25]],"date-time":"2016-04-25T10:11:41Z","timestamp":1461579101000},"page":"1283-1302","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Finding Dominating Induced Matchings in $$P_8$$ P 8 -Free Graphs in Polynomial Time"],"prefix":"10.1007","volume":"77","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,25]]},"reference":[{"key":"150_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","volume":"15","author":"N Biggs","year":"1973","unstructured":"Biggs, N.: Perfect codes in graphs. J. Comb. Theory Ser. B 15, 289\u2013296 (1973)","journal-title":"J. Comb. Theory Ser. B"},{"key":"150_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Hundt, C., Nevries, R.: Efficient edge domination on hole-free graphs in polynomial time. In: Conference Proceedings LATIN 2010. Lecture Notes in Computer Science, vol. 6034, pp. 650\u2013661 (2010)","DOI":"10.1007\/978-3-642-12200-2_56"},{"key":"150_CR3","unstructured":"Brandst\u00e4dt, A., Leitert, A., Rautenbach, D.: Efficient dominating and edge dominating sets for graphs and hypergraphs, extended abstract. In: Conference Proceedings ISAAC 2012, Taiwan. Lecture Notes in Computer Science, vol. 7676, pp. 267\u2013277 (2012). Full version: arXiv:1207.0953v2 [cs.DM]"},{"key":"150_CR4","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1007\/s00453-012-9709-4","volume":"68","author":"A Brandst\u00e4dt","year":"2014","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Dominating induced matchings for $$P_7$$ P 7 -free graphs in linear time. Algorithmica 68, 998\u20131018 (2014)","journal-title":"Algorithmica"},{"key":"150_CR5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0012-365X(02)00803-8","volume":"266","author":"K Cameron","year":"2003","unstructured":"Cameron, K., Sritharan, R., Tang, Y.: Finding a maximum induced matching in weakly chordal graphs. Discrete Math. 266, 133\u2013142 (2003)","journal-title":"Discrete Math."},{"key":"150_CR6","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.dam.2010.03.011","volume":"159","author":"DM Cardoso","year":"2011","unstructured":"Cardoso, D.M., Korpelainen, N., Lozin, V.V.: On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Appl. Math. 159, 521\u2013531 (2011)","journal-title":"Discrete Appl. Math."},{"key":"150_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(93)90084-M","volume":"48","author":"DL Grinstead","year":"1993","unstructured":"Grinstead, D.L., Slater, P.L., Sherwani, N.A., Holmes, N.D.: Efficient edge domination problems in graphs. Inf. Process. Lett. 48, 221\u2013228 (1993)","journal-title":"Inf. Process. Lett."},{"key":"150_CR8","unstructured":"Hertz, A., Lozin, V.V., Ries, B., Zamaraev, V., de Werra, D.: Dominating induced matchings in graphs containing no long claw. (2015). arXiv:1505.02558"},{"key":"150_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jda.2013.11.002","volume":"26","author":"N Korpelainen","year":"2014","unstructured":"Korpelainen, N., Lozin, V.V., Purcell, C.: Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms 26, 45\u201355 (2014)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"150_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0166-218X(01)00198-6","volume":"119","author":"CL Lu","year":"2002","unstructured":"Lu, C.L., Ko, M.-T., Tang, C.Y.: Perfect edge domination and efficient edge domination in graphs. Discrete Appl. Math. 119(3), 227\u2013250 (2002)","journal-title":"Discrete Appl. Math."},{"key":"150_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0166-218X(98)00057-2","volume":"87","author":"CL Lu","year":"1998","unstructured":"Lu, C.L., Tang, C.Y.: Solving the weighted efficient edge domination problem on bipartite permutation graphs. Discrete Appl. Math. 87, 203\u2013211 (1998)","journal-title":"Discrete Appl. Math."},{"key":"150_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(93)E0161-Q","volume":"59","author":"JP Spinrad","year":"1995","unstructured":"Spinrad, J.P., Sritharan, R.: Algorithms for weakly triangulated graphs. Discrete Appl. Math. 59, 181\u2013191 (1995)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0150-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0150-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0150-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0150-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:24Z","timestamp":1559072844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0150-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,25]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0150-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,25]]}}}