{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:18:21Z","timestamp":1725891501478},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303463"},{"type":"electronic","value":"9783642303470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30347-0_19","type":"book-chapter","created":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T02:27:55Z","timestamp":1338431275000},"page":"177-188","source":"Crossref","is-referenced-by-count":5,"title":["Making Life Easier for Firefighters"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1007\/978-3-642-10631-6_98","volume-title":"Algorithms and Computation","author":"E. Anshelevich","year":"2009","unstructured":"Anshelevich, E., Chakrabarty, D., Hate, A., Swamy, C.: Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 974\u2013983. Springer, Heidelberg (2009)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-25591-5_66","volume-title":"Algorithms and Computation","author":"C. Bazgan","year":"2011","unstructured":"Bazgan, C., Chopin, M., Fellows, M.R.: Parameterized Complexity of the Firefighter Problem. In: Asano, T., Nakano, S.-I., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 643\u2013652. Springer, Heidelberg (2011)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0166-218X(02)00414-6","volume":"131","author":"V. Bouchitt\u00e9","year":"2003","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Approximating the treewidth of AT-free graphs. Discrete Applied Math.\u00a0131, 11\u201337 (2003)","journal-title":"Discrete Applied Math."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10692760_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H. Broersma","year":"1998","unstructured":"Broersma, H., Kloks, T., Kratsch, D., M\u00fcller, H.: A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol.\u00a01517, pp. 88\u201399. Springer, Heidelberg (1998)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-92182-0_25","volume-title":"Algorithms and Computation","author":"L. Cai","year":"2008","unstructured":"Cai, L., Verbin, E., Yang, L.: Firefighting on Trees (1 \u2212 1\/e)\u2013Approximation, Fixed Parameter Tractability and a Subexponential Algorithm. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 258\u2013269. Springer, Heidelberg (2008)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Chuzhoy, J.: Resource minimization for fire containment. In: SODA 2010, pp. 1334\u20131349. SIAM (2010)","DOI":"10.1137\/1.9781611973075.108"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-28050-4_2","volume-title":"Parameterized and Exact Computation","author":"M. Cygan","year":"2012","unstructured":"Cygan, M., Fomin, F.V., van Leeuwen, E.J.: Parameterized Complexity of Firefighting Revisited. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol.\u00a07112, pp. 13\u201326. Springer, Heidelberg (2012)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"16","key":"19_CR10","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.disc.2005.12.053","volume":"307","author":"S. Finbow","year":"2007","unstructured":"Finbow, S., King, A., MacGillivray, G., Rizzi, R.: The firefighter problem for graphs of maximum degree three. Discrete Math.\u00a0307(16), 2094\u20132105 (2007)","journal-title":"Discrete Math."},{"key":"19_CR11","first-page":"57","volume":"43","author":"S. Finbow","year":"2009","unstructured":"Finbow, S., MacGillivray, G.: The firefighter problem: a survey of results, directions and questions. Australas J. Combin.\u00a043, 57\u201377 (2009)","journal-title":"Australas J. Combin."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a057. North-Holland Publishing Co. (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"19_CR13","unstructured":"Hartnell, B.L.: Firefighter! an application of domination. In: 25th Manitoba Conference on Combinatorial Mathematics and Computing (1995)"},{"key":"19_CR14","unstructured":"Hartnell, B.L., Li, Q.: Firefighting on trees: how bad is the greedy algorithm? In: Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congr. Numer., vol. 145, pp. 187\u2013192 (2000)"},{"key":"19_CR15","first-page":"83","volume":"47","author":"G. MacGillivray","year":"2003","unstructured":"MacGillivray, G., Wang, P.: On the firefighter problem. J. Combin. Math. Combin. Comput.\u00a047, 83\u201396 (2003)","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30347-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T07:51:38Z","timestamp":1561794698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30347-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303463","9783642303470"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30347-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}