{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:42Z","timestamp":1759063482728},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_6","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"78-89","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elaine M.","family":"Eschen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Friese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Eschen, E.M., Friese, E.: Efficient domination for some subclasses\u00a0of $$P_6$$ -free graphs in polynomial time, arXiv:1503.00091v1 (2015)","DOI":"10.1007\/978-3-662-53174-7_6"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.ipl.2014.09.024","volume":"115","author":"A Brandst\u00e4dt","year":"2015","unstructured":"Brandst\u00e4dt, A., Fi\u010dur, P., Leitert, A., Milani\u010d, M.: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. 115, 256\u2013262 (2015)","journal-title":"Inf. Process. Lett."},{"key":"6_CR3","unstructured":"Brandst\u00e4dt, A., Giakoumakis, V.: Weighted efficient domination for $$(P_5+kP_2)$$ -free graphs in polynomial time, arXiv:1407.4593v1 (2014)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Karthick, T., Weighted efficient domination in classes of $$P_6$$ -free graphs, arXiv:1503.06025v1 (2015)","DOI":"10.1016\/j.dam.2015.07.032"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. In: SIAM Monographs on Discrete Mathematics Application, vol. 3. SIAM, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-3-642-35261-4_30","volume-title":"Algorithms and Computation","author":"A Brandst\u00e4dt","year":"2012","unstructured":"Brandst\u00e4dt, A., Leitert, A., Rautenbach, D.: Efficient dominating and edge dominating sets for graphs and hypergraphs. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 267\u2013277. Springer, Heidelberg (2012)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-642-40313-2_19","volume-title":"Mathematical Foundations of Computer Science 2013","author":"A Brandst\u00e4dt","year":"2013","unstructured":"Brandst\u00e4dt, A., Milani\u010d, M., Nevries, R.: New polynomial cases of the weighted efficient domination problem. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 195\u2013206. Springer, Heidelberg (2013)"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"6_CR9","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of 5th British Combinatorial Conference 1976, Aberdeen, Congressus Numerantium No. XV, pp. 211\u2013226 (1975)"},{"key":"6_CR10","unstructured":"Friese, E.: Das efficient-domination-problem auf $$P_6$$ -freien graphen, Master Thesis. University of Rostock, Germany (2013) (in German)"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"6_CR12","unstructured":"Karthick, T.: Weighted Efficient Domination for Certain Classes of $$P_6$$ -free Graphs, Manuscript (2015)"},{"key":"6_CR13","volume-title":"Computers and Intractability - A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"6_CR14","unstructured":"Leitert, A.: Das dominating induced matching problem f\u00fcr azyklische hypergraphen, Diploma Thesis. University of Rostock, Germany (2012) (in German)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Pilipczuk, M., van Leeuwen, E.J.: Independence and efficient domination on P6-free graphs, arXiv:1507.02163v1 (2015)","DOI":"10.1137\/1.9781611974331.ch124"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1002\/jgt.21685","volume":"73","author":"M Milani\u010d","year":"2013","unstructured":"Milani\u010d, M.: Hereditary efficiently dominatable graphs. J. Graph Theor. 73, 400\u2013424 (2013)","journal-title":"J. Graph Theor."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T19:47:55Z","timestamp":1600976875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}