{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:55:30Z","timestamp":1743130530919,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030115081"},{"type":"electronic","value":"9783030115098"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-11509-8_10","type":"book-chapter","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T14:54:48Z","timestamp":1547823288000},"page":"109-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms"],"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":[[2019,1,19]]},"reference":[{"key":"10_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":"10_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.endm.2017.06.021","volume":"61","author":"Andrei Asinowski","year":"2017","unstructured":"Asinowski, A., Barequet, G., Zheng, Y.: Enumerating polyominoes with fixed perimeter defect. In: Proceedings of 9th European Conference on Combinatorics, Graph Theory, and Applications, vol. 61, pp. 61\u201367. Elsevier, Vienna, August 2017","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"10_CR3","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"},{"issue":"7","key":"10_CR4","doi-asserted-by":"crossref","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. Commun. ACM 59(7), 88\u201395 (2016)","journal-title":"Commun. ACM"},{"issue":"03","key":"10_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S0305004100032680","volume":"53","author":"S. R. Broadbent","year":"1957","unstructured":"Broadbent, S., Hammersley, J.: Percolation processes: I. Crystals and Mazes. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 53, pp. 629\u2013641. Cambridge University Press, Cambridge (1957)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"1","key":"10_CR6","doi-asserted-by":"crossref","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":"10","key":"10_CR7","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":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-44863-2_21","volume-title":"Computational Science\u2014ICCS 2003","author":"I Jensen","year":"2003","unstructured":"Jensen, I.: Counting polyominoes: a parallel implementation for cluster computing. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2659, pp. 203\u2013212. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44863-2_21"},{"key":"10_CR9","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. Canad. J. Math. 19, 851\u2013863 (1967)","journal-title":"Canad. J. Math."},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"585","DOI":"10.4153\/CJM-1973-060-4","volume":"25","author":"D Klarner","year":"1973","unstructured":"Klarner, D., Rivest, R.: A procedure for improving the upper bound for the number of n-ominoes. Canad. J. Math. 25(3), 585\u2013602 (1973)","journal-title":"Canad. J. Math."},{"issue":"2","key":"10_CR11","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. Combin. 3(2), 357\u2013384 (1999)","journal-title":"Ann. Combin."},{"issue":"3\u20134","key":"10_CR12","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":"10_CR13","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":"10_CR14","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":"001","key":"10_CR15","first-page":"1","volume":"3","author":"RA Sulanke","year":"2000","unstructured":"Sulanke, R.A.: Moments of generalized Motzkin paths. J. Integer Seq. 3(001), 1 (2000)","journal-title":"J. Integer Seq."},{"issue":"2\u20133","key":"10_CR16","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":"4","key":"10_CR17","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","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11509-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:20:18Z","timestamp":1710264018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11509-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030115081","9783030115098"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11509-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kharagpur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.iitkgp.ac.in\/conf\/CALDAM\/","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":"86","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":"22","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":"3","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":"26% - 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","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":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}}]}}