{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:17:40Z","timestamp":1759335460232,"version":"3.32.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9208,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1016\/0097-3165(88)90071-4","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"12-31","source":"Crossref","is-referenced-by-count":24,"title":["Generating functions for column-convex polyominoes"],"prefix":"10.1016","volume":"48","author":[{"given":"M.P","family":"Delest","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(88)90071-4_BIB1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(74)90134-4","article-title":"Convex n-ominoes","volume":"8","author":"Bender","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(88)90071-4_BIB2","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.4153\/CJM-1981-078-2","article-title":"Planar maps are well labeled trees","volume":"33","author":"Cori","year":"1981","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(88)90071-4_BIB3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(84)90116-6","article-title":"Algebraic languages and polyominoes enumeration","volume":"34","author":"Delest","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0097-3165(88)90071-4_BIB4","first-page":"455","article-title":"A non-commutative generalization and q-analog of the Lagrange inversion formula","volume":"257","author":"Gessel","year":"1980","journal-title":"Trans. Amer. Math. Soc."},{"year":"1965","series-title":"Polyominoes","author":"Golomb","key":"10.1016\/0097-3165(88)90071-4_BIB5"},{"key":"10.1016\/0097-3165(88)90071-4_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00150517.1965.12431450","article-title":"Some results concerning polyominoes","volume":"3","author":"Klarner","year":"1965","journal-title":"Fibonacci Quart."},{"key":"10.1016\/0097-3165(88)90071-4_BIB7","doi-asserted-by":"crossref","first-page":"851","DOI":"10.4153\/CJM-1967-080-4","article-title":"Cell growth problems","volume":"19","author":"Klarner","year":"1967","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(88)90071-4_BIB8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0012-365X(74)90107-1","article-title":"Asymptotic bounds for the number of convex n-ominoes","volume":"8","author":"Klarner","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(88)90071-4_BIB9","series-title":"Computers in Number Theory","first-page":"347","article-title":"Counting polyominoes","author":"Lunnon","year":"1971"},{"year":"1983","key":"10.1016\/0097-3165(88)90071-4_BIB10"},{"key":"10.1016\/0097-3165(88)90071-4_BIB11","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S0021-9800(69)80113-4","article-title":"On the number of certain lattice polygons","volume":"6","author":"Polya","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0097-3165(88)90071-4_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4153\/CJM-1962-001-2","article-title":"Contributions to the cell growth problem","volume":"14","author":"Read","year":"1962","journal-title":"Canad. J. Math."},{"key":"10.1016\/0097-3165(88)90071-4_BIB13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(81)90237-5","article-title":"Counting polyominoes: Yet an another attack","volume":"36","author":"Redelmeier","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(88)90071-4_BIB14","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","article-title":"Context-free languages and pushdown automata","volume":"6","author":"Sch\u00fctzenberger","year":"1963","journal-title":"Inform. and Control"},{"key":"10.1016\/0097-3165(88)90071-4_BIB15","series-title":"International Conference in Medicine and Biology","article-title":"Enumeration of RNAS by complexity","author":"Vauchaussade de Chaumont","year":"1983"},{"key":"10.1016\/0097-3165(88)90071-4_BIB16","unstructured":"G. Viennot, Probl\u00e8mes combinatoires pos\u00e9s par la Physique statistique S\u00e9minaire Bourbaki, 36e ann\u00e9e, No. 626, \u201cAst\u00e9risque,\u201d Soc. Math., France."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316588900714?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316588900714?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T19:23:25Z","timestamp":1734636205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316588900714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["0097316588900714"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(88)90071-4","relation":{},"ISSN":["0097-3165"],"issn-type":[{"type":"print","value":"0097-3165"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}