1. Restricted permutations;Atkinson;Discrete Math.,1998
2. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps;Bóna;J. Combin. Theory Ser. A,1997
3. R. Cori, B. Jacquard, G. Schaeffer, Description trees for some families of planar maps, Proc. 9th Conf. on Formal Power Series and Algebraic Combinatorics, Vienna, 1997, see also http://www.liafa.jussieu.fr/cp/FPSAC/FPSAC97/ARTICLES/Schaeffer.ps.gz
4. Raney paths and a combinatorial relationship between nonseparable rooted planar maps and two-stack-sortable permutations;Goulden;J. Combin. Theory Ser. A,1996
5. D.E. Knuth, Fundamental Algorithms, The Art of Computer Programming, vol. 1, 2nd ed., Addison-Wesley, Reading, MA, 1973.