| Publication | Date of Publication | Type |
|---|
| On the approximability of the Steiner tree problem in phylogeny | 2023-01-25 | Paper |
Recognizable sets of graphs of bounded tree-width
Graph Transformations in Computer Science | 2022-08-16 | Paper |
The size of an intertwine
Automata, Languages and Programming | 2019-04-29 | Paper |
Hypothesis testing in perfect phylogeny for a bounded number of characters
STACS 96 | 2017-11-16 | Paper |
Approximate Max \(k\)-Cut with subgraph guarantee
Information Processing Letters | 2016-06-09 | Paper |
The gene evolution model and computing its associated probabilities
Journal of the ACM | 2015-11-11 | Paper |
Fast neighbor joining
Theoretical Computer Science | 2009-05-28 | Paper |
Motif Yggdrasil: Sampling from a Tree Mixture Model
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Compatibility of unrooted phylogenetic trees is FPT
Theoretical Computer Science | 2006-04-06 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Algorithms for RH Mapping: New Ideas and Improved Analysis
SIAM Journal on Computing | 2005-02-21 | Paper |
Fitting points on the real line and its application to RH mapping
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2102787 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2080225 (Why is no real title available?) | 2004-08-04 | Paper |
A Polynomial-Time Algorithm for Near-Perfect Phylogeny
SIAM Journal on Computing | 2003-09-28 | Paper |
| scientific article; zbMATH DE number 1305100 (Why is no real title available?) | 1999-11-08 | Paper |
| scientific article; zbMATH DE number 1332666 (Why is no real title available?) | 1999-09-08 | Paper |
Upper bounds on the size of obstructions and intertwines
Journal of Combinatorial Theory. Series B | 1999-06-22 | Paper |
On the approximability of the Steiner tree problem in phylogeny
Discrete Applied Mathematics | 1998-01-01 | Paper |
Approximability of maximum splitting of k-sets and some other Apx-complete problems
Information Processing Letters | 1997-02-27 | Paper |
Equivalent definitions of recognizability for sets of graphs of bounded tree-width
Mathematical Structures in Computer Science | 1996-09-12 | Paper |
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
Journal of Algorithms | 1996-02-20 | Paper |
The nonexistence of reduction rules giving an embedding into a \(k\)-tree
Discrete Applied Mathematics | 1995-02-01 | Paper |
| scientific article; zbMATH DE number 475617 (Why is no real title available?) | 1994-06-28 | Paper |
| scientific article; zbMATH DE number 176761 (Why is no real title available?) | 1993-05-18 | Paper |
Easy problems for tree-decomposable graphs
Journal of Algorithms | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4081531 (Why is no real title available?) | 1988-01-01 | Paper |
