S. Bacchelli, E. Barcucci, E. Grazzini, and E. Pergola, Exhaustive generation of combinatorial objects by ECO, Acta Informatica, vol.40, issue.8, pp.40-585, 2004.
DOI : 10.1007/s00236-004-0139-x

E. Barcucci, A. Del-lungo, E. Pergola, and R. Pinzani, ECO: a methodology for the enumeration of combinatorial objects, Journal of Difference Equations and Applications, vol.5, pp.1-56, 1999.

J. Baril, Gray code for permutations with a fixed number of cycles, Discrete Mathematics, vol.307, issue.13, pp.1559-1571, 2007.
DOI : 10.1016/j.disc.2006.09.007

J. Baril, More restrictive Gray codes for some classes of pattern avoiding permutations, Information Processing Letters, vol.109, issue.14, pp.799-804, 2009.
DOI : 10.1016/j.ipl.2009.03.025

J. Baril and D. Phan-thuan, ECO-generation for p-generalized Fibonacci and Lucas permutations, Journal of Pure Mathematics and Applications, vol.17, issue.12, pp.19-37, 2006.

J. Baril and V. Vajnovszki, Gray code for derangements, Discrete Applied Mathematics, vol.140, issue.1-3, pp.207-221, 2004.
DOI : 10.1016/j.dam.2003.06.002

URL : http://doi.org/10.1016/j.dam.2003.06.002

A. Bernini, E. Grazzini, E. Pergola, and R. Pinzani, A general exhaustive generation algorithm for Gray structures, Acta Informatica, vol.157, issue.1, pp.44-361, 2007.
DOI : 10.1007/s00236-007-0053-0

A. Claesson, Generalized Pattern Avoidance, European Journal of Combinatorics, vol.22, issue.7, pp.961-971, 2001.
DOI : 10.1006/eujc.2001.0515

URL : http://doi.org/10.1006/eujc.2001.0515

W. M. Dukes, M. F. Flanagan, T. Mansour, and V. Vajnovszki, Combinatorial Gray codes for classes of pattern avoiding permutations, Theoretical Computer Science, vol.396, issue.1-3, pp.35-49, 2008.
DOI : 10.1016/j.tcs.2007.12.002

S. Effer and F. Ruskey, A CAT algorithm for generating permutations with a fixed number of inversions, Information Processing Letters, vol.86, issue.2, pp.107-112, 2003.
DOI : 10.1016/S0020-0190(02)00481-7

G. Ehrlich, Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations, Journal of the ACM, vol.20, issue.3, pp.500-513, 1973.
DOI : 10.1145/321765.321781

L. Ferrari, E. Pergola, R. Pinzani, and S. Rinaldi, Jumping succession rules and their generating functions, Discrete Mathematics, vol.271, issue.1-3, pp.29-50, 2003.
DOI : 10.1016/S0012-365X(02)00868-3

URL : http://doi.org/10.1016/s0012-365x(02)00868-3

P. Flajolet and R. Schott, Non-overlapping Partitions, Continued Fractions, Bessel Functions and a Divergent Series, European Journal of Combinatorics, vol.11, issue.5, pp.421-432, 1990.
DOI : 10.1016/S0195-6698(13)80025-X

URL : https://hal.archives-ouvertes.fr/inria-00075493

D. Foata and M. Schützenberger, Théorie géometrique des polynômes Euleriens, Lectures Notes in Math, 1970.

S. M. Johnson, Generation of permutations by adjacent transposition, Mathematics of Computation, vol.17, issue.83, pp.282-285, 1963.
DOI : 10.1090/S0025-5718-1963-0159764-2

G. Labelle, P. Leroux, E. Pergola, and R. Pinzani, Stirling numbers interpolation using permutations with forbidden subsequences, Discrete Mathematics, vol.246, issue.1-3, pp.1-3, 2002.
DOI : 10.1016/S0012-365X(01)00257-6

URL : http://doi.org/10.1016/s0012-365x(01)00257-6

D. H. Lehmer, Permutation by Adjacent Interchanges, The American Mathematical Monthly, vol.72, issue.2, pp.36-46, 1965.
DOI : 10.2307/2313309

M. Poneti and V. Vajnovszki, Generating restricted classes of involutions, Bell and Stirling permutations, European Journal of Combinatorics, vol.31, issue.2, pp.31-553, 2010.
DOI : 10.1016/j.ejc.2009.03.028

F. Ruskey and D. Roelants-van-baronaigien, Fast recursive algorithm for generating combinatorial objects, Congressus Numeratium, pp.53-62, 1984.

F. Ruskey, Combinatorial generation. Book in preparation

R. Sedgewick, Permutation Generation Methods, ACM Computing Surveys, vol.9, issue.2, pp.137-164, 1977.
DOI : 10.1145/356689.356692

N. Sloane, The On-Line Encyclopedia of Integer Sequences
DOI : 10.1007/978-3-540-73086-6_12

R. Stanley, Enumerative Combinatorics, 1997.

H. Steinhaus, One hundred problems in elementary mathematics, Polish, 1958.

H. F. Trotter, Algorithm 115: Perm, Communications of the ACM, vol.5, issue.8, pp.434-435, 1962.
DOI : 10.1145/368637.368660

V. Vajnovszki, Generating involutions, derangements, and relatives by ECO, GASCom'07, 2006.

T. Walsh, Gray codes for involutions, J. Combin. Math. Combin. Comput, vol.36, pp.95-118, 2001.