1. A general bijective algorithm for increasing trees;Chen;Systems Sci. Math. Sci.,1999
2. W.Y.C. Chen, L.L.M. Yang, On the hook length formula for binary trees (preprint)
3. Combinatorial Enumeration;Goulden,1983
4. Correspondences between plane trees and binary sequences;Klarner;J. Combin. Theory, Ser. A.,1970
5. A. Postnikov, Permutohedra, associahedra, and beyond, in: Stanley Conference, June 26, 2004, MIT. Slides available at: http://www-math.mit.edu/~apost/talks/perm-slides.pdf