B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.
DOI : 10.1016/0020-0190(79)90002-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
URL : http://doi.org/10.1016/0304-3975(84)90116-6

E. Barcucci, A. Del-lungo, M. Nivat, and R. Pinzani, Reconstructing convex polyominoes from horizontal and vertical projections, Theoretical Computer Science, vol.155, issue.2, pp.321-347, 1996.
DOI : 10.1016/0304-3975(94)00293-2
URL : http://doi.org/10.1016/0304-3975(94)00293-2

S. Brunetti and A. , Random generation of Q-convex sets, Theoretical Computer Science, vol.347, issue.1-2, pp.393-414, 2005.
DOI : 10.1016/j.tcs.2005.06.033
URL : https://hal.archives-ouvertes.fr/hal-00023088

G. Castiglione, A. Frosini, E. Munarini, A. Restivo, and S. Rinaldi, Combinatorial aspects of <mml:math altimg="si17.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>L</mml:mi></mml:math>-convex polyominoes, European Journal of Combinatorics, vol.28, issue.6, pp.1724-1741, 2007.
DOI : 10.1016/j.ejc.2006.06.020

G. Castiglione and A. , Restivo: Reconstruction of L-convex Polyominoes, Electronic Notes in Discrete Mathematics, vol.12, 2003.

G. Castiglione, A. Restivo, and R. , A reconstruction algorithm for L-convex polyominoes, Theoretical Computer Science, vol.356, issue.1-2, pp.58-72, 2006.
DOI : 10.1016/j.tcs.2006.01.045

M. Chrobak and C. , Reconstructing hv-convex polyominoes from orthogonal projections, Information Processing Letters, vol.69, issue.6, pp.283-289, 1999.
DOI : 10.1016/S0020-0190(99)00025-3

E. Duchi, S. Rinaldi, and G. Schaeffer, The number of Z-convex polyominoes Advances in applied mathematics ISSN 0196-8858 CODEN AAPMEF, pp.1-54, 2008.

S. Even, A. Itai, and A. Shamir, On the Complexity of Timetable and Multicommodity Flow Problems, SIAM Journal on Computing, vol.5, issue.4, pp.691-703, 1976.
DOI : 10.1137/0205048

D. Klarner, Some Results Concerning Polyominoes, Fibonacci Quart, vol.3, pp.9-20, 1965.

K. Tawbe and L. Vuillon, 2L-convex polyominoes: geometrical aspects, Contributions to Discrete Mathematics North America, vol.6, issue.1, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00944079