{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:05:14Z","timestamp":1780491914861,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2017684"],"award-info":[{"award-number":["2017684"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00453-026-01392-6","type":"journal-article","created":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T12:14:36Z","timestamp":1780488876000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counting Polyominoes, Revisited"],"prefix":"10.1007","volume":"88","author":[{"given":"Gill","family":"Barequet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gil","family":"Ben-Shachar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,3]]},"reference":[{"issue":"3","key":"1392_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1002\/1520-6750(199204)39:3<399::AID-NAV3220390309>3.0.CO;2-0","volume":"39","author":"A Assad","year":"1992","unstructured":"Assad, A., Xu, W.: The quadratic minimum spanning tree problem. Naval Research Logistics (NRL) 39(3), 399\u2013417 (1992)","journal-title":"Naval Research Logistics (NRL)"},{"key":"1392_CR2","doi-asserted-by":"crossref","unstructured":"Barequet, G., Ben-Shachar, G.: Counting polyominoes, revisited. In: 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pp. 133\u2013143. , SIAM (2024)","DOI":"10.1137\/1.9781611977929.10"},{"issue":"2","key":"1392_CR3","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.jda.2005.08.001","volume":"5","author":"G Barequet","year":"2007","unstructured":"Barequet, G., Moffie, M.: On the complexity of Jensen\u2019s algorithm for counting fixed polyominoes. J. of Discrete Algorithms 5(2), 348\u2013355 (2007)","journal-title":"J. of Discrete Algorithms"},{"issue":"7","key":"1392_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/2851485","volume":"59","author":"G Barequet","year":"2016","unstructured":"Barequet, G., Rote, G., Shalah, M.: $$\\lambda > 4$$: An improved lower bound on the growth constant of polyominoes. Comm. of the ACM 59(7), 88\u201395 (2016)","journal-title":"Comm. of the ACM"},{"key":"1392_CR5","doi-asserted-by":"crossref","unstructured":"Barequet, G., Shalah, M.: Improved upper bounds on the growth constants of polyominoes and polycubes. In: Latin American Symposium on Theoretical Informatics, pp. 532\u2013545. Springer (2021). A full version to appear in Algorithmica","DOI":"10.1007\/978-3-030-61792-9_42"},{"key":"1392_CR6","doi-asserted-by":"crossref","unstructured":"Broadbent, S., Hammersley, J.: Percolation processes: I. Crystals and Mazes. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol.\u00a053, pp. 629\u2013641. Cambridge University Press (1957)","DOI":"10.1017\/S0305004100032680"},{"issue":"2","key":"1392_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1088\/0305-4470\/28\/2\/011","volume":"28","author":"A Conway","year":"1995","unstructured":"Conway, A.: Enumerating 2d percolation series by the finite-lattice method: Theory. J. of Physics A: Mathematical and General 28(2), 335\u2013349 (1995)","journal-title":"J. of Physics A: Mathematical and General"},{"issue":"12","key":"1392_CR8","doi-asserted-by":"publisher","first-page":"3713","DOI":"10.1088\/0305-4470\/13\/12\/021","volume":"13","author":"IG Enting","year":"1980","unstructured":"Enting, I.G.: Generating functions for enumerating self-avoiding rings on the square lattice. J. of Physics A: Mathematical and General 13(12), 3713 (1980)","journal-title":"J. of Physics A: Mathematical and General"},{"key":"1392_CR9","volume-title":"Polygons","year":"2009","unstructured":"Guttmann, A. (ed.): Polygons. Polyominoes and Polycubes. Springer, Dordrecht (2009)"},{"key":"1392_CR10","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1023\/A:1004855020556","volume":"102","author":"I Jensen","year":"2001","unstructured":"Jensen, I.: Enumerations of lattice animals and trees. J. of statistical physics 102, 865\u2013881 (2001)","journal-title":"J. of statistical physics"},{"key":"1392_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-44863-2_21","volume-title":"Computational Science - ICCS 2003","author":"I Jensen","year":"2003","unstructured":"Jensen, I.: Counting polyominoes: A parallel implementation for cluster computing. In: Sloot, P., Abramson, D., Bogdanov, A., Gorbachev, Y., Dongarra, J., Zomaya, A. (eds.) Computational Science - ICCS 2003, pp. 203\u2013212. Springer, Berlin Heidelberg, Berlin, Heidelberg (2003)"},{"key":"1392_CR12","doi-asserted-by":"publisher","first-page":"851","DOI":"10.4153\/CJM-1967-080-4","volume":"19","author":"D Klarner","year":"1967","unstructured":"Klarner, D.: Cell growth problems. Canadian J. of Mathematics 19, 851\u2013863 (1967)","journal-title":"Canadian J. of Mathematics"},{"key":"1392_CR13","unstructured":"Knuth, D.: Polynum and polyslave, programs available from knuth\u2019s home-page at https:\/\/www-cs-faculty.stanford.edu\/~knuth\/programs.html#polyominoes (2001)"},{"key":"1392_CR14","unstructured":"Knuth, D.: Problems that Philippe would have loved. Presented in AofA\u201914 in memory of F.\u00a0Flajolet, available at https:\/\/www-cs-faculty.stanford.edu\/~knuth\/papers\/flaj2014.pdf (2014)"},{"key":"1392_CR15","unstructured":"Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, Volume 2. Addison-Wesley Professional (2014)"},{"issue":"2","key":"1392_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF01608793","volume":"3","author":"N Madras","year":"1999","unstructured":"Madras, N.: A pattern fm for lattice clusters. Ann. Comb. 3(2), 357\u2013384 (1999)","journal-title":"Ann. Comb."},{"issue":"2","key":"1392_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(81)90237-5","volume":"36","author":"D Redelmeier","year":"1981","unstructured":"Redelmeier, D.: Counting polyominoes: yet another attack. Discret. Math. 36(2), 191\u2013203 (1981)","journal-title":"Discret. Math."},{"key":"1392_CR18","doi-asserted-by":"crossref","unstructured":"Sloane, N., et\u00a0al.: The on-line encyclopedia of integer sequences. Published electronically at https:\/\/oeis.org (2018)","DOI":"10.1090\/noti1734"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-026-01392-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-026-01392-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-026-01392-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T12:14:40Z","timestamp":1780488880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-026-01392-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1392"],"URL":"https:\/\/doi.org\/10.1007\/s00453-026-01392-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"22 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"51"}}