A. Becker, R. Bar-yehuda, and D. Geiger, Randomized algorithms for the loop cutset problem, J. Artificial Intelligence Research, vol.12, pp.219-234, 2000.

H. L. Bodlaender, ON DISJOINT CYCLES, International Journal of Foundations of Computer Science, vol.05, issue.01, pp.59-68, 1994.
DOI : 10.1142/S0129054194000049

H. L. Bodlaender, A Cubic Kernel for Feedback Vertex Set, Proceedings 24th International Symposium on Theoretical Aspects of Computer Science, pp.320-331, 2007.
DOI : 10.1007/978-3-540-70918-3_28

H. L. Bodlaender, L. Cai, J. Chen, M. R. Fellows, J. A. Telle et al., Open problems in parameterized and exact computation, Proceedings 2nd International Workshop on Parameterized and Exact Computation, 2006.

K. Burrage, V. Estivill-castro, M. R. Fellows, M. A. Langston, S. Mac et al., The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel, Proceedings 2nd International Workshop on Parameterized and Exact Computation, pp.192-202, 2006.
DOI : 10.1007/11847250_18

F. K. Dehne, M. R. Fellows, M. A. Langston, F. A. Rosamond, and K. Stevens, An O(2 O(k) n 3) FPT Algorithm for??the??Undirected??Feedback??Vertex??Set??Problem, Proceedings 11th International Computing and Combinatorics Conference COCOON 2005, pp.859-869, 2005.
DOI : 10.1007/11533719_87

R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness, Congressus Numerantium, vol.87, pp.161-178, 1992.

J. Edmonds, Paths, Trees and Flowers, Canad, Journal of Math, vol.17, pp.449-467, 1965.

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

F. V. Fomin, S. Gaspers, and C. Knauer, Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$, Proceedings 2nd International Workshop on Parameterized and Exact Computation, pp.183-191, 2006.
DOI : 10.1007/11847250_17

T. Gallai, Maximum-Minimum S??tze und verallgemeinerte Faktoren von Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.4, issue.1-2, pp.131-173, 1961.
DOI : 10.1007/BF02066678

J. Guo, J. Gramm, F. Huffner, R. Niedermeier, and S. Wernicke, Improved Fixed-Parameter Algorithms for Two Feedback Set Problems, Proc. 9th Int. Workshop on Algorithms and Data Structures WADS 2004, pp.158-168, 2004.
DOI : 10.1007/11534273_15

I. A. Kanj, M. J. Pelmajer, and M. Schaefer, Parameterized Algorithms for Feedback Vertex Set, Proc. 1st Int. Workshop on Parameterized and Exact Computation, pp.235-248, 2004.
DOI : 10.1007/978-3-540-28639-4_21

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

V. Raman, S. Saurabh, and C. R. Subramanian, Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set, Proceedings 13th International Symposium on Algorithms and Computation, pp.241-248, 2002.
DOI : 10.1007/3-540-36136-7_22

V. Raman, S. Saurabh, and C. R. Subramanian, Faster algorithms for feedback vertex set, Proceedings 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics, GRACO 2005, pp.273-279, 2005.
DOI : 10.1016/j.endm.2005.05.037

I. Razgon, Exact Computation of Maximum Induced Forest, 10th Scandinavian- Workshop on Algorithm Theory, SWAT 2006, pp.160-171, 2006.
DOI : 10.1007/11785293_17

A. Schrijver, A Short Proof of Mader's S-Paths Theorem, Journal of Combinatorial Theory, Series B, vol.82, issue.2, pp.319-321, 2001.
DOI : 10.1006/jctb.2000.2029