{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T11:51:46Z","timestamp":1781524306292,"version":"3.54.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,8]],"date-time":"2012-11-08T00:00:00Z","timestamp":1352332800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00373-012-1253-0","type":"journal-article","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T10:46:38Z","timestamp":1352285198000},"page":"83-100","source":"Crossref","is-referenced-by-count":8,"title":["On the Broadcast Independence Number of Grid Graph"],"prefix":"10.1007","volume":"30","author":[{"given":"Isma","family":"Bouchemakh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Zemir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,11,8]]},"reference":[{"key":"1253_CR1","unstructured":"Bouchemakh, I., Boumali, A.: Broadcast domination number of the cross product of paths. In: ODSA 2010 Conference, Universit\u00e4t Rostock, September 13\u201315 (2010)"},{"key":"1253_CR2","first-page":"55","volume":"169","author":"J.R.S. Blair","year":"2004","unstructured":"Blair J.R.S., Heggernes P., Horton S.B., Maine F.: Broadcast domination algorithms for interval graphs, series\u2013parallel graphs and trees. Congr. Num. 169, 55\u201377 (2004)","journal-title":"Congr. Num."},{"key":"1253_CR3","doi-asserted-by":"crossref","unstructured":"Cockayne, E.J., Herke, S., Mynhardt, C.M.: Broadcasts and domination in trees. Discrete Math. (2009). doi: 10.1016\/j.disc.2009.12.012","DOI":"10.1016\/j.disc.2009.12.012"},{"issue":"2","key":"1253_CR4","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1002\/net.20275","volume":"53","author":"J. Dabney","year":"2009","unstructured":"Dabney J., Dean B.C., Hedetniemi S.T.: A linear-time algorithm for broadcast domination in a tree. Networks 53(2), 160\u2013169 (2009)","journal-title":"Networks"},{"key":"1253_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.dam.2005.07.009","volume":"154","author":"J.E. Dunbar","year":"2006","unstructured":"Dunbar J.E., Erwin D.J., Haynes T.W., Hedetniemi S.M., Hedetniemi S.T.: Broadcasts in graphs. Discrete Appl. Math. 154, 59\u201375 (2006)","journal-title":"Discrete Appl. Math."},{"key":"1253_CR6","unstructured":"Erwin, D.: Cost domination in graphs. Dissertation, Western Michigan University (2001)"},{"key":"1253_CR7","first-page":"89","volume":"42","author":"D. Erwin","year":"2004","unstructured":"Erwin D.: Dominating broadcasts in graphs. Bull. Inst. Combin. Appl. 42, 89\u2013105 (2004)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1253_CR8","doi-asserted-by":"crossref","first-page":"3267","DOI":"10.1016\/j.disc.2006.06.013","volume":"36","author":"P. Heggernes","year":"2006","unstructured":"Heggernes P., Lokshtanov D.: Optimal broadcast domination in polynomial time. Discrete Math. 36, 3267\u20133280 (2006)","journal-title":"Discrete Math."},{"key":"1253_CR9","doi-asserted-by":"crossref","first-page":"5950","DOI":"10.1016\/j.disc.2009.04.024","volume":"309","author":"S. Herke","year":"2009","unstructured":"Herke S., Mynhardt C.M.: Radial trees. Discrete Math. 309, 5950\u20135962 (2009)","journal-title":"Discrete Math."},{"key":"1253_CR10","unstructured":"Seager, S.M.: Dominating Broadcasts of Caterpillars, Ars Comb. 88 (2008)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1253-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1253-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1253-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:34Z","timestamp":1559055574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1253-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,8]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1253"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1253-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,8]]}}}