Directed path-width and monotonicity in digraph searching, Graphs and Combinatorics, vol.22, issue.2, pp.161-172, 2006. ,
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. ,
On the fixed parameter tractability of agreement-based phylogenetic distances, Journal of Mathematical Biology, vol.74, issue.1, pp.1432-1416, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01348420
Compatibility of unrooted phylogenetic trees is fpt, Theoretical Computer Science, vol.351, issue.3, pp.296-302, 2006. ,
Inferring species trees directly from biallelic genetic markers: bypassing gene trees in a full coalescent analysis, Mol. Biol. Evol, vol.29, issue.8, pp.1917-1932, 2012. ,
A survey of graph layout problems, ACM Comput. Surv, vol.34, issue.3, pp.313-356, 2002. ,
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
On low treewidth graphs and supertrees, Proc. 1st AlCoB, pp.71-82, 2014. ,
Phylogenetic networks: concepts, algorithms and applications, 2010. ,
Reducibility among combinatorial problems, Complexity of computer computations, pp.85-103, 1972. ,
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable, Algorithmica, vol.68, issue.4, pp.886-915, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-02154980
Treewidth distance on phylogenetic trees, Theor. Comput. Sci, vol.731, pp.99-117, 2018. ,
On the inference of complicated phylogenetic networks by markov chain monte-carlo ,
Complete register allocation problems, SIAM Journal on Computing, vol.4, issue.3, pp.226-248, 1975. ,
Fixed-parameter algorithms for maximum agreement forests, SIAM Journal on Computing, vol.42, issue.4, pp.1431-1466, 2013. ,
Bayesian Inference of Species Networks from Multilocus Sequence Data, Mol. Biol. Evol, vol.35, issue.2, pp.504-517, 2018. ,