S. E. Alm and S. Janson, Random self-avoiding walks on one-dimensional lattices, Comm. Statist. Stochastic Models, vol.6, issue.2, pp.169-212, 1990.

G. E. Andrews, The theory of partitions, Encyclopedia of Mathematics and its Applications, vol.2, 1976.
DOI : 10.1017/CBO9780511608650

C. Banderier, M. Bousquet-mélou, A. Denise, P. Flajolet, D. Gardy et al., Generating functions for generating trees, Discrete Mathematics, vol.246, issue.1-3, pp.1-329, 2002.
DOI : 10.1016/S0012-365X(01)00250-3
URL : https://hal.archives-ouvertes.fr/hal-00003258

C. Banderier and P. Flajolet, Basic analytic combinatorics of directed lattice paths, Theoretical Computer Science, vol.281, issue.1-2, pp.37-80, 2002.
DOI : 10.1016/S0304-3975(02)00007-5

E. A. Bender, Convex n-ominoes, Discrete Mathematics, vol.8, issue.3, pp.219-226, 1974.
DOI : 10.1016/0012-365X(74)90134-4

J. Bétréma and J. Penaud, Modèles avec particules dures, animaux dirigés et séries en variables partiellement commutatives, ArXiv:math.CO, 106210.

M. Bousquet-mélou, Rapport scientifique d'habilitation

M. Bousquet-mélou, Codage des polyominos convexes et ??quations pour l'??num??ration suivant l'aire, Discrete Applied Mathematics, vol.48, issue.1, pp.21-43, 1994.
DOI : 10.1016/0166-218X(92)00103-S

M. Bousquet-mélou, A method for the enumeration of various classes of column-convex polygons, Discrete Mathematics, vol.154, issue.1-3, pp.1-25, 1996.
DOI : 10.1016/0012-365X(95)00003-F

M. Bousquet-mélou, New enumerative results on two-dimensional directed animals, Discrete Mathematics, vol.180, issue.1-3, pp.73-106, 1998.
DOI : 10.1016/S0012-365X(97)00109-X

M. Bousquet-mélou, Rational and algebraic series in combinatorial enumeration, Proceedings of the International Congress of Mathematicians, pp.789-826, 2006.
DOI : 10.4171/022-3/40

M. Bousquet-mélou and A. J. Guttmann, Enumeration of three-dimensional convex polygons, Annals of Combinatorics, vol.1, issue.1, pp.27-53, 1997.
DOI : 10.1007/BF02558462

M. Bousquet-mélou and M. Petkov?ek, Linear recurrences with constant coefficients: the multivariate case, Discrete Mathematics, vol.225, issue.1-3, pp.51-75, 2000.
DOI : 10.1016/S0012-365X(00)00147-3

M. Bousquet-mélou and A. Rechnitzer, Lattice animals and heaps of dimers, Discrete Mathematics, vol.258, issue.1-3, pp.235-274, 2002.
DOI : 10.1016/S0012-365X(02)00352-7

M. Bousquet-mélou and X. G. Viennot, Empilements de segments et q-??num??ration de polyominos convexes dirig??s, Journal of Combinatorial Theory, Series A, vol.60, issue.2, pp.196-224, 1992.
DOI : 10.1016/0097-3165(92)90004-E

R. Brak and A. J. Guttmann, Exact solution of the staircase and row-convex polygon perimeter and area generating function, Journal of Physics A: Mathematical and General, vol.23, issue.20, pp.4581-4588, 1990.
DOI : 10.1088/0305-4470/23/20/019

R. Brak, A. L. Owczarek, and T. Prellberg, Exact scaling behavior of partially convex vesicles, Journal of Statistical Physics, vol.26, issue.5-6, pp.1101-1128, 1994.
DOI : 10.1007/BF02187057

A. De-mier and M. Noy, A solution to the tennis ball problem, Theoretical Computer Science, vol.346, issue.2-3, pp.254-264, 2005.
DOI : 10.1016/j.tcs.2005.08.017

A. D. Lungo, M. Mirolli, R. Pinzani, and S. Rinaldi, A bijection for directedconvex polyominoes, Discrete models: Combinatorics, Computation, and Geometry Discrete Math, pp.133-144, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01182978

M. Delest and S. Dulucq, Enumeration of directed column-convex animals with given perimeter and area, Croatica Chemica Acta, vol.66, issue.1, pp.59-80, 1993.

M. Delest, Generating functions for column-convex polyominoes, Journal of Combinatorial Theory, Series A, vol.48, issue.1, pp.12-31, 1988.
DOI : 10.1016/0097-3165(88)90071-4

M. Delest and G. Viennot, Algebraic languages and polyominoes enumeration, Theoretical Computer Science, vol.34, issue.1-2, pp.169-206, 1984.
DOI : 10.1016/0304-3975(84)90116-6

D. Dhar, Equivalence of the Two-Dimensional Directed-Site Animal Problem to Baxter's Hard-Square Lattice-Gas Model, Physical Review Letters, vol.49, issue.14, pp.959-962, 1982.
DOI : 10.1103/PhysRevLett.49.959

D. Dhar, Exact Solution of a Directed-Site Animals-Enumeration Problem in Three Dimensions, Physical Review Letters, vol.51, issue.10, pp.853-856, 1983.
DOI : 10.1103/PhysRevLett.51.853

E. Duchi and S. Rinaldi, An Object Grammar for Column-Convex Polyominoes, Annals of Combinatorics, vol.8, issue.1, pp.27-36, 2004.
DOI : 10.1007/s00026-004-0202-x
URL : https://hal.archives-ouvertes.fr/hal-00160559

