{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T21:10:08Z","timestamp":1750972208888,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_30","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:06:22Z","timestamp":1509516382000},"page":"399-411","source":"Crossref","is-referenced-by-count":1,"title":["New Results on Weighted Independent Domination"],"prefix":"10.1007","author":[{"given":"Vadim","family":"Lozin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitriy","family":"Malyshev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viktor","family":"Zamaraev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230190206","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19, 247\u2013253 (1989)","journal-title":"Networks"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2005.09.026","volume":"349","author":"HL Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Brandst\u00e4dt, A., Kratsch, D., Rao, M., Spinrad, J.: On algorithms for $$(P_5, gem)$$ ( P 5 , g e m ) -free graphs. Theoret. Comput. Sci. 349, 2\u201321 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0304-3975(02)00586-8","volume":"301","author":"R Boliac","year":"2003","unstructured":"Boliac, R., Lozin, V.: Independent domination in finitely defined classes of graphs. Theoret. Comput. Sci. 301, 271\u2013284 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.dam.2003.05.004","volume":"143","author":"GJ Chang","year":"2004","unstructured":"Chang, G.J.: The weighted independent domination problem is NP-complete for chordal graphs. Discret. Appl. Math. 143, 351\u2013352 (2004)","journal-title":"Discret. Appl. Math."},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P., Muller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Process. Lett. 36, 231\u2013236 (1990)","journal-title":"Inf. Process. Lett."},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","volume":"1","author":"M Farber","year":"1982","unstructured":"Farber, M.: Independent domination in chordal graphs. Oper. Res. Lett. 1, 134\u2013138 (1982)","journal-title":"Oper. Res. Lett."},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","volume":"80","author":"V Giakoumakis","year":"1997","unstructured":"Giakoumakis, V., Rusu, I.: Weighted parameters in $$(P_5,\\overline{P}_5)$$ ( P 5 , P \u00af 5 ) -free graphs. Discret. Appl. Math. 80, 255\u2013261 (1997)","journal-title":"Discret. Appl. Math."},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.tcs.2013.11.019","volume":"516","author":"T Karthick","year":"2014","unstructured":"Karthick, T.: On atomic structure of $$P_5$$ P 5 -free subclasses and maximum weight independent set problem. Theoret. Comput. Sci. 516, 78\u201385 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Lokshantov, D., Vatshelle, M., Villanger, Y.: Independent set in $$P_5$$ P 5 -free graphs in polynomial time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 570\u2013581 (2014)","DOI":"10.1137\/1.9781611973402.43"},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.dam.2013.08.030","volume":"182","author":"V Lozin","year":"2015","unstructured":"Lozin, V., Mosca, R., Purcell, C.: Independent domination in finitely defined classes of graphs: polynomial algorithms. Discret. Appl. Math. 182, 2\u201314 (2015)","journal-title":"Discret. Appl. Math."},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discret. Math. 201, 189\u2013241 (1999)","journal-title":"Discret. Math."},{"key":"30_CR12","first-page":"257","volume":"19","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discret. Math. 19, 257\u2013356 (1984)","journal-title":"Ann. Discret. Math."},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","volume":"12","author":"SH Whitesides","year":"1981","unstructured":"Whitesides, S.H.: An algorithm for finding clique cut-sets. Inf. Process. Lett. 12, 31\u201332 (1981)","journal-title":"Inf. Process. Lett."},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38, 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."},{"key":"30_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.tcs.2005.08.038","volume":"352","author":"IE Zverovich","year":"2006","unstructured":"Zverovich, I.E.: Satgraphs and independent domination. Part 1. Theoret. Comput. Sci. 352, 47\u201356 (2006)","journal-title":"Theoret. Comput. Sci."}],"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-319-68705-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T20:35:09Z","timestamp":1750970109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}