| Publication | Date of Publication | Type |
|---|
Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs
Discrete Applied Mathematics | 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
Journal of Computer and System Sciences | 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
Information Processing Letters | 2023-06-05 | Paper |
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
Information Processing Letters | 2023-01-30 | Paper |
Sharp upper and lower bounds on a restricted class of convex characters
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Reflections on kernelizing and computing unrooted agreement forests
Annals of Operations Research | 2022-01-20 | Paper |
New reduction rules for the tree bisection and reconnection distance
Annals of Combinatorics | 2020-11-07 | Paper |
A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees
SIAM Journal on Discrete Mathematics | 2019-09-06 | Paper |
Integrality gaps for colorful matchings
Discrete Optimization | 2019-06-14 | Paper |
Deciding the existence of a cherry-picking sequence is hard on two trees
Discrete Applied Mathematics | 2019-05-03 | Paper |
Deciding the existence of a cherry-picking sequence is hard on two trees
Discrete Applied Mathematics | 2019-05-03 | Paper |
Finding a most parsimonious or likely tree in a network with respect to an alignment
Journal of Mathematical Biology | 2019-03-29 | Paper |
On unrooted and root-uncertain variants of several well-known phylogenetic network problems
Algorithmica | 2019-01-11 | Paper |
| On a fixed haplotype variant of the minimum error correction problem | 2018-10-04 | Paper |
Treewidth distance on phylogenetic trees
Theoretical Computer Science | 2018-06-07 | Paper |
Treewidth distance on phylogenetic trees
Theoretical Computer Science | 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
Annals of Combinatorics | 2017-11-30 | Paper |
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
Journal of Mathematical Biology | 2017-06-14 | Paper |
\textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
Discrete Applied Mathematics | 2017-03-15 | Paper |
A note on convex characters, Fibonacci numbers and exponential-time algorithms
Advances in Applied Mathematics | 2016-12-27 | Paper |
Do branch lengths help to locate a tree in a phylogenetic network?
Bulletin of Mathematical Biology | 2016-11-30 | Paper |
Hybridization number on three rooted binary trees is EPT
SIAM Journal on Discrete Mathematics | 2016-09-06 | Paper |
Reduction rules for the maximum parsimony distance on phylogenetic trees
Theoretical Computer Science | 2016-08-31 | Paper |
Kernelizations for the hybridization number problem on multiple nonbinary trees
Journal of Computer and System Sciences | 2016-06-13 | Paper |
On the maximum parsimony distance between phylogenetic trees
Annals of Combinatorics | 2016-03-18 | Paper |
Phylogenetic incongruence through the lens of monadic second order logic
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
Theoretical Computer Science | 2015-12-08 | Paper |
Kernelizations for the hybridization number problem on multiple nonbinary trees
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
On low treewidth graphs and supertrees
Journal of Graph Algorithms and Applications | 2015-08-25 | Paper |
On computing the maximum parsimony score of a phylogenetic network
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
When two trees go to war
Journal of Theoretical Biology | 2015-03-09 | Paper |
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
Algorithmica | 2014-12-02 | Paper |
The agreement problem for unrooted phylogenetic trees is FPT
Journal of Graph Algorithms and Applications | 2014-07-30 | Paper |
Approximation algorithms for nonbinary agreement forests
SIAM Journal on Discrete Mathematics | 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
SIAM Journal on Discrete Mathematics | 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
Algorithmica | 2011-05-10 | Paper |
The complexity of choosing an H -colouring (nearly) uniformly at random
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Constructing the Simplest Possible Phylogenetic Network from Triplets
Algorithms and Computation | 2009-01-29 | Paper |
Constructing the Simplest Possible Phylogenetic Network from Triplets
Algorithms and Computation | 2009-01-29 | Paper |
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
Prefix Reversals on Binary and Ternary Strings
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
Prefix Reversals on Binary and Ternary Strings
Algebraic Biology | 2007-11-29 | Paper |
The complexity of the single individual SNP haplotyping problem
Algorithmica | 2007-11-28 | Paper |
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random
SIAM Journal on Computing | 2005-02-21 | Paper |
