AbstractGiven a collection P of partitions of a label set L a problem arising in biological and linguistic classification is deciding whether there is a “tree-structure” on L which is “compatible” with P. While this problem is, in general, N P-complete we show that it has a polynomial time solution if the number of sets in each partition is at most three
AbstractRecently, by studying Z5-edge colorings of bifurcating phylogenetic trees, Semple and Steel ...
AbstractWe give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, ...
In this thesis three combinatorial problems are studied in four papers. In Paper 1 we study the stru...
AbstractGiven a collection P of partitions of a label set L a problem arising in biological and ling...
Dress A, STEEL M. Convex tree realizations of partitions. Applied Mathematics Letters. 1992;5(3):3-6...
Trees whose vertices are partially labelled by elements of a finite set X provide a natural way to ...
AbstractA central problem that arises in evolutionary biology is that of displaying partitions of su...
A central problem that arises in evolutionary biology is that of displaying partitions of subsets of...
Let T be an unrooted binary tree with n distinctly labelled leaves. Deriving its name from the field...
AbstractA graph model for a set S of splits of a set X consists of a graph and a map from X to the v...
Given a set of trees with leaves labelled from a set L, is there a tree T with leaves labelled by L...
International audienceThe Tree Containment problem has many important applications in the study of e...
AbstractMaking a bijection between semilabelled trees and some partitions, we build up a powerful th...
AbstractWe show that a class of vertex partitioning problems that can be expressed in monadic second...
We introduce a strong extended formulation of the convex recoloring prob- lem on a tree, which has a...
AbstractRecently, by studying Z5-edge colorings of bifurcating phylogenetic trees, Semple and Steel ...
AbstractWe give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, ...
In this thesis three combinatorial problems are studied in four papers. In Paper 1 we study the stru...
AbstractGiven a collection P of partitions of a label set L a problem arising in biological and ling...
Dress A, STEEL M. Convex tree realizations of partitions. Applied Mathematics Letters. 1992;5(3):3-6...
Trees whose vertices are partially labelled by elements of a finite set X provide a natural way to ...
AbstractA central problem that arises in evolutionary biology is that of displaying partitions of su...
A central problem that arises in evolutionary biology is that of displaying partitions of subsets of...
Let T be an unrooted binary tree with n distinctly labelled leaves. Deriving its name from the field...
AbstractA graph model for a set S of splits of a set X consists of a graph and a map from X to the v...
Given a set of trees with leaves labelled from a set L, is there a tree T with leaves labelled by L...
International audienceThe Tree Containment problem has many important applications in the study of e...
AbstractMaking a bijection between semilabelled trees and some partitions, we build up a powerful th...
AbstractWe show that a class of vertex partitioning problems that can be expressed in monadic second...
We introduce a strong extended formulation of the convex recoloring prob- lem on a tree, which has a...
AbstractRecently, by studying Z5-edge colorings of bifurcating phylogenetic trees, Semple and Steel ...
AbstractWe give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, ...
In this thesis three combinatorial problems are studied in four papers. In Paper 1 we study the stru...
DOI
Add to ORKG