M. Baake and U. Grimm, Combinatorial problems of (quasi-)crystallography, in: Quasicrystals -Structure and Physical Properties, pp.160-171, 2002.

C. Costermans and H. Minh, Noncommutative algebra, multiple harmonic sums and applications in discrete probability, Journal of Symbolic Computation, vol.44, issue.7, pp.801-817, 2009.
DOI : 10.1016/j.jsc.2008.04.008

G. Aleksandrowicz and G. Barequet, COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES, Proc: 12th Ann. Int. Computing Combinatorics Conf, pp.418-427, 2006.
DOI : 10.1142/S0218195909002927

H. Jeanne, Langages géométriques et polycubes, 2010.

D. M. Bressoud, Proofs and Confirmations: The Story of the Alternating Sign Matrix Conjecture, in: Spectrum Series, 1999.
DOI : 10.1017/CBO9780511613449

E. A. Bender and D. E. Knuth, Enumeration of plane partitions, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.40-54, 1972.
DOI : 10.1016/0097-3165(72)90007-6

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

S. R. Broadbent and J. M. Hammersley, Percolation processes; I. Crystals and mazes, Proc. Camb, pp.629-641, 1957.

J. Champarnaud, J. Ph, H. Dubernard, and . Jeanne, AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL, International Journal of Foundations of Computer Science, vol.20, issue.04, pp.763-774, 2009.
DOI : 10.1142/S0129054109006863

H. Cohn, M. Larsen, and J. Propp, The Shape of a Typical Boxed Plane Partition, New York J. Math, vol.4, pp.137-166, 1998.

S. Feretic, 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

. Ph, R. Flajolet, and . Sedgewick, Analytic Combinatorics, 2009.

G. Largeteau and D. Geniet, Quantification du taux d???invalidit?? d???applications temps-r??el ?? contraintes strictes, Techniques et sciences informatiques, vol.27, issue.5, pp.589-625, 2008.
DOI : 10.3166/tsi.27.589-625
URL : https://hal.archives-ouvertes.fr/hal-00346029/document

W. F. Lunnon, Counting polyominoes, Computers in Number Theory, pp.347-372, 1971.
DOI : 10.1093/comjnl/18.4.366
URL : http://comjnl.oxfordjournals.org/cgi/content/short/18/4/366

J. Champarnaud, J. Dubernard, and H. Jeanne, A generic method for the enumeration of various classes of directed polycubes, Discrete Mathematics & Theoretical Computer Science, vol.15, pp.1-183, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00906822

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