General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Faster and Unifying Algorithm for Comparing Trees
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Computing unrooted maximum subtrees in sub-quartic time
Nordic Journal of Computing
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
Balanced randomized tree splitting with applications to evolutionary tree constructions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |