{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:17Z","timestamp":1759626617470,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0304-3975(01)00080-9","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T15:39:34Z","timestamp":1034177974000},"page":"223-242","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":29,"title":["Reconstruction of convex 2D discrete sets in polynomial time"],"prefix":"10.1016","volume":"283","author":[{"given":"Attila","family":"Kuba","sequence":"first","affiliation":[]},{"given":"Emese","family":"Balogh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00080-9_BIB1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0304-3975(94)00293-2","article-title":"Reconstructing convex polyominoes from horizontal and vertical projections","volume":"155","author":"Barcucci","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00080-9_BIB3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/(SICI)1098-1098(1998)9:2\/3<69::AID-IMA2>3.0.CO;2-L","article-title":"Medians of polyominoes: a property for the reconstruction","volume":"9","author":"Barcucci","year":"1998","journal-title":"Internat. J. Imaging Systems Technol."},{"key":"10.1016\/S0304-3975(01)00080-9_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0024-3795(80)90105-6","article-title":"Matrices of zeros and ones with fixed row and column sum vectors","volume":"33","author":"Brualdi","year":"1980","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0304-3975(01)00080-9_BIB5","doi-asserted-by":"crossref","unstructured":"S. Brunetti, A. Del Lungo, F. Del Ristoro, A. Kuba, M. Nivat, Reconstruction of 8- and 4-connected convex discrete sets from row and column projections, 2001, accepted for publication.","DOI":"10.1016\/S0024-3795(01)00435-9"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/361972.361999","article-title":"Algorithm 445. Binary pattern reconstruction from projections","volume":"16","author":"Chang","year":"1973","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB7","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0020-0190(99)00025-3","article-title":"Reconstructing hv-convex polyominoes from orthogonal projections","volume":"69","author":"Chrobak","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00080-9_BIB8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0304-3991(85)80005-X","article-title":"Inexact reconstruction: some improvements","volume":"16","author":"Crewe","year":"1985","journal-title":"Ultramicroscopy"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0012-365X(96)83007-X","article-title":"The number of convex polyominoes reconstructible from their orthogonal projections","volume":"157","author":"Del Lungo","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(01)00080-9_BIB10","series-title":"Discrete Tomography: Foundations, Algorithms and Applications","first-page":"85","article-title":"Uniqueness and complexity in discrete tomography","author":"Gardner","year":"1999"},{"year":"1965","series-title":"Polyominoes","author":"Golomb","key":"10.1016\/S0304-3975(01)00080-9_BIB11"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB12","doi-asserted-by":"crossref","unstructured":"G.T. Herman, A. Kuba (Eds.), Discrete tomography, Internat. J. Imaging Systems Technol. 9(2\/3)(Special issue) 1998.","DOI":"10.1002\/(SICI)1098-1098(1998)9:2\/3<67::AID-IMA1>3.0.CO;2-L"},{"year":"1999","series-title":"Discrete Tomography: Foundations, Algorithms and Applications","key":"10.1016\/S0304-3975(01)00080-9_BIB13"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0734-189X(84)90031-8","article-title":"The reconstruction of two-directionally connected binary patterns from their two orthogonal projections","volume":"27","author":"Kuba","year":"1984","journal-title":"Comput. Vision, Graphics, Image Process."},{"key":"10.1016\/S0304-3975(01)00080-9_BIB15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-49126-0_12","article-title":"Reconstruction in different classes of 2D discrete sets","volume":"1568","author":"Kuba","year":"1999","journal-title":"Lecture Notes on Computer Sciences"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB16","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/42.511756","article-title":"Binary reconstruction of the heart chambers from biplane angiographic image sequences","volume":"MI-15","author":"Prause","year":"1996","journal-title":"IEEE Trans. Med. Imaging"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","article-title":"Combinatorial properties of matrices of zeros and ones","volume":"9","author":"Ryser","year":"1957","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(01)00080-9_BIB18","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0031-3203(78)90004-3","article-title":"Switching components and the ambiguity problem in the reconstruction of pictures from their projections","volume":"10","author":"Schilferstein","year":"1978","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0304-3975(01)00080-9_BIB19","unstructured":"G.W. Woeginger, The reconstruction of polyominoes from their orthogonal projections, Technical Report, Technische Universit\u00e4t Graz, vol. 65, 1965."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000809?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000809?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:12Z","timestamp":1759625532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0304397501000809"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00080-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reconstruction of convex 2D discrete sets in polynomial time","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(01)00080-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}