{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:39:21Z","timestamp":1743035961701,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"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-53536-3_4","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T16:39:25Z","timestamp":1474994365000},"page":"38-49","source":"Crossref","is-referenced-by-count":4,"title":["Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"key":"4_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 (B) 15, 289\u2013296 (1973)","journal-title":"J. Comb. Theory (B)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A.: Weighted efficient domination for $$P_5$$ -free graphs in linear time. CoRR arXiv:1507.06765v1 (2015)","DOI":"10.1007\/978-3-662-53536-3_4"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Eschen, E.M., Friese, E.: Efficient domination for some subclasses of $$P_6$$ -free graphs in polynomial time. In: Extended Abstract to Appear in the Conference Proceedings of WG 2015. Full version: CoRR arXiv:1503.00091v1 (2015)","DOI":"10.1007\/978-3-662-53174-7_6"},{"key":"4_CR4","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":"4_CR5","unstructured":"Brandst\u00e4dt, A., Giakoumakis, V.: Weighted efficient domination for $$(P_5+kP_2)$$ -free graphs in polynomial time. CoRR arXiv:1407.4593v1 (2014)"},{"key":"4_CR6","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":"4_CR7","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Weighted efficient domination for $$P_6$$ -free graphs in polynomial time. CoRR arXiv:1508.07733v1 (2015). (based on a manuscript by R. Mosca, Weighted Efficient Domination for $$P_6$$ -Free Graphs, July 2015)","DOI":"10.1007\/978-3-662-53536-3_4"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.dam.2013.08.011","volume":"162","author":"E Eschen","year":"2014","unstructured":"Eschen, E., Wang, X.: Algorithms for unipolar and generalized split graphs. Discrete Appl. Math. 162, 195\u2013201 (2014)","journal-title":"Discrete Appl. Math."},{"key":"4_CR9","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":"4_CR10","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Pilipczuk, M., van Leeuwen, E.J.: Independence and efficient domination on $$P_6$$ -free graphs. In: Conference Proceedings SODA 2016, pp. 1784\u20131803. CoRR arXiv:1507.02163v2 (2015)","DOI":"10.1137\/1.9781611974331.ch124"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"46","DOI":"10.3390\/a8010046","volume":"8","author":"C McDiarmid","year":"2015","unstructured":"McDiarmid, C., Yolov, N.: Recognition of unipolar and generalized split graphs. Algorithms 8, 46\u201359 (2015)","journal-title":"Algorithms"},{"key":"4_CR12","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 Theory 73, 400\u2013424 (2013)","journal-title":"J. Graph Theory"}],"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-53536-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T08:09:24Z","timestamp":1657354164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}