{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T21:20:23Z","timestamp":1768857623883,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0012-365x(98)00162-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"27-38","source":"Crossref","is-referenced-by-count":30,"title":["Restricted permutations"],"prefix":"10.1016","volume":"195","author":[{"given":"M.D.","family":"Atkinson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00162-9_BIB1","unstructured":"M.D. Atkinson, Restricted permutations, http:\/\/www-theory.dcs.st-and.ac.uk\/~mda\/publications\/Restricted.ps."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0012-365X(96)00140-9","article-title":"Permutations avoiding certain patterns: the case of length 4 and generalizations","volume":"175","author":"B\u00f3na","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/jcta.1997.2800","article-title":"Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps","volume":"80","author":"B\u00f3na","year":"1997","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(98)00162-9_BIB4","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1006\/aama.1997.0528","article-title":"The number of permutations with exactly r 132-subsequences is P-recursive in the size!","volume":"18","author":"B\u00f3na","year":"1997","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB5","doi-asserted-by":"crossref","unstructured":"M. B\u00f3na, Permutations with one or two 132-subsequences, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(97)00062-9"},{"key":"10.1016\/S0012-365X(98)00162-9_BIB6","first-page":"200","article-title":"Pattern matching for permutations, WADS '93","volume":"vol. 709","author":"Bose","year":"1993"},{"key":"10.1016\/S0012-365X(98)00162-9_BIB7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0097-3165(96)80012-4","article-title":"Partitioning permutations into increasing and decreasing subsequences","volume":"74","author":"K\u00e9zdy","year":"1996","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0012-365X(98)00162-9_BIB8","article-title":"Fundamental Algorithms","volume":"vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/S0012-365X(98)00162-9_BIB9","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(95)00247-T","article-title":"The number of permutations containing exactly one increasing subsequence of length three","volume":"152","author":"Noonan","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB10","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/aama.1996.0016","article-title":"The enumeration of permutations with a prescribed number of forbidden patterns","volume":"17","author":"Noonan","year":"1996","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB11","first-page":"268","article-title":"Computing permutations with double-ended queues, parallel stacks and parallel queues","volume":"vol. 5","author":"Pratt","year":"1973"},{"key":"10.1016\/S0012-365X(98)00162-9_BIB12","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","year":"1958"},{"key":"10.1016\/S0012-365X(98)00162-9_BIB13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/0404025","article-title":"Bootstrap percolation, the Schr\u00f6der number, and the N-kings problem","volume":"2","author":"Shapiro","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","article-title":"Restricted permutations","volume":"6","author":"Simion","year":"1985","journal-title":"Europ. J. Combin."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(94)90242-9","article-title":"Forbidden subsequences","volume":"132","author":"Stankova","year":"1994","journal-title":"Discrete Math."},{"issue":"5","key":"10.1016\/S0012-365X(98)00162-9_BIB16","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/eujc.1996.0044","article-title":"Classification of forbidden subsequences of length 4","volume":"17","author":"Stankova","year":"1996","journal-title":"European J. Combin."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB17","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","article-title":"Sorting using networks of queues and stacks","volume":"19","author":"Tarjan","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/S0012-365X(98)00162-9_BIB18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(94)00067-1","article-title":"Generating trees and the Catalan and Schr\u00f6der numbers","volume":"146","author":"West","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00162-9_BIB19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0012-365X(96)83023-8","article-title":"Generating trees and forbidden sequences","volume":"157","author":"West","year":"1996","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001629?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001629?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:55:13Z","timestamp":1556117713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0012365X98001629"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00162-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}