{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T17:24:45Z","timestamp":1787246685968,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095435","type":"print"},{"value":"9783032095442","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09544-2_8","type":"book-chapter","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T23:02:24Z","timestamp":1761951744000},"page":"103-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tilepaint and\u00a0Aquarium Puzzles in\u00a0Periodic Grids"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2664-0650","authenticated-orcid":false,"given":"Yan","family":"Gerard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4459-511X","authenticated-orcid":false,"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1308-4412","authenticated-orcid":false,"given":"Lola-Baie","family":"Mallordy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9638-3143","authenticated-orcid":false,"given":"L\u00e9o","family":"Robert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Chen, L., Kyng, R., Liu, Y.P., Peng, R., Gutenberg, M.P., Sachdeva, S.: Maximum flow and minimum-cost flow in almost-linear time. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 612\u2013623 (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00064","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-030-26176-4_14","volume-title":"Computing and Combinatorics","author":"J-G Dumas","year":"2019","unstructured":"Dumas, J.-G., Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: Interactive physical zero-knowledge proof for norinori. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 166\u2013177. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_14"},{"key":"8_CR3","unstructured":"D\u00fcrr, C., Ch., E.G., Rapaport, I., R\u00e9mila, E.: Tiling with bars under tomographic constraints. CoRR (1999). https:\/\/arxiv.org\/abs\/cs\/9903020"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"D\u00fcrr, C., Gui\u00f1ez, F., Matamala, M.: Reconstructing 3-colored grids from horizontal and vertical projections is np-hard: a solution to the 2-atom problem in discrete tomography. SIAM J. Disc. Math. 26(1), 330\u2013352 (2012). https:\/\/doi.org\/10.1137\/100799733","DOI":"10.1137\/100799733"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Gale, D.: A theorem on flows in networks. Pac. J. Math. 7, 1073\u20131082 (1957). https:\/\/doi.org\/10.2140\/pjm.1957.7.1073. https:\/\/msp.org\/pjm\/1957\/7-2\/pjm-v7-n2-p04-s.pdf","DOI":"10.2140\/pjm.1957.7.1073"},{"key":"8_CR6","unstructured":"Gardner, R.J.: Geometric Tomography. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1995)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Herman, G.T., Kuba, A.: Discrete Tomography - Foundations, Algorithms and Applications. Birkhauser, Basel (1999)","DOI":"10.1007\/978-1-4612-1568-4"},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2021fcp0001","author":"C Iwamoto","year":"2022","unstructured":"Iwamoto, C., Ide, T.: Five cells and tilepaint are np-complete. IEICE Trans. Inf. Syst. (2022). https:\/\/doi.org\/10.1587\/transinf.2021fcp0001","journal-title":"IEICE Trans. Inf. Syst."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-02270-8_36","volume-title":"Frontiers in Algorithmics","author":"T Mizuki","year":"2009","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 358\u2013369. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02270-8_36"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Picouleau, C.: Reconstruction of domino tiling from its two orthogonal projections. Theor. Comput. Sci. 255(1-2), 437\u2013447 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(99)00312-6","DOI":"10.1016\/S0304-3975(99)00312-6"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Physical ZKP protocols for nurimisaki and kurodoko. Theor. Comput. Sci. 972, 114071 (2023). https:\/\/doi.org\/10.1016\/J.TCS.2023.114071","DOI":"10.1016\/J.TCS.2023.114071"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"HJ Ryser","year":"1957","unstructured":"Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Canbadian J. Math. 9, 371\u2013377 (1957)","journal-title":"Canbadian J. Math."},{"key":"8_CR13","unstructured":"Ueda, N., Nagao, T.: Np-completeness results for nonogram via parsimonious reductions (1996). https:\/\/api.semanticscholar.org\/CorpusID:3040166"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry and Mathematical Morphology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09544-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T16:28:51Z","timestamp":1787243331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09544-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,1]]},"ISBN":["9783032095435","9783032095442"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09544-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,1]]},"assertion":[{"value":"1 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry and Mathematical Morphology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgmm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/research.rug.nl\/en\/activities\/discrete-geometry-and-mathematical-morphology-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}