{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:56:45Z","timestamp":1725638205551},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_66","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"643-652","source":"Crossref","is-referenced-by-count":5,"title":["Parameterized Complexity of the Firefighter Problem"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morgan","family":"Chopin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_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":"66_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-540-70575-8_46","volume-title":"Automata, Languages and Programming","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On Problems without Polynomial Kernels. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 563\u2013574. Springer, Heidelberg (2008)"},{"key":"66_CR3","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)"},{"issue":"3","key":"66_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1051\/ita\/1992260302571","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. III. tree-decompositions, minors and complexity issues. RAIRO Informatique Th\u00e9orique Appliqu\u00e9e\u00a026(3), 257\u2013286 (1992)","journal-title":"RAIRO Informatique Th\u00e9orique Appliqu\u00e9e"},{"key":"66_CR5","unstructured":"Cygan, M., Fomin, F., Van Leeuwen, E.J.: Parameterized complexity of firefighting revisited. In: Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC 2011) (to appear, 2011)"},{"key":"66_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)"},{"key":"66_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.tcs.2005.10.005","volume":"351","author":"M.R. Fellows","year":"2006","unstructured":"Fellows, M.R., Szeider, S., Wrightson, G.: On finding short resolution refutations and small unsatisfiable subsets. Theoretical Computer Science\u00a0351, 351\u2013359 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"16","key":"66_CR8","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 Mathematics\u00a0307(16), 2094\u20132105 (2007)","journal-title":"Discrete Mathematics"},{"key":"66_CR9","volume-title":"Parameterized complexity theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer, Heidelberg (2006)"},{"key":"66_CR10","volume-title":"10th Conference on Numerical Mathematics and Computing","author":"B. Hartnell","year":"1995","unstructured":"Hartnell, B.: Firefighter! an application of domination, Presentation. In: 10th Conference on Numerical Mathematics and Computing. University of Manitoba in Winnipeg, Canada (1995)"},{"issue":"3","key":"66_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.disc.2009.05.007","volume":"310","author":"A. King","year":"2010","unstructured":"King, A., MacGillivray, G.: The firefighter problem for cubic graphs. Discrete Mathematics\u00a0310(3), 614\u2013621 (2010)","journal-title":"Discrete Mathematics"},{"key":"66_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-85097-7_2","volume-title":"Combinatorial Optimization and Applications","author":"L. Mathieson","year":"2008","unstructured":"Mathieson, L., Szeider, S.: Parameterized Graph Editing with Chosen Vertex Degrees. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 13\u201322. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T00:33:37Z","timestamp":1555720417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}