Approximation and Special Cases of Common Subtrees and Editing Distance

An efficient fixed-parameter algorithm for 3-hitting set

Journal of Discrete Algorithms

Improved approximation of the largest common subtree of two unordered trees of bounded height

Information Processing Letters

Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval

Exact algorithms for computing the tree edit distance between unordered trees

Theoretical Computer Science

Efficient exponential time algorithms for edit distance between unordered trees

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees

Theoretical Computer Science

Efficient exponential-time algorithms for edit distance between unordered trees

Journal of Discrete Algorithms