, A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem, SIAM Journal on Discrete Mathematics, vol.12, issue.3, pp.289-297, 1999.
DOI : 10.1137/S0895480196305124
, Bounding the Number of Hybridisation Events for a Consistent Evolutionary History, Journal of Mathematical Biology, vol.8, issue.2, pp.171-182, 2005.
DOI : 10.1007/s00285-005-0315-9
, A Framework for Representing Reticulate Evolution, Annals of Combinatorics, vol.8, issue.4, pp.391-408, 2004.
DOI : 10.1007/s00026-004-0228-0
, On the Complexity of uSPR Distance, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.7, issue.3, pp.572-576, 2010.
DOI : 10.1109/TCBB.2008.132
, A reduction algorithm for computing the hybridization number of two trees, Evolutionary Bioinformatics, vol.3, pp.86-98, 2007.
, A 3-approximation algorithm for the subtree distance between phylogenies, Journal of Discrete Algorithms, vol.6, issue.3, pp.458-471, 2008.
DOI : 10.1016/j.jda.2007.10.002
, 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.
DOI : 10.1109/tcbb.2007.1019
, Computing the minimum number of hybridization events for a consistent evolutionary history, Discrete Applied Mathematics, vol.155, issue.8, pp.914-928, 2007.
DOI : 10.1016/j.dam.2006.08.008
, A fixed-parameter algorithm for the directed feedback vertex set problem, Journal of the ACM, vol.55, issue.5, 2008.
, HybridNET: a tool for constructing hybridization networks, Bioinformatics, vol.26, issue.22, pp.2912-2913, 2010.
DOI : 10.1093/bioinformatics/btq548
, Quantifying Hybridization in Realistic Time, Journal of Computational Biology, vol.18, issue.10, pp.1305-1318, 2011.
DOI : 10.1089/cmb.2009.0166
, The importance of being biased, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.33-42, 2002.
DOI : 10.1145/509907.509915
, On the hardness of approximating minimum vertex cover, Annals of Mathematics, vol.162, 2004.
, Parameterized Complexity, 1999.
DOI : 10.1007/978-1-4612-0515-9
, Approximating Minimum Feedback Sets and Multicuts in Directed Graphs, Algorithmica, vol.20, issue.2, pp.151-174, 1998.
DOI : 10.1007/PL00009191
, Parameterized Complexity Theory, 2006.
, Fixed-Parameter Algorithms in Phylogenetics, The Computer Journal, vol.51, issue.1, pp.79-101, 2008.
DOI : 10.1093/comjnl/bxm049
, On the complexity of comparing evolutionary trees, Discrete Applied Mathematics, vol.71, issue.1-3, pp.153-169, 1996.
DOI : 10.1016/S0166-218X(96)00062-5
, Note on the hybridization number and subtree distance in phylogenetics, Applied Mathematics Letters, vol.22, issue.4, pp.611-615, 2009.
DOI : 10.1016/j.aml.2008.08.018
, Computing galled networks from real data, Bioinformatics, vol.25, issue.12, pp.85-93, 2009.
DOI : 10.1093/bioinformatics/btp217
URL : https://hal.archives-ouvertes.fr/lirmm-00368545
, Phylogenetic Networks: Concepts, Algorithms and Applications, 2010.
DOI : 10.1017/CBO9780511974076
, A Survey of Combinatorial Methods for Phylogenetic Networks, Genome Biology and Evolution, vol.3, issue.0, pp.23-35, 2011.
DOI : 10.1093/gbe/evq077
, When two trees go to war, Journal of Theoretical Biology, vol.269, issue.1, pp.245-255, 2011.
DOI : 10.1016/j.jtbi.2010.10.032
URL : https://hal.archives-ouvertes.fr/hal-00653683
, On the Approximability of NP-Complete Optimization Problems, Royal Institute of Technology, 1992.
, Reducibility among combinatorial problems, Complexity of computer computations (Proc. Sympos, pp.85-103, 1972.
, Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable, Algorithmica, vol.16, issue.3, 2011.
DOI : 10.1007/s00453-012-9708-5
, On the Elusiveness of Clusters, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, issue.2
DOI : 10.1109/TCBB.2011.128
, Vertex cover might be hard to approximate to within 2-??, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., pp.335-349, 2008.
DOI : 10.1109/CCC.2003.1214437
, The Problem Solving Handbook for Computational Biology and Bioinformatics, chapter Evolutionary phylogenetic networks: models and issues, 2009.
, Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications), 2006.
, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1016/0022-0000(91)90023-X
, The maximum agreement forest problem: Approximation algorithms and computational experiments, Theoretical Computer Science, vol.374, issue.1-3, pp.91-110, 2007.
DOI : 10.1016/j.tcs.2006.12.011
URL : https://hal.archives-ouvertes.fr/hal-00434715
, A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees, Journal of Computational Biology, vol.19, issue.11, 2011.
DOI : 10.1089/cmb.2012.0192
, Reconstructing Evolution -New Mathematical and Computational Advances, chapter Hybridization Networks, 2007.
, Packing directed circuits fractionally, Combinatorica, vol.2, issue.2, pp.281-288, 1995.
DOI : 10.1007/BF01200760
, Fixed-parameter and approximation algorithms for maximum agreement forests, 2011.
, Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments, Proceedings of the 9th International Symposium on Experimental Algorithms, pp.141-153, 2010.
DOI : 10.1007/978-3-642-13193-6_13
, A Unifying View on Approximation and FPT of Agreement Forests, Algorithms in Bioinformatics Lecture Notes in Computer Science, vol.374, pp.390-402, 2009.
DOI : 10.1016/j.tcs.2006.12.011