{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T02:48:10Z","timestamp":1777171690220,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.ic.2026.105455","type":"journal-article","created":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T23:36:32Z","timestamp":1776814592000},"page":"105455","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the generation and enumeration of prime double square polyominoes"],"prefix":"10.1016","volume":"311","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4173-8610","authenticated-orcid":false,"given":"Michela","family":"Ascolese","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7210-2231","authenticated-orcid":false,"given":"Andrea","family":"Frosini","sequence":"additional","affiliation":[]},{"given":"Simone","family":"Rinaldi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2026.105455_bib0001","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF02574705","article-title":"On translating one polyomino to tile the plane","volume":"6","author":"Beauquier","year":"1991","journal-title":"Discrete Comput. Geom."},{"issue":"7\u20138","key":"10.1016\/j.ic.2026.105455_bib0002","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.dam.2011.12.023","article-title":"A parallelogram tile fills the plane by translation in at most two distinct ways","volume":"160","author":"Blondin Mass\u00e9","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ic.2026.105455_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.aam.2026.103080","article-title":"Christoffel and Fibonacci tiles are prime double squares","volume":"177","author":"Ascolese","year":"2026","journal-title":"Adv. Appl. Math."},{"issue":"36","key":"10.1016\/j.ic.2026.105455_bib0004","doi-asserted-by":"crossref","first-page":"4778","DOI":"10.1016\/j.tcs.2010.12.034","article-title":"Two infinite families of polyominoes that tile the plane by translation in two distinct ways","volume":"412","author":"Blondin Mass\u00e9","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105455_bib0005","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.tcs.2012.10.040","article-title":"Combinatorial properties of double square tiles","volume":"502","author":"Mass\u00e9","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105455_bib0006","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.dam.2024.02.022","article-title":"Proving a conjecture on prime double square tiles","volume":"350","author":"Ascolese","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ic.2026.105455_bib0007","series-title":"Proceedings of the 24th Italian Conference on Theoretical Computer Science","article-title":"Setting the path to the combinatorial characterization of prime double square polyominoes","author":"Ascolese","year":"2023"},{"key":"10.1016\/j.ic.2026.105455_bib0008","unstructured":"OEIS Foundation Inc., The On-line Encyclopedia of Integer Sequences, 2011. http:\/\/oeis.org."},{"key":"10.1016\/j.ic.2026.105455_bib0009","series-title":"Picture Processing and Psychopictorics","first-page":"241","article-title":"Boundary encoding and processing","author":"Freeman","year":"1970"},{"key":"10.1016\/j.ic.2026.105455_bib0010","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","article-title":"On the encoding of arbitrary geometric configurations","volume":"10","author":"Freeman","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/j.ic.2026.105455_bib0011","series-title":"GASCom, Int. Conf. on Random Generation of Combinatorial Structures","first-page":"53","article-title":"Palindromic lacunas of the Thue-Morse word","author":"Mass\u00e9","year":"2008"},{"key":"10.1016\/j.ic.2026.105455_bib0012","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.dam.2008.05.026","article-title":"On the tiling by translation problem","volume":"157","author":"Brlek","year":"2009","journal-title":"Discrete Appl. Math."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000520?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000520?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T02:25:58Z","timestamp":1777170358000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540126000520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":12,"alternative-id":["S0890540126000520"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105455","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the generation and enumeration of prime double square polyominoes","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105455","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"105455"}}