Showing 1–20 of 72 results
/ Date/ Name
Apr 29, 2010When two trees go to warFeb 21, 2023Snakes and Ladders: a Treewidth StorySep 4, 2018Treewidth of display graphs: bounds, brambles and applicationsOct 24, 2019Cutting an alignment with Ockham's razorDec 14, 2020Reflections on kernelizing and computing unrooted agreement forestsFeb 21, 2006Prefix reversals on binary and ternary stringsDec 23, 2015Reduction rules for the maximum parsimony distance on phylogenetic treesOct 25, 2013Fighting network space: it is time for an SQL-type language to filter phylogenetic networksAug 11, 2015A note on convex characters, Fibonacci numbers and exponential-time algorithmsFeb 25, 2026A kernel for the maximum agreement forest problem on multiple binary phylogenetic treesJul 22, 2021Sharp upper and lower bounds on a restricted class of convex charactersOct 16, 2009Phylogenetic Networks Do not Need to Be Complex: Using Fewer Reticulations to Represent Conflicting ClustersDec 22, 2011Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex setJul 12, 2017Finding the most parsimonious or likely tree in a network with respect to an alignmentMay 13, 2005On the Complexity of Several Haplotyping ProblemsSep 3, 2023Relaxed Agreement ForestsJun 9, 2022Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogeneticsJul 30, 2012Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary treesMar 1, 2015Phylogenetic incongruence through the lens of Monadic Second Order logicDec 8, 2017Deciding the existence of a cherry-picking sequence is hard on two trees