M. Bordewich, S. Linz, K. St, C. John, and . Semple, A reduction algorithm for computing the hybridization number of two trees, Evolutionary Bioinformatics, vol.3, pp.86-98, 2007.

M. Bordewich and C. Semple, Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.4, issue.3, pp.458-466, 2007.

M. Bordewich and C. Semple, Computing the minimum number of hybridization events for a consistent evolutionary history, Discrete Applied Mathematics, vol.155, issue.8, pp.914-928, 2007.

L. Zhi-zhong-chen and . Wang, Algorithms for reticulate networks of multiple phylogenetic trees, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, pp.372-384, 2012.

J. Collins, S. Linz, and C. Semple, Quantifying hybridization in realistic time, Journal of Computational Biology, vol.18, issue.10, pp.1305-1318, 2011.

R. G. Downey and M. R. Fellows, Parameterized Complexity, 1999.

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

P. Gambette, V. Berry, and C. Paul, The structure of level-k phylogenetic networks, Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching, CPM '09, pp.289-300, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00371485

, Mathematics of Evolution and Phylogeny, 2005.

, Reconstructing Evolution: New Mathematical and Computational Advances, 2007.

J. Gramm, A. Nickelsen, and T. Tantau, Fixed-parameter algorithms in phylogenetics, The Computer Journal, vol.51, issue.1, pp.79-101, 2008.

D. Gusfield, V. Bansal, V. Bafna, and Y. Song, A decomposition theory for phylogenetic networks and incompatible characters, Journal of Computational Biology, vol.14, issue.10, pp.1247-1272, 2007.

D. Gusfield, D. Hickerson, and S. Eddhu, An efficiently computed lower bound on the number of recombinations in phylognetic networks: Theory and empirical study, Discrete Applied Mathematics, vol.155, issue.6-7, pp.806-830, 2007.

D. H. Huson, R. Rupp, V. Berry, P. Gambette, and C. Paul, Computing galled networks from real data, Bioinformatics, vol.25, issue.12, pp.85-93, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00368545

D. H. Huson, R. Rupp, and C. Scornavacca, Phylogenetic Networks: Concepts, Algorithms and Applications, 2011.

D. H. Huson and C. Scornavacca, A survey of combinatorial methods for phylogenetic networks, Genome Biology and Evolution, vol.3, pp.23-35, 2011.
URL : https://hal.archives-ouvertes.fr/hal-02155011

T. N. Huynh, J. Jansson, N. B. Nguyen, and W. Sung, Constructing a smallest refining galled phylogenetic network, Research in Computational Molecular Biology (RECOMB), vol.3500, pp.265-280, 2005.

J. Jansson, N. B. Nguyen, and W. Sung, Algorithms for combining rooted triplets into a galled phylogenetic network, SIAM Journal on Computing, vol.35, issue.5, pp.1098-1121, 2006.

J. Jansson and W. Sung, Inferring a level-1 phylogenetic network from a dense set of rooted triplets, Theoretical Computer Science, vol.363, issue.1, pp.60-68, 2006.

S. Kelk, C. Scornavacca, and L. Van-iersel, On the elusiveness of clusters, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, pp.517-534, 2012.

S. R. Myers and R. C. Griffiths, Bounds on the minimum number of recombination events in a sample history, Genetics, vol.163, pp.375-394, 2003.

L. Nakhleh, The Problem Solving Handbook for Computational Biology and Bioinformatics, chapter Evolutionary phylogenetic networks: models and issues, 2009.

R. Niedermeier, Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications), 2006.

C. Semple, Reconstructing Evolution -New Mathematical and Computational Advances, chapter Hybridization Networks, 2007.

C. Semple, M. Steel, and . Phylogenetics, , 2003.

T. To and M. Habib, Level-k phylogenetic networks are constructable from a dense triplet set in polynomial time, CPM09, vol.5577, pp.275-288, 2009.

L. J. Van-iersel, J. C. Keijsper, S. M. Kelk, L. Stougie, F. Hagen et al., Constructing level-2 phylogenetic networks from triplets, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, issue.4, pp.667-681, 2009.

L. J. Van-iersel and S. M. Kelk, Constructing the simplest possible phylogenetic network from triplets. Algorithmica, pp.1-29, 2009.

L. J. Van-iersel and S. M. Kelk, When two trees go to war, Journal of Theoretical Biology, vol.269, issue.1, pp.245-255, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00653683

L. J. Van-iersel, S. M. Kelk, and M. Mnich, Uniqueness, intractability and exact algorithms: Reflections on level-k phylogenetic networks, Journal of Bioinformatics and Computational Biology, vol.7, issue.2, pp.597-623, 2009.

L. J. Van-iersel, S. M. Kelk, R. Rupp, and D. H. Huson, Phylogenetic networks do not need to be complex: Using fewer reticulations to represent conflicting clusters, Special issue: Proceedings of Intelligent Systems for Molecular Biology 2010 (ISMB2010), vol.26, pp.10-13, 2010.

C. Whidden, R. G. Beiko, and N. Zeh, Fixed-parameter and approximation algorithms for maximum agreement forests

C. Whidden and N. Zeh, A unifying view on approximation and fpt of agreement forests, Algorithms in Bioinformatics, vol.5724, pp.390-402, 2009.

Y. Wu, Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees, Special issue: Proceedings of Intelligent Systems for Molecular Biology 2010 (ISMB2010), vol.26, pp.10-13, 2010.

Y. Wu and D. Gusfield, A new recombination lower bound and the minimum perfect phylogenetic forest problem, J. Comb. Optim, vol.16, issue.3, pp.229-247, 2008.