{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:58Z","timestamp":1740109318057,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T00:00:00Z","timestamp":1659571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T00:00:00Z","timestamp":1659571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2017684"],"award-info":[{"award-number":["2017684"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["575\/15"],"award-info":[{"award-number":["575\/15"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s00453-022-01008-9","type":"journal-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T12:02:45Z","timestamp":1659614565000},"page":"75-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Counting Minimum-Perimeter Lattice Animals"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7501-6240","authenticated-orcid":false,"given":"Gill","family":"Barequet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil","family":"Ben-Shachar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"1008_CR1","doi-asserted-by":"crossref","unstructured":"Altshuler, Y., Yanovsky, V., Vainsencher, D., Wagner, I., Bruckstein, A.: On minimal perimeter polyminoes. In Proceedings of the 13th International Conference on Discrete Geometry for Computer Imagery, pp. 17\u201328. Springer, Szeged, Hungary (2006)","DOI":"10.1007\/11907350_2"},{"key":"1008_CR2","doi-asserted-by":"crossref","unstructured":"Asinowski, A., Barequet, G., Zheng, Y.: Enumerating polyominoes with fixed perimeter defect. In Proceedings of the 9th European Conference on Combinatorics, Graph Theory, and Applications. Electronic Notes in Discrete Mathematics, vol. 61, pp. 61\u201367. Elsevier, Vienna, Austria (2017)","DOI":"10.1016\/j.endm.2017.06.021"},{"key":"1008_CR3","unstructured":"Barequet, G., Ben-Shachar, G.: Minimal-perimeter lattice animals and the constant-isomer conjecture. Electron. J. Combinat. (accepted)"},{"issue":"7","key":"1008_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":"1008_CR5","doi-asserted-by":"crossref","unstructured":"Barequet, G., Shalah, M.: Improved upper bounds on the growth constants of polyominoes and polycubes. In Proceedings of the 14th Latin American Symposium on Theoretical Informatics, pp. 532\u2013545. S\u00e3o Paulo, Brasil, Springer, postponed to (2021)","DOI":"10.1007\/978-3-030-61792-9_42"},{"key":"1008_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"},{"key":"1008_CR7","volume-title":"Handbook of Polycyclic Dydrocarbons. Part A: Benzenoid Hydrocarbons","author":"J Dias","year":"1987","unstructured":"Dias, J.: Handbook of Polycyclic Dydrocarbons. Part A: Benzenoid Hydrocarbons. Elsevier Science Pub. Co., Inc., New York, NY (1987)"},{"issue":"2","key":"1008_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1215\/S0012-7094-47-01423-3","volume":"14","author":"A Dvoretzky","year":"1947","unstructured":"Dvoretzky, A., Motzkin, T.: A problem of arrangements. Duke Math. J. 14(2), 305\u2013313 (1947)","journal-title":"Duke Math. J."},{"issue":"1","key":"1008_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.37236\/337","volume":"17","author":"G F\u00fclep","year":"2010","unstructured":"F\u00fclep, G., Sieben, N.: Polyiamonds and polyhexes with minimum site-perimeter and achievement games. Electron. J. Combinat. 17(1), 65 (2010)","journal-title":"Electron. J. Combinat."},{"issue":"10","key":"1008_CR10","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/00029890.1954.11988548","volume":"61","author":"S Golomb","year":"1954","unstructured":"Golomb, S.: Checker boards and polyominoes. Am. Math. Mon. 61(10), 675\u2013682 (1954)","journal-title":"Am. Math. Mon."},{"key":"1008_CR11","doi-asserted-by":"crossref","unstructured":"Jensen, I.: Counting polyominoes: A parallel implementation for cluster computing. Proceedings of the International Conference on on Computational Science, part III, pages 203\u2013212, Melbourne, Australia and St. Petersburg, Russia, June 2003. Lecture Notes in Computer Science, 2659. Springer Berlin Heidelberg (2003)","DOI":"10.1007\/3-540-44863-2_21"},{"issue":"29","key":"1008_CR12","doi-asserted-by":"publisher","first-page":"L257","DOI":"10.1088\/0305-4470\/33\/29\/102","volume":"33","author":"I Jensen","year":"2000","unstructured":"Jensen, I., Guttmann, A.: Statistics of lattice animals (polyominoes) and polygons. J. of Physics A: Mathematical and General 33(29), L257 (2000)","journal-title":"J. of Physics A: Mathematical and General"},{"key":"1008_CR13","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"},{"issue":"2","key":"1008_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF01608793","volume":"3","author":"N Madras","year":"1999","unstructured":"Madras, N.: A pattern theorem for lattice clusters. Ann. Comb. 3(2), 357\u2013384 (1999)","journal-title":"Ann. Comb."},{"issue":"4","key":"1008_CR15","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1090\/S0002-9904-1948-09002-4","volume":"54","author":"T Motzkin","year":"1948","unstructured":"Motzkin, T.: Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products. Bull. Am. Math. Soc. 54(4), 352\u2013360 (1948)","journal-title":"Bull. Am. Math. Soc."},{"issue":"3\u20134","key":"1008_CR16","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1006\/aama.2001.0796","volume":"28","author":"E Pergola","year":"2002","unstructured":"Pergola, E., Pinzani, R., Rinaldi, S., Sulanke, R.: A bijective approach to the area of generalized Motzkin paths. Adv. Appl. Math. 28(3\u20134), 580\u2013591 (2002)","journal-title":"Adv. Appl. Math."},{"issue":"2","key":"1008_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(81)90237-5","volume":"36","author":"DH Redelmeier","year":"1981","unstructured":"Redelmeier, D.H.: Counting polyominoes: yet another attack. Discrete Math. 36(2), 191\u2013203 (1981)","journal-title":"Discrete Math."},{"issue":"1","key":"1008_CR18","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ejc.2006.12.008","volume":"29","author":"N Sieben","year":"2008","unstructured":"Sieben, N.: Polyominoes with minimum site-perimeter and full set achievement games. European J. of Combinatorics 29(1), 108\u2013117 (2008)","journal-title":"European J. of Combinatorics"},{"key":"1008_CR19","unstructured":"Sulanke, R.A.: Moments of generalized Motzkin paths. J. Integer Seq. 3(00.1), 14 (2000)"},{"issue":"2\u20133","key":"1008_CR20","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1006\/aama.2001.0753","volume":"27","author":"RA Sulanke","year":"2001","unstructured":"Sulanke, R.A.: Bijective recurrences for Motzkin paths. Adv. Appl. Math. 27(2\u20133), 627\u2013640 (2001)","journal-title":"Adv. Appl. Math."},{"issue":"1\u20132","key":"1008_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.tcs.2008.06.043","volume":"406","author":"D Vainsencher","year":"2008","unstructured":"Vainsencher, D., Bruckstein, A.: On isoperimetrically optimal polyforms. Theoretical Compututer Science 406(1\u20132), 146\u2013159 (2008)","journal-title":"Theoretical Compututer Science"},{"issue":"4","key":"1008_CR22","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1137\/0132073","volume":"32","author":"D-L Wang","year":"1977","unstructured":"Wang, D.-L., Wang, P.: Discrete isoperimetric problems. SIAM J. Appl. Math. 32(4), 860\u2013870 (1977)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01008-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01008-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01008-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T12:05:15Z","timestamp":1674043515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01008-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,4]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1008"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01008-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,8,4]]},"assertion":[{"value":"5 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2022","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":"Conflict of interest"}}]}}