1. Nondecreasing Dyck paths and q-Fibonacci numbers;Barcucci;Discrete Math.,1997
2. E. Barcucci, R. Pinzani, R. Sprugnoli, Directed column-convex polyominoes by recurrence relations, in: M.-C. Gaudel, J.-P. Jouannaud (Eds.), TAPSOFT ’93: Theory and Practice of Software Development, Proceedings of the Fourth International Joint Conference CAAP/FASE, Orsay, France, April 1993, Lecture Notes in Computer Science, Vol. 668, Springer, Berlin, 1993, pp. 282–298.
3. N.G. de Bruijn, D.E. Knuth, S.O. Rice, The average height of planted trees, in: R.C. Read (Ed.), Graph Theory and Computing, Academic Press, New York, 1972, pp. 15–22 (Reprinted in: Selected papers on analysis of algorithms, CSLI Publications, Stanford, CA, 2000, pp. xvi+621.
4. Two combinatorial statistics on Dyck paths;Denise;Discrete Math.,1995
5. P. Flajolet, R. Sedgewick, Analytic Combinatorics, Book in preparation, 1998. (Individual chapters are available as INRIA Research Reports 1888, 2026, 2376, 2956, 3162.)