D. Adjiashvili, A. Baggio, and R. Zenklusen, Firefighting on Trees Beyond Integrality Gaps, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2016.
DOI : 10.1137/1.9781611974782.156
URL : http://arxiv.org/abs/1601.00271

E. Anshelevich, D. Chakrabarty, A. Hate, and C. Swamy, Approximability of the Firefighter Problem, Algorithmica, vol.393, issue.2, pp.520-536, 2012.
DOI : 10.1007/s00453-010-9469-y

C. Bazgan, M. Chopin, M. Cygan, M. R. Fellows, F. V. Fomin et al., Parameterized complexity of firefighting, Journal of Computer and System Sciences, vol.80, issue.7, pp.1285-1297, 2014.
DOI : 10.1016/j.jcss.2014.03.001
URL : https://hal.archives-ouvertes.fr/hal-01505557

C. Bazgan, M. Chopin, and B. Ries, The firefighter problem with more than one firefighter on trees, Discrete Applied Mathematics, vol.161, issue.7-8, pp.899-908, 2013.
DOI : 10.1016/j.dam.2012.11.011
URL : https://hal.archives-ouvertes.fr/hal-01505574

H. L. Bodlaender, Classes of graphs with bounded tree-width, Bulletin of EATCS, pp.116-128, 1988.

L. Cai, Parameterized Complexity of Cardinality Constrained Optimization Problems, The Computer Journal, vol.51, issue.1, pp.102-121, 2008.
DOI : 10.1093/comjnl/bxm086
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.7121

L. Cai, E. Verbin, and L. Yang, Firefighting on Trees: (1?????????1/e)???Approximation, Fixed Parameter Tractability and a Subexponential Algorithm, Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC '08), pp.258-269, 2008.
DOI : 10.1007/978-3-540-92182-0_25

P. Chalermsook and D. Vaz, New Integrality Gap Results for the Firefighters Problem on Trees, 2016.
DOI : 10.1007/978-3-319-13524-3_15

J. Chlebíková and M. Chopin, The Firefighter Problem: A Structural Analysis, Proceedings of the 9th International Symposium on Parameterized and Exact Computation (IPEC2014), pp.172-183, 2014.
DOI : 10.1007/978-3-319-13524-3_15

F. R. Chung and P. D. Seymour, Graphs with Small Bandwidth and Cutwidth, Graph Theory and combinatorics 1988 Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös, pp.113-119, 1989.
DOI : 10.1016/S0167-5060(08)70571-5
URL : http://doi.org/10.1016/0012-365x(89)90083-6

V. Costa, S. Dantas, M. C. Dourado, L. Penso, and D. Rautenbach, More fires and more fighters, Discrete Applied Mathematics, vol.161, issue.16-17, pp.16-172410, 2013.
DOI : 10.1016/j.dam.2013.04.008

M. Develin and S. G. Hartke, Fire containment in grids of dimension three and higher, Discrete Applied Mathematics, vol.155, issue.17, pp.2257-2268, 2007.
DOI : 10.1016/j.dam.2007.06.002

M. Doucha and J. Kratochvíl, Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width, Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS '12), pp.348-359, 2012.
DOI : 10.1007/978-3-642-32589-2_32

S. Finbow, A. King, G. Macgillivray, and R. Rizzi, The firefighter problem for graphs of maximum degree three, Discrete Mathematics, vol.307, issue.16, pp.2094-2105, 2007.
DOI : 10.1016/j.disc.2005.12.053

F. Fomin, P. Heggernes, and E. J. Van-leeuwen, Making Life Easier for Firefighters, Proceedings of the 6th International conference on Fun with Algorithms (FUN '12), pp.177-188, 2012.
DOI : 10.1007/978-3-642-30347-0_19

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

B. Hartnell and Q. Li, Firefighting on trees: how bad is the greedy algorithm? Congressus Numerantium, pp.187-192, 2000.

F. Hüffner, C. Komusiewicz, H. Moser, and R. Niedermeier, Fixed-Parameter Algorithms for??Cluster Vertex Deletion, Theory of Computing Systems, vol.144, issue.1???2, pp.196-217, 2010.
DOI : 10.1007/s00224-008-9150-x

Y. Iwaikawa, N. Kamiyama, and T. Matsui, Improved Approximation Algorithms for Firefighter Problem on Trees, IEICE Transactions on Information and Systems, vol.94, issue.2, pp.196-199, 2011.
DOI : 10.1587/transinf.E94.D.196

A. King and G. Macgillivray, The firefighter problem for cubic graphs, Discrete Mathematics, vol.310, issue.3, pp.614-621, 2010.
DOI : 10.1016/j.disc.2009.05.007

E. Korach and N. Solel, Tree-width, path-width, and cutwidth, Discrete Applied Mathematics, vol.43, issue.1, pp.97-101, 1993.
DOI : 10.1016/0166-218X(93)90171-J
URL : http://doi.org/10.1016/0166-218x(93)90171-j

G. Macgillivray and P. Wang, On the firefighter problem, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.47, pp.83-96, 2003.

K. L. Ng and P. Raff, A generalization of the firefighter problem on <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi mathvariant="double-struck">z</mml:mi><mml:mo>??</mml:mo><mml:mi mathvariant="double-struck">z</mml:mi></mml:math>, Discrete Applied Mathematics, vol.156, issue.5, pp.730-745, 2008.
DOI : 10.1016/j.dam.2007.08.011