On the rotation distance in the lattice of binary trees

A compendium of key search references

ACM SIGIR Forum

Restricted rotation distance between binary trees

Information Processing Letters

Generating binary trees by Glivenko classes on Tamari lattices

Information Processing Letters

Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Better Approximation of Diagonal-Flip Transformation and Rotation Transformation

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics

Right-arm rotation distance between binary trees

Information Processing Letters

A direct algorithm for restricted rotation distance

Information Processing Letters

Rotation sequences and edge-colouring of binary tree pairs

Theoretical Computer Science

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations

Theoretical Computer Science

Efficient lower and upper bounds of the diagonal-flip distance between triangulations

Information Processing Letters

Rotational tree structures on binary trees and triangulations

Acta Cybernetica

Effective splaying with restricted rotations

International Journal of Computer Mathematics

The pruning-grafting lattice of binary trees

Theoretical Computer Science

An improved kernel size for rotation distance in binary trees

Information Processing Letters

A metric for rooted trees with unlabeled vertices based on nested parentheses

Theoretical Computer Science

Motzkin subposets and Motzkin geodesics in Tamari lattices

Information Processing Letters