P. Balázs, Binary Tomography Using Geometrical Priors : Uniqueness and Reconstruction Results, 2007.

P. Balázs, A framework for generating some discrete sets with disjoint components by using uniform distrubtions, Discrete Applied Mathematics, vol.406, pp.15-23, 2008.

P. Balázs, A benchmark set for the reconstruction of <mml:math altimg="si27.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>h</mml:mi><mml:mi>v</mml:mi></mml:math>-convex discrete sets, Discrete Applied Mathematics, vol.157, issue.16, pp.3447-3456, 2009.
DOI : 10.1016/j.dam.2009.02.019

P. Balázs, Benchmark collections for the reconstruction of hv-convex discrete sets : http ://www.inf-u-szegedhu/?pbalazs, 2010.

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

K. J. Batenburg, Network Flow Algorithms for Discrete Tomography, 2006.
DOI : 10.1007/978-0-8176-4543-4_9

K. J. Batenburg and W. J. Palenstijn, On the Reconstruction of Crystals Through Discrete Tomography, Lecture Notes in computer science, vol.3322, pp.23-37, 2004.
DOI : 10.1007/978-3-540-30503-3_2

R. J. Baxter, Planar lattice gases with nearest-neighbor exclusion, Annals of Combinatorics, vol.6, issue.2-4, pp.191-203, 1999.
DOI : 10.1007/BF01608783

A. Billionnet, Optimisation quadratique en variables 0-1, Optimisation combinatoire, concepts fondamentaux, pp.191-234, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01124976

A. Billionnet and S. Elloumi, Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem, Mathematical Programming, vol.236, issue.1, pp.55-68, 2007.
DOI : 10.1007/s10107-005-0637-9
URL : https://hal.archives-ouvertes.fr/hal-01125239

A. Billionnet, S. Elloumi, and A. Lambert, Extending the QCR method to general mixed-integer programs, Mathematical Programming, pp.381-401, 2012.
DOI : 10.1007/s10107-010-0381-7
URL : https://hal.archives-ouvertes.fr/hal-01125718

A. Billionnet, S. Elloumi, and M. Plateau, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, Discrete Applied Mathematics, vol.157, issue.6, pp.1185-1197, 2009.
DOI : 10.1016/j.dam.2007.12.007
URL : https://hal.archives-ouvertes.fr/hal-01125253

E. Boros and P. L. Hammer, Pseudo-Boolean optimization, Discrete Applied Mathematics, vol.123, issue.1-3, pp.155-225, 2002.
DOI : 10.1016/S0166-218X(01)00341-9
URL : https://hal.archives-ouvertes.fr/hal-01150533

Y. Boufkhad, O. Dubois, and M. Nivat, Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections, Theoretical Computer Science, vol.290, issue.3, pp.1647-1664, 2003.
DOI : 10.1016/S0304-3975(02)00072-5
URL : https://hal.archives-ouvertes.fr/hal-01185718

S. Brocchi, A. Frosini, and C. Picouleau, Reconstruction of binary matrices under fixed size neighborhood constraints, Theoretical Computer Science, vol.406, issue.1-2, pp.43-54, 2008.
DOI : 10.1016/j.tcs.2008.07.024
URL : https://hal.archives-ouvertes.fr/hal-01125555

S. Brunetti, Convexity and Complexity in Discrete Tomography, 2001.

S. Brunetti, M. C. Costa, A. Frosini, F. Jarray, and C. Picouleau, Reconstruction of Binary Matrices under Adjacency Constraints, Advances in Discrete Tomography and its Applications, pp.125-150, 2007.
DOI : 10.1007/978-0-8176-4543-4_7
URL : https://hal.archives-ouvertes.fr/hal-01125187

M. Chrobak, . Ch, and . Dürr, 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
URL : http://arxiv.org/abs/cs/9906021

M. Chrobak, . Ch, and . Dürr, Reconstructing polyatomic structures from xrays : Np-completness proof for three atoms. Theoretical computer science, pp.81-98, 2001.

M. C. Costa, D. De-werra, and C. Picouleau, Using graphs for some discrete tomography problems, Discrete Applied Mathematics, vol.154, issue.1, pp.35-46, 2006.
DOI : 10.1016/j.dam.2005.07.003
URL : https://hal.archives-ouvertes.fr/hal-01124922

M. C. Costa, F. Jarray, and C. Picouleau, Reconstruction of binary matrices under adjacency constraints, Electronic Notes in Discrete Mathematics, vol.20, pp.281-197, 2005.
DOI : 10.1016/j.endm.2005.05.069
URL : https://hal.archives-ouvertes.fr/hal-01124999

G. Dahl and T. Flatberg, Optimization and reconstruction of hv-convex (0,1)-matrices, Electronic Notes in Discrete Mathematics, vol.12, pp.93-105, 2005.
DOI : 10.1016/S1571-0653(04)00474-3

A. Daurat, Convexité dans le Plan Discret Application à la Tomographie, 2000.

. Ch, F. Dürr, M. Guinez, and . Matamala, Reconstructing 3-colored grids from horizontal and vertical projections is np-hard, Proceedings of the 17th Annual European Symposium on Algorithms (ESA), pp.776-787, 2009.

