From Fibonacci to Catalan permutations pp. 1-17

E. Barcucci, A. Bernini, and M. Poneti


ECO-generation of p-generalized Fibonacci and Lucas permutations pp. 19-37

J.-L. Baril and P.-T. Do 


An exhaustive generation algorithm for Catalan objects and others pp. 39-53

A. Bernini, I. Fanti, and E. Grazzini


The longest common pattern problem for two permutations pp. 55-69

M. Bouvel and D. Rossin


Bidimensional sand pile and ice pile models pp. 71-96

E. Duchi, R. Mantaci, H. D. Phan, and D. Rossin


An object grammar for the class of L-convex polyominoes pp. 97-110

A. Frosini and S. Rinaldi


m-compositions and m-partitions: exhaustive generation and Gray code pp. 111-121

E. Grazzini, E. Munarini, M. Poneti, and S. Rinaldi


Avoidance of partially ordered patterns in compositions pp. 123-134

S. Heubach, S. Kitaev, and T. Mansour


Gray code and loopless algorithm for the reflection group Dn pp. 135-146

J. Korsch and S. Lipschutz


A symbolic approach to computing with holonomic functions pp. 147-164

P. Massazza and R. Radicioni


k-fixed points permutations pp. 165-173

F. Rakotondrajao


Gray codes for necklaces and Lyndon words of arbitrary base pp. 175-182

M. Weston and V. Vajnovszki