{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T20:49:13Z","timestamp":1771879753805,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540310006","type":"print"},{"value":"9783540314684","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_17","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"187-198","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Pinar","family":"Heggernes","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J. Bar-Ilan","year":"1993","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. J. Algorithms\u00a015, 385\u2013415 (1993)","journal-title":"J. Algorithms"},{"key":"17_CR2","unstructured":"Berge, C.: Theory of Graphs and its Applications, Collection Universitaire de Mathematiques, vol.\u00a02, Dunod, Paris (1958)"},{"key":"17_CR3","first-page":"55","volume":"169","author":"J.R.S. Blair","year":"2004","unstructured":"Blair, J.R.S., Heggernes, P., Horton, S., Manne, F.: Broadcast domination algorithms for interval graphs, series-parallel graphs, and trees. Congressus Numerantium\u00a0169, 55\u201377 (2004)","journal-title":"Congressus Numerantium"},{"key":"17_CR4","unstructured":"Dunbar, J.E., Erwin, D.J., Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T.: Broadcasts in graphs (2002) (Submitted)"},{"key":"17_CR5","first-page":"89","volume":"42","author":"D.J. Erwin","year":"2004","unstructured":"Erwin, D.J.: Dominating broadcasts in graphs. Bull. Inst. Comb. Appl.\u00a042, 89\u2013105 (2004)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"17_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., New York (1978)"},{"key":"17_CR7","volume-title":"Domination in Graphs: Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"17_CR8","volume-title":"Fundamentals of Domination in Graphs","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"17_CR9","first-page":"321","volume-title":"Domination in Graphs: Advanced Topics","author":"M.A. Henning","year":"1998","unstructured":"Henning, M.A.: Distance domination in graphs. In: Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.) Domination in Graphs: Advanced Topics, pp. 321\u2013349. Marcel Dekker, New York (1998)"},{"key":"17_CR10","unstructured":"Horton, S.B., Meneses, C.N., Mukherjee, A., Ulucakli, M.E.: A computational study of the broadcast domination problem. Technical Report 2004-45, DIMACS Center for Discrete Mathematics and Theoretical Computer Science (2004)"},{"key":"17_CR11","volume-title":"Introduction to Combinatorial Mathematics","author":"C.L. Liu","year":"1968","unstructured":"Liu, C.L.: Introduction to Combinatorial Mathematics. McGraw-Hill, New York (1968)"},{"key":"17_CR12","series-title":"American Mathematical Society Publications","volume-title":"Theory of Graphs","author":"O. Ore","year":"1962","unstructured":"Ore, O.: Theory of Graphs. American Mathematical Society Publications, vol.\u00a038. AMS, Providence (1962)"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/321958.321964","volume":"23","author":"P.J. Slater","year":"1976","unstructured":"Slater, P.J.: R-domination in graphs. J. Assoc. Comput. Mach.\u00a023, 446\u2013450 (1976)","journal-title":"J. Assoc. Comput. Mach."}],"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\/11604686_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:19Z","timestamp":1619507059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11604686_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}