P. Flajolet, B. Zimmerman, and . Van-cusern, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7
URL : https://hal.archives-ouvertes.fr/hal-00917729

A. Frosini, C. Picouleau, and S. Rinaldi, Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem, In Lecture Notes in Computer Science, pp.392-400, 2008.
DOI : 10.1007/978-3-540-79126-3_35
URL : https://hal.archives-ouvertes.fr/hal-01125395

D. Gale, A theorem on flows in networks, Pacific Journal of Mathematics, vol.7, issue.2, pp.1073-1082, 1957.
DOI : 10.2140/pjm.1957.7.1073

R. J. Gardner, P. Gritzmann, and D. Prangenberg, On the computational complexity of reconstructing lattice sets from their X-rays, Discrete Mathematics, vol.202, issue.1-3, pp.45-71, 1999.
DOI : 10.1016/S0012-365X(98)00347-1

R. J. Gardner, P. Gritzmann, and D. Prangenberg, On the computational complexity of determining polyatomic structures by x-rays. Theoretical computer science, pp.91-106, 2000.

R. E. Gomory, Outline of an algorithm for integer solutions to linear programs, Bulletin of the American Mathematical Society, vol.64, issue.5, pp.275-278, 1958.
DOI : 10.1090/S0002-9904-1958-10224-4

R. H. Haber, Term rank of 0-1 matrices, Technical Report, vol.30, pp.24-51, 1960.

G. T. Herman and A. Kuba, Discrete tomography in medical imaging, Proceedings of the IEEE, vol.91, issue.10, pp.1612-1626, 2003.
DOI : 10.1109/JPROC.2003.817871

F. Jarray, Résolution de problèmes de tomographie discrète Applications à la planification de personnel, 2007.

F. Jarray, M. C. Costa, and C. Picouleau, Approximating hv-Convex Binary Matrices and Images from Discrete Projections, In Lecture Notes in Computer Science, pp.413-422, 2008.
DOI : 10.1007/978-3-540-79126-3_37
URL : https://hal.archives-ouvertes.fr/hal-01125398

F. Jarray and G. Tlig, A simulated annealing for reconstruction hv-convex binary matrices, Electronic Notes in Discrete mathematics, pp.413-422, 2010.

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

A. D. Lungo, A. Frosini, M. Nivat, and L. Vuillon, Discrete Tomography: Reconstruction under Periodicity Constraints, Lecture Notes in Computer Science, vol.2380, pp.38-56, 2002.
DOI : 10.1007/3-540-45465-9_5

M. L. Mehta, On the problem of hard squares, The Journal of Chemical Physics, vol.60, issue.6, pp.2207-2209, 1974.
DOI : 10.1063/1.1681349

M. Nivat, Tomographie discrète, Colloquium Jacques Morgenstern, 2003.

C. Picouleau, Reconstruction of domino tiling from its two orthogonal projections, Theoretical Computer Science, vol.255, issue.1-2, pp.437-447, 2001.
DOI : 10.1016/S0304-3975(99)00312-6

H. J. Ryser, Combinatorial properties of matrices of zeros and ones, Journal canadien de math??matiques, vol.9, issue.0, pp.371-377, 1957.
DOI : 10.4153/CJM-1957-044-3

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

W. Van-aarle, Tomographic segmentation and discrete tomography for quantitative analysis of transmission tomography data

B. Wang and F. Zhang, On the precise number of (0,1)-matrices in <mml:math display="inline" altimg="si1.gif" 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:mo mathvariant="fraktur">A</mml:mo></mml:math>(R,S), Discrete Mathematics, vol.187, issue.1-3, pp.211-220, 1998.
DOI : 10.1016/S0012-365X(97)00197-0

J. Wilson and N. Patwari, Radio Tomographic Imaging with Wireless Networks, IEEE Transactions on Mobile Computing, vol.9, issue.5, pp.621-632, 2010.
DOI : 10.1109/TMC.2009.174

G. J. Woeginger, The reconstruction of polyominoes from their orthogonal projections, Information Processing Letters, vol.77, issue.5-6, pp.225-229, 2001.
DOI : 10.1016/S0020-0190(00)00162-9

Y. Zhao, N. Patwari, J. M. Phillips, and S. Venkatasubramanian, Radio tomographic imaging and tracking of stationary and moving people via kernel distance, Proceedings of the 12th international conference on Information processing in sensor networks, IPSN '13, 2013.
DOI : 10.1145/2461381.2461410

F. Jarray and G. Tlig, A simulated annealing for reconstructing hv-convex binary matrices, Electronic Notes in Discrete Mathematics, vol.36, issue.1, pp.447-454, 2010.
DOI : 10.1016/j.endm.2010.05.057

F. Jarray and G. Tlig, A simulated annealing approach for reconstructing convex matrices and images from four projections, The 3rd International Conference on Metaheuristics and Nature Inspired Computing -META'10 Tunisia, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01125835

F. Jarray and G. Tlig, Reconstructing hv-convex images by tabu research approach, The 3rd International Conference on Metaheuristics and Nature Inspired Computing -META'10 Tunisia, 2010.