I. G. Enting and A. J. Guttmann, On the area of square lattice polygons, Journal of Statistical Physics, vol.20, issue.3-4, pp.3-4475, 1990.
DOI : 10.1007/BF01112757

S. Fereti´cfereti´c, The column-convex polyominoes perimeter generating function for everybody, Croatica Chemica Acta, vol.69, issue.3, pp.741-756, 1996.

S. Fereti´cfereti´c, A new way of counting the column-convex polyominoes by perimeter, Discrete Mathematics, vol.180, issue.1-3, pp.173-184, 1998.
DOI : 10.1016/S0012-365X(97)00114-3

S. Fereti´cfereti´c, An alternative method for q-counting directed column-convex polyominoes, Discrete Mathematics, vol.210, issue.1-3, pp.55-70, 2000.
DOI : 10.1016/S0012-365X(99)00120-X

S. Fereti´cfereti´c, A q-enumeration of convex polyominoes by the festoon approach, Theoretical Computer Science, vol.319, issue.1-3, pp.333-356, 2004.
DOI : 10.1016/j.tcs.2004.02.011

S. Fereti´cfereti´c and D. Svrtan, On the number of column-convex polyominoes with given perimeter and number of columns, Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics, pp.201-214, 1993.

P. Flajolet and R. Sedgewick, Analytic Combinatorics. Preliminary version available at http://pauillac.inria.fr/algo
URL : https://hal.archives-ouvertes.fr/inria-00072739

G. Gasper and M. Rahman, Basic hypergeometric series, volume 35 of Encyclopedia of Mathematics and its Applications, 1990.

A. J. Guttmann and T. Prellberg, Staircase polygons, elliptic integrals, Heun functions, and lattice Green functions, Physical Review E, vol.47, issue.4, pp.2233-2236, 1993.
DOI : 10.1103/PhysRevE.47.R2233

I. Jensen and A. J. Guttmann, Self-avoiding polygons on the square lattice, Journal of Physics A: Mathematical and General, vol.32, issue.26, pp.4867-4876, 1999.
DOI : 10.1088/0305-4470/32/26/305

I. Jensen and A. J. Guttmann, Statistics of lattice animals (polyominoes) and polygons, Journal of Physics A: Mathematical and General, vol.33, issue.29, pp.257-263, 2000.
DOI : 10.1088/0305-4470/33/29/102

D. A. Klarner, Some results concerning polyominoes, Fibonacci Quart, vol.3, pp.9-20, 1965.

D. A. Klarner, Cell growth problems. Canad, J. Math, vol.19, pp.851-863, 1967.

D. A. Klarner and R. L. Rivest, Asymptotic bounds for the number of convex n-ominoes, Discrete Mathematics, vol.8, issue.1, pp.31-40, 1974.
DOI : 10.1016/0012-365X(74)90107-1

L. Borgne and J. Marckert, Directed animals and gas models revisited, Electron. J. Combin, p.71, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00112181

N. Madras and G. Slade, The self-avoiding walk. Probability and its Applications, 1993.

G. Pólya, On the number of certain lattice polygons, Journal of Combinatorial Theory, vol.6, issue.1, pp.102-105, 1969.
DOI : 10.1016/S0021-9800(69)80113-4

T. Prellberg and R. Brak, Critical exponents from nonlinear functional equations for partially directed cluster models, Journal of Statistical Physics, vol.66, issue.3-4, pp.701-730, 1995.
DOI : 10.1007/BF02183685

V. Privman and M. Barma, Radii of gyration of fully and partially directed lattice animals, Zeitschrift f??r Physik B Condensed Matter, vol.54, issue.1, pp.59-63, 1984.
DOI : 10.1007/BF01679926

V. Privman and N. M. Svraki´csvraki´c, Exact generating function for fully directed compact lattice animals, Physical Review Letters, vol.60, issue.12, pp.1107-1109, 1988.
DOI : 10.1103/PhysRevLett.60.1107

H. Prodinger, The kernel method: a collection of examples, Sém. Lothar. Combin, vol.50, issue.19, p.4, 2003.

R. C. Read, Contributions to the cell growth problem, Journal canadien de math??matiques, vol.14, issue.0, pp.1-20, 1962.
DOI : 10.4153/CJM-1962-001-2

A. Rechnitzer, Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite, Journal of Combinatorial Theory, Series A, vol.113, issue.3, pp.520-546, 2006.
DOI : 10.1016/j.jcta.2005.04.010

C. Richard, Limit distributions and scaling functions. Arxiv:0704.0716v2 [mathph], 2007.

A. Salomaa and M. Soittola, Automata-theoretic aspects of formal power series, 1978.
DOI : 10.1007/978-1-4612-6264-0

H. N. Temperley, Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules, Physical Review, vol.103, issue.1, pp.1-16, 1956.
DOI : 10.1103/PhysRev.103.1

G. X. Viennot, Heaps of pieces, I : Basic definitions and combinatorial lemmas, Combinatoiré enumérative, pp.321-350, 1985.
DOI : 10.1016/0012-365X(85)90192-X

M. Vöge and A. J. Guttmann, On the number of hexagonal polyominoes, Theoretical Computer Science, vol.307, issue.2, pp.433-453, 2003.
DOI : 10.1016/S0304-3975(03)00229-9

T. Yuba and M. Hoshi, Binary search networks: A new method for key searching, Information Processing Letters, vol.24, issue.1, pp.59-65, 1987.
DOI : 10.1016/0020-0190(87)90199-2

D. Zeilberger, Symbol-crunching with the transfer-matrix method in order to count skinny physical creatures. Integers, pages A9, p.34, 2000.

D. Zeilberger, The umbral transfer-matrix method. III. Counting animals, New York J. Math, vol.7, pp.223-231, 2001.