E. Barcucci, P. Dulio, A. Frosini, and S. Rinaldi, Ambiguity results in the char- 758 acterization of hv-convex polyominoes from projections, Discrete Geometry for 759 Computer Imagery -20th IAPR International Conference, p.760, 2017.

. Austria, Proceedings, pp.147-158, 2017.

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

K. Batenburg, S. Bals, J. Sijbers, C. Kübel, P. Midgley et al., , pp.730-770, 2009.

R. N. Bracewell, Strip Integration in Radio Astronomy, Australian Journal of Physics, vol.9, issue.2, pp.198-217, 1956.
DOI : 10.1071/PH560198
URL : http://www.publish.csiro.au/ph/pdf/ph560198

G. S. Brodal and R. Jacob, Dynamic planar convex hull, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.16-19, 2002.
DOI : 10.1109/SFCS.2002.1181985

S. Brunetti and A. Daurat, Reconstruction of convex lattice sets from tomographic projections in quartic time, Theoretical Computer Science, vol.406, issue.1-2, pp.55-62, 2008.
DOI : 10.1016/j.tcs.2008.06.003

, Discrete Tomography and Digital Geometry: In memory of Attila Kuba

S. Brunetti, A. Daurat, and A. Kuba, Fast filling operations used in the recon- 776 struction of convex lattice sets, p.777

J. M. Carazo, C. O. Sorzano, E. Rietzel, R. Schröder, and R. Marabini, , p.780

, Tomography in Electron Microscopy, pp.405-416, 1999.

P. Dulio, A. Frosini, S. Rinaldi, L. Tarsissi, and L. Vuillon, First steps in the 783 algorithmic reconstruction of digital convex sets, Combinatorics on Words - 784 11th International Conference Proceedings, pp.164-176, 2017.

C. Dürr, F. Guiñez, and M. Matamala, Reconstructing 3-colored grids from hori- 787 zontal and vertical projections is np-hard, Algorithms -ESA 2009, pp.17-788

, Proceedings, pp.776-787, 2009.

S. Even, A. Itai, and A. Shamir, On the complexity of time table and multi- 791 commodity flow problems, Proceedings of the 16th Annual Symposium on Foun- 792 dations of Computer Science, SFCS '75, pp.184-193, 1975.

D. R. Ford and D. R. Fulkerson, Maximal flow through a networks, Canadian Journal of Mathematics, vol.795, issue.8, pp.399-404, 1956.

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. Gardner and P. Gritzmann, Determination of finite sets by x-rays. Transactions 798 of the, pp.2271-2295, 1997.

R. J. Gardner, Geometric Tomography. Encyclopedia of Mathematics and its 800

. Applications, , 1995.

R. J. Gardner, P. Gritzmann, and D. Prangenberg, On the computational com- 802 plexity of reconstructing lattice sets from their x-rays, Discrete Mathematics, pp.803-202, 1999.

R. J. Gardner, P. Gritzmann, and D. Prangenberg, On the computational complexity of determining polyatomic structures by X-rays, Theoretical Computer Science, vol.233, issue.1-2, pp.91-106, 2000.
DOI : 10.1016/S0304-3975(97)00298-3

Y. Gérard, About the complexity of timetables and 3-dimensional discrete to- 808 mography: A short proof of np-hardness, Combinatorial Image Analysis, pp.13-809