{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:44:11Z","timestamp":1742917451811,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221762"},{"type":"electronic","value":"9783319221779"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22177-9_4","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T10:05:43Z","timestamp":1438596343000},"page":"41-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Enumeration of Permutominoes"],"prefix":"10.1007","author":[{"given":"Ana Paula","family":"Tom\u00e1s","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proeedings CCCG 1996, pp. 38\u201343 (1996)","DOI":"10.1515\/9780773591134-009"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1080\/10236199908808200","volume":"5","author":"E Barcucci","year":"1999","unstructured":"Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: ECO: a methodology for the enumeration of combinatorial objects. J. Differ. Equ. Appl. 5, 435\u2013490 (1999)","journal-title":"J. Differ. Equ. Appl."},{"key":"4_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. Discrete Algorithms 5, 348\u2013355 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Beaton, N., Disanto, F., Guttmann, A.J., Rinaldi, S.: On the enumeration of column-convex permutominoes. In: Proceedings of FPSAC 2011, Iceland (2011)","DOI":"10.46298\/dmtcs.2895"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1016\/j.ic.2008.03.009","volume":"206","author":"B Boldi","year":"2008","unstructured":"Boldi, B., Lonati, V., Radicioni, R., Santini, M.: The number of convex permutominoes. Inf. Comput. 206, 1074\u20131083 (2008)","journal-title":"Inf. Comput."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(92)00103-S","volume":"48","author":"M Bousquet-M\u00e9lou","year":"1994","unstructured":"Bousquet-M\u00e9lou, M.: Bijection of convex polyominoes and equations for enumerating them according to area. Discrete Appl. Math. 48, 21\u201343 (1994)","journal-title":"Discrete Appl. Math."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/s00224-009-9192-8","volume":"47","author":"M Damian","year":"2010","unstructured":"Damian, M., Flatland, R., ORourke, J., Ramaswami, S.: Connecting polygonizations via stretches and twangs. Theor. Comp. Syst. 47, 674\u2013695 (2010)","journal-title":"Theor. Comp. Syst."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.disc.2003.10.014","volume":"280","author":"E Deutsch","year":"2004","unstructured":"Deutsch, E.: Enumerating symmetric directed convex polyominoes. Discrete Math. 280, 225\u2013231 (2004)","journal-title":"Discrete Math."},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"R57","DOI":"10.37236\/975","volume":"14","author":"F Disanto","year":"2007","unstructured":"Disanto, F., Frosini, A., Pinzani, R., Rinaldi, S.: A closed formula for the number of convex permutominoes. Electron. J. Combin. 14, R57 (2007)","journal-title":"Electron. J. Combin."},{"key":"4_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9780691215051","volume-title":"Polyominoes","author":"S Golomb","year":"1994","unstructured":"Golomb, S.: Polyominoes. Princeton U. Press, Princeton (1994)"},{"key":"4_CR11","first-page":"93","volume":"19","author":"E Grazzini","year":"2008","unstructured":"Grazzini, E., Pergola, E., Poneti, M.: On the exhaustive generation of convex permutominoes. Pure Math. Appl. 19, 93\u2013104 (2008)","journal-title":"Pure Math. Appl."},{"key":"4_CR12","unstructured":"Hickerson, D.: Counting horizontally convex polyominoes. J. Integer Sequences 2, Article 99.1.8 (1999)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00026-006-0294-6","volume":"10","author":"F Insitti","year":"2006","unstructured":"Insitti, F.: Permutation diagrams, fixed points and Kazhdan-Lusztig R-polynomials. Ann. Comb. 10, 369\u2013387 (2006)","journal-title":"Ann. Comb."},{"key":"4_CR14","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. Stat. Phys. 102, 865\u2013881 (2001)","journal-title":"J. Stat. Phys."},{"key":"4_CR15","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 - ICCS 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., Zomaya, A.Y. (eds.) ICCS 2003, Part III. LNCS, vol. 2659, pp. 203\u2013212. Springer, Heidelberg (2003)"},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"R60","DOI":"10.37236\/1813","volume":"11","author":"A Del Lungo","year":"2004","unstructured":"Del Lungo, A., Duchi, E., Frosini, A., Rinaldi, S.: On the generation and enumeration of some classes of convex polyominoes. Electron. J. Combin. 11, R60 (2004)","journal-title":"Electron. J. Combin."},{"key":"4_CR17","first-page":"102","volume":"6","author":"AM Martins","year":"2006","unstructured":"Martins, A.M., Bajuelos, A.: Vertex guards in a subclass of orthogonal polygons. Int. J. Comput. Sci. Netw. Secur. 6, 102\u2013108 (2006)","journal-title":"Int. J. Comput. Sci. Netw. Secur."},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/0196-6774(88)90028-4","volume":"9","author":"M Overmars","year":"1998","unstructured":"Overmars, M., Wood, D.: On rectangular visibility. J. Algorithms 9(3), 372\u2013390 (1998)","journal-title":"J. Algorithms"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF01918136","volume":"21","author":"J O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J.: An alternate proof of the rectilinear art gallery theorem. J. Geom. 21, 118\u2013130 (1983)","journal-title":"J. Geom."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Rinaldi, S., Socci, S.: About half permutations. Electr. J. Comb. 21(1), P1.35 (2014)","DOI":"10.37236\/3490"},{"key":"4_CR21","unstructured":"Sloane, N.J.A.: The On-Line encyclopedia of integer sequences. OEIS Foundation. http:\/\/oeis.org\/"},{"key":"4_CR22","unstructured":"Sohler, C.: Generating random star-shaped polygons. In: Proceedings CCCG 1999 (1999)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-540-24767-8_13","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"AP Tom\u00e1s","year":"2004","unstructured":"Tom\u00e1s, A.P., Bajuelos, A.: Quadratic-time linear-space algorithms for generating orthogonal polygons with a given number of vertices. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 117\u2013126. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24767-8_13"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0925-7721(95)00031-3","volume":"6","author":"C Zhu","year":"1996","unstructured":"Zhu, C., Sundaram, G., Snoeyink, J., Mitchell, J.S.B.: Generating random polygons with given vertices. Comput. Geom. 6, 277\u2013290 (1996)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22177-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T19:42:09Z","timestamp":1691869329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22177-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221762","9783319221779"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22177-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}