J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier, Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs, Algorithmica, vol.33, issue.4, pp.461-493, 2002.
DOI : 10.1007/s00453-001-0116-5

N. Alon, F. V. Fomin, G. Gutin, M. Krivelevich, and S. Saurabh, Spanning Directed Trees with Many Leaves, SIAM Journal on Discrete Mathematics, vol.23, issue.1, pp.466-476, 2009.
DOI : 10.1137/070710494

N. Alon, D. Lokshtanov, and S. Saurabh, Fast FAST, ICALP 09, pp.49-58, 2009.
DOI : 10.1007/978-3-642-02927-1_6

N. Alon, R. Yuster, and U. Zwick, Color-coding, Journal of the ACM, vol.42, issue.4, pp.844-856, 1995.
DOI : 10.1145/210332.210337

B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM, vol.41, issue.1, pp.153-180, 1994.
DOI : 10.1145/174644.174650

P. Bonsma and F. Dorn, Tight bounds and a fast FPT algorithm for directed max-leaf spanning tree

J. Chen, F. V. Fomin, Y. Liu, S. Lu, and Y. Villanger, Improved algorithms for feedback vertex set problems, Journal of Computer and System Sciences, vol.74, issue.7, pp.1188-1198, 2008.
DOI : 10.1016/j.jcss.2008.05.002
URL : http://doi.org/10.1016/j.jcss.2008.05.002

J. Chen, I. A. Kanj, and G. Xia, Improved Parameterized Upper Bounds for Vertex Cover, MFCS 06, pp.238-249, 2006.
DOI : 10.1007/11821069_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.831

N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim, S. Saurabh et al., Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem, In COCOON LNCS, vol.5609, pp.37-46, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00504734

J. Daligault, G. Gutin, E. J. Kim, and A. Yeo, FPT algorithms and kernels for the directed k-leaf problem. CoRR, abs/0810, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00432901

J. Daligault and S. Thomassé, On Finding Directed Trees with Many Leaves, IWPEC 09, 2009.
DOI : 10.1007/978-3-642-11269-0_7
URL : https://hal.archives-ouvertes.fr/lirmm-00432919

E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos, )-center in planar graphs and map graphs, ACM Transactions on Algorithms, vol.1, issue.1, pp.33-47, 2005.
DOI : 10.1145/1077464.1077468

E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos, -minor-free graphs, Journal of the ACM, vol.52, issue.6, pp.866-893, 2005.
DOI : 10.1145/1101821.1101823
URL : https://hal.archives-ouvertes.fr/inria-00100521

E. D. Demaine and M. Hajiaghayi, Linearity of grid minors in treewidth with applications through bidimensionality, Combinatorica, vol.14, issue.2, pp.19-36, 2008.
DOI : 10.1007/s00493-008-2140-4

E. D. Demaine and M. T. Hajiaghayi, The Bidimensionality Theory and Its Algorithmic Applications, The Computer Journal, vol.51, issue.3, pp.292-302, 2008.
DOI : 10.1093/comjnl/bxm033

E. D. Demaine, M. T. Hajiaghayi, and K. Kawarabayashi, Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.637-646, 2005.
DOI : 10.1109/SFCS.2005.14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.5749

F. Dorn, F. V. Fomin, and D. M. Thilikos, Catalan structures and dynamic programming in H-minorfree graphs, SODA 08, pp.631-640, 2008.

F. Dorn, F. V. Fomin, and D. M. Thilikos, Subexponential parameterized algorithms, Computer Science Review, vol.2, issue.1, pp.29-39, 2008.
DOI : 10.1016/j.cosrev.2008.02.004
URL : https://hal.archives-ouvertes.fr/inria-00455210

F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
DOI : 10.1007/s00453-009-9296-1
URL : http://webdoc.sub.gwdg.de/ebook/serien/ah/UU-CS/2006-006.pdf

H. Fernau, F. V. Fomin, D. Lokshtanov, D. Raible, S. Saurabh et al., Kernel(s) for problems with no kernel: On out-trees with many leaves, STACS, pp.421-432, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00358112

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

F. V. Fomin, S. Gaspers, S. Saurabh, and S. Thomassé, A linear vertex kernel for maximum internal spanning tree, ISAAC 09, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00432674

F. V. Fomin and D. M. Thilikos, Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up, SIAM Journal on Computing, vol.36, issue.2, pp.281-309, 2006.
DOI : 10.1137/S0097539702419649
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.594

G. Gutin, E. J. Kim, and I. Razgon, Minimum leaf out-branching problems. CoRR, abs/0801, 1979.

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516
URL : http://doi.org/10.1006/jcss.2001.1774

J. Kneis, A. Langer, and P. Rossmanith, A new algorithm for finding trees with many leaves, ISAAC 08, pp.270-281, 2008.

R. Niedermeier, Invitation to fixed-parameter algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

E. Prieto and C. Sloper, Reducing to independent set structure ? the case of k-internal spanning tree, Nord. J. Comput, vol.12, issue.3, pp.308-318, 2005.

B. A. Reed, K. Smith, and A. Vetta, Finding odd cycle transversals, Operations Research Letters, vol.32, issue.4, pp.299-301, 2004.
DOI : 10.1016/j.orl.2003.10.009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.6357

N. Robertson, P. Seymour, and R. Thomas, Quickly Excluding a Planar Graph, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.323-348, 1994.
DOI : 10.1006/jctb.1994.1073
URL : http://doi.org/10.1006/jctb.1994.1073