{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:56Z","timestamp":1759638896376},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,10]],"date-time":"2012-11-10T00:00:00Z","timestamp":1352505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00453-012-9709-4","type":"journal-article","created":{"date-parts":[[2012,11,9]],"date-time":"2012-11-09T16:34:57Z","timestamp":1352478897000},"page":"998-1018","source":"Crossref","is-referenced-by-count":14,"title":["Dominating Induced Matchings for P 7-Free Graphs in Linear Time"],"prefix":"10.1007","volume":"68","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":[[2012,11,10]]},"reference":[{"key":"9709_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"9709_CR2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.-J. Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory 41, 182\u2013208 (1986)","journal-title":"J. Comb. Theory"},{"key":"9709_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2005.09.026","volume":"349","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Brandst\u00e4dt, A., Kratsch, D., Rao, M., Spinrad, J.: On algorithms for (P 5, gem)-free graphs. Theor. Comput. Sci. 349, 2\u201321 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9709_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1007\/978-3-642-12200-2_56","volume-title":"Polynomial Time, Conference Proceedings LATIN 2010","author":"A. Brandst\u00e4dt","year":"2010","unstructured":"Brandst\u00e4dt, A., Hundt, C., Nevries, R.: Efficient Edge Domination on Hole-Free graphs. In: Polynomial Time, Conference Proceedings LATIN 2010. Lecture Notes in Computer Science, vol.\u00a06034, pp.\u00a0650\u2013661 (2010)"},{"key":"9709_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.dam.2004.01.009","volume":"145","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the structure of (P 5, gem)-free graphs. Discrete Appl. Math. 145, 155\u2013166 (2005)","journal-title":"Discrete Appl. Math."},{"key":"9709_CR6","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.dam.2004.01.014","volume":"145","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Le, H.-O., Mosca, R.: Chordal co-gem-free and (P 5, gem)-free graphs have bounded clique-width. Discrete Appl. Math. 145, 232\u2013241 (2005)","journal-title":"Discrete Appl. Math."},{"key":"9709_CR7","unstructured":"Brandst\u00e4dt, A., Leitert, A., Rautenbach, D.: Efficient dominating and edge dominating sets for graphs and hypergraphs (2012). Extended abstract accepted for ISAAC 2012, Taiwan. arXiv:1207.0953v2 [cs.DM]"},{"issue":"4","key":"9709_CR8","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1137\/060664690","volume":"22","author":"A. Bretscher","year":"2008","unstructured":"Bretscher, A., Corneil, D.G., Habib, M., Paul, Ch.: A simple linear time LexBFS cograph recognition algorithm. SIAM J. Discrete Math. 22(4), 1277\u20131296 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"9709_CR9","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.dam.2010.03.011","volume":"159","author":"D.M. 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":"9709_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-642-02029-2_8","volume-title":"\u201cGraph Theory, Computational Intelligence and Thought\u201d, A\u00a0Conference Celebrating Marty Golumbic\u2019s 60th Birthday","author":"D.M. Cardoso","year":"2009","unstructured":"Cardoso, D.M., Lozin, V.V.: Dominating induced matchings. In: \u201cGraph Theory, Computational Intelligence and Thought\u201d, A\u00a0Conference Celebrating Marty Golumbic\u2019s 60th Birthday, Jerusalem, Tiberias, Haifa, 2008. Lecture Notes in Computer Science, vol. 5420, pp. 77\u201386 (2009)"},{"key":"9709_CR11","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"9709_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. Theory Comput. Syst. 33, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"9709_CR13","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci. 11, 423\u2013443 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9709_CR14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(93)90084-M","volume":"48","author":"D.L. 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."},{"issue":"6","key":"9709_CR15","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient algorithms for graph manipulation [H]. Commun. ACM 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"key":"9709_CR16","first-page":"222","volume-title":"Proceedings 3rd Conf. on Hypercube Concurrent Computers and Applications","author":"M. Livingston","year":"1988","unstructured":"Livingston, M., Stout, Q.: Distributing resources in hypercube computers. In: Proceedings 3rd Conf. on Hypercube Concurrent Computers and Applications, pp. 222\u2013231 (1988)"},{"issue":"3","key":"9709_CR17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0166-218X(01)00198-6","volume":"119","author":"C.L. 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":"9709_CR18","unstructured":"Lu, C.L., Tang, C.Y.: Efficient domination in bipartite graphs. Manuscript (1997)"},{"key":"9709_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math. 201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"9709_CR20","series-title":"Fields Institute Monographs","doi-asserted-by":"crossref","DOI":"10.1090\/fim\/019","volume-title":"Efficient Graph Representations","author":"J.P. Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs. Am. Math. Soc., Providence (2003)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9709-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9709-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9709-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:10Z","timestamp":1559137510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9709-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,10]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9709"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9709-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2012,11,10]]}}}