| Publication | Date of Publication | Type |
|---|
| Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs | 2024-12-04 | Paper |
| Snakes and Ladders: A Treewidth Story | 2024-05-03 | Paper |
| Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics | 2024-03-11 | Paper |
| Agreement forests of caterpillar trees: complexity, kernelization and branching | 2023-07-22 | Paper |
| An improved kernel for the flip distance problem on simple convex polygons | 2023-06-05 | Paper |
| Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance | 2023-01-30 | Paper |
| Sharp upper and lower bounds on a restricted class of convex characters | 2022-04-04 | Paper |
| Reflections on kernelizing and computing unrooted agreement forests | 2022-01-20 | Paper |
| New reduction rules for the tree bisection and reconnection distance | 2020-11-07 | Paper |
| A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees | 2019-09-06 | Paper |
| Integrality gaps for colorful matchings | 2019-06-14 | Paper |
| Deciding the existence of a cherry-picking sequence is hard on two trees | 2019-05-03 | Paper |
| Finding a most parsimonious or likely tree in a network with respect to an alignment | 2019-03-29 | Paper |
| On unrooted and root-uncertain variants of several well-known phylogenetic network problems | 2019-01-11 | Paper |
| On a fixed haplotype variant of the minimum error correction problem | 2018-10-04 | Paper |
| Treewidth distance on phylogenetic trees | 2018-06-07 | Paper |
| A third strike against perfect phylogeny | 2018-04-19 | Paper |
| On the complexity of computing MP distance between binary phylogenetic trees | 2017-11-30 | Paper |
| On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters | 2017-06-14 | Paper |
| \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions | 2017-03-15 | Paper |
| A note on convex characters, Fibonacci numbers and exponential-time algorithms | 2016-12-27 | Paper |
| Do branch lengths help to locate a tree in a phylogenetic network? | 2016-11-30 | Paper |
| Hybridization number on three rooted binary trees is EPT | 2016-09-06 | Paper |
| Reduction rules for the maximum parsimony distance on phylogenetic trees | 2016-08-31 | Paper |
| Kernelizations for the hybridization number problem on multiple nonbinary trees | 2016-06-13 | Paper |
| On the maximum parsimony distance between phylogenetic trees | 2016-03-18 | Paper |
| Phylogenetic incongruence through the lens of monadic second order logic | 2016-03-03 | Paper |
| Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees | 2015-12-08 | Paper |
| Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees | 2015-09-09 | Paper |
| On Low Treewidth Graphs and Supertrees | 2015-08-25 | Paper |
| On Computing the Maximum Parsimony Score of a Phylogenetic Network | 2015-05-20 | Paper |
| When two trees go to war | 2015-03-09 | Paper |
| Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable | 2014-12-02 | Paper |
| The agreement problem for unrooted phylogenetic trees is FPT | 2014-07-30 | Paper |
| Approximation Algorithms for Nonbinary Agreement Forests | 2014-06-19 | Paper |
| A short note on exponential-time algorithms for hybridization number | 2013-12-04 | Paper |
| Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set | 2013-04-09 | Paper |
| A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees | 2012-07-25 | Paper |
| Constructing the simplest possible phylogenetic network from triplets | 2011-05-10 | Paper |
| The complexity of choosing an H -colouring (nearly) uniformly at random | 2010-08-05 | Paper |
| Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks | 2010-02-26 | Paper |
| Constructing the Simplest Possible Phylogenetic Network from Triplets | 2009-01-29 | Paper |
| Prefix Reversals on Binary and Ternary Strings | 2008-08-13 | Paper |
| Prefix Reversals on Binary and Ternary Strings | 2007-11-29 | Paper |
| The complexity of the single individual SNP haplotyping problem | 2007-11-28 | Paper |
| The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random | 2005-02-21 | Paper |
