{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:52:09Z","timestamp":1743126729525,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_41","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"519-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Minimal-Perimeter Lattice Animals"],"prefix":"10.1007","author":[{"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":[[2020,12,3]]},"reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11907350_2","volume-title":"Discrete Geometry for Computer Imagery","author":"Y Altshuler","year":"2006","unstructured":"Altshuler, Y., Yanovsky, V., Vainsencher, D., Wagner, I.A., Bruckstein, A.M.: On minimal perimeter polyminoes. In: Kuba, A., Ny\u00fal, L.G., Pal\u00e1gyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 17\u201328. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11907350_2"},{"key":"41_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, Vienna, Austria, vol. 61, pp. 61\u201367. Elsevier (2017)","DOI":"10.1016\/j.endm.2017.06.021"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Asinowski, A., Barequet, G., Zheng, Y.: Polycubes with small perimeter defect. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, pp. 93\u2013100, January 2018","DOI":"10.1137\/1.9781611975031.6"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-319-94776-1_11","volume-title":"Computing and Combinatorics","author":"G Barequet","year":"2018","unstructured":"Barequet, G., Ben-Shachar, G.: Properties of minimal-perimeter polyominoes. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 120\u2013129. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_11"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-030-11509-8_10","volume-title":"Algorithms and Discrete Applied Mathematics","author":"G Barequet","year":"2019","unstructured":"Barequet, G., Ben-Shachar, G.: Minimal-perimeter polyominoes: chains, roots, and algorithms. In: Pal, S.P., Vijayakumar, A. (eds.) CALDAM 2019. LNCS, vol. 11394, pp. 109\u2013123. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11509-8_10"},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1515\/zna-1990-0113","volume":"45","author":"J Brunvoll","year":"1990","unstructured":"Brunvoll, J., Cyvin, S.: What do we know about the numbers of benzenoid isomers? Zeitschrift f\u00fcr Naturforschung A 45(1), 69\u201380 (1990)","journal-title":"Zeitschrift f\u00fcr Naturforschung A"},{"issue":"5","key":"41_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0009-2614(91)90229-3","volume":"176","author":"SJ Cyvin","year":"1991","unstructured":"Cyvin, S.J., Brunvoll, J.: Series of benzenoid hydrocarbons with a constant number of isomers. Chem. Phys. Lett. 176(5), 413\u2013416 (1991)","journal-title":"Chem. Phys. Lett."},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10406630903492349","volume":"30","author":"J Dias","year":"2010","unstructured":"Dias, J.: New general formulations for constant-isomer series of polycyclic benzenoids. Polycyclic Aromat. Compd. 30, 1\u20138 (2010)","journal-title":"Polycyclic Aromat. Compd."},{"key":"41_CR9","unstructured":"Dias, J.: Handbook of Polycyclic Dydrocarbons. Part A: Benzenoid Hydrocarbons. Elsevier, New York (1987)"},{"key":"41_CR10","unstructured":"Eden, M.: A two-dimensional growth process. In: Neyman, J. (ed.) Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, vol. 4, pp. 223\u2013239 (1961)"},{"issue":"1","key":"41_CR11","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. Comb. 17(1), 65 (2010)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"41_CR12","first-page":"1","volume":"1","author":"F Harary","year":"1976","unstructured":"Harary, F., Harborth, H.: Extremal animals. J. Comb. Inf. Syst. Sci. 1(1), 1\u20138 (1976)","journal-title":"J. Comb. Inf. Syst. Sci."},{"issue":"29","key":"41_CR13","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. Phys. A: Math. General 33(29), L257 (2000)","journal-title":"J. Phys. A: Math. General"},{"issue":"5","key":"41_CR14","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/BF01026565","volume":"58","author":"S Mertens","year":"1990","unstructured":"Mertens, S.: Lattice animals: a fast enumeration algorithm and new perimeter polynomials. J. Stat. Phys. 58(5), 1095\u20131108 (1990)","journal-title":"J. Stat. Phys."},{"issue":"2","key":"41_CR15","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. Discret. Math. 36(2), 191\u2013203 (1981)","journal-title":"Discret. Math."},{"issue":"1","key":"41_CR16","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. Eur. J. Comb. 29(1), 108\u2013117 (2008)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"41_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRev.103.1","volume":"103","author":"H Temperley","year":"1956","unstructured":"Temperley, H.: Combinatorial problems suggested by the statistical mechanics of domains and of rubber-like molecules. Phys. Rev. 103(1), 1 (1956)","journal-title":"Phys. Rev."},{"issue":"1\u20132","key":"41_CR18","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.M.: On isoperimetrically optimal polyforms. Theor. Comput. Sci. 406(1\u20132), 146\u2013159 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"41_CR19","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1137\/0132073","volume":"32","author":"DL 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":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:53:05Z","timestamp":1606945985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}