{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T08:58:27Z","timestamp":1772441907339,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1023\/a:1016500300436","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T03:32:49Z","timestamp":1041132769000},"page":"101-113","source":"Crossref","is-referenced-by-count":23,"title":["Partially Well-Ordered Closed Sets of Permutations"],"prefix":"10.1007","volume":"19","author":[{"given":"M. D.","family":"Atkinson","sequence":"first","affiliation":[]},{"given":"M. M.","family":"Murphy","sequence":"additional","affiliation":[]},{"given":"N.","family":"Ru\u0161kuc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"403807_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0012-365X(98)00162-9","volume":"195","author":"M. D. Atkinson","year":"1999","unstructured":"Atkinson, M. D. (1999) Restricted permutations, Discrete Math.\n195, 27\u201338.","journal-title":"Discrete Math."},{"key":"403807_CR2","unstructured":"Atkinson, M. D. and Stitt, T. Restricted permutations and the wreath product, In preparation."},{"key":"403807_CR3","doi-asserted-by":"crossref","unstructured":"Atkinson, M. D. (1998) Permutations which are the union of an increasing and a decreasing sequence, Electron. J. Combin.\n5, Paper R6.","DOI":"10.37236\/1344"},{"key":"403807_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1017\/S096354839800354X","volume":"7","author":"M. D. Atkinson","year":"1998","unstructured":"Atkinson, M. D. (1998) Generalised stack permutations, Combinatorics, Probability and Computing\n7, 239\u2013246.","journal-title":"Combinatorics, Probability and Computing"},{"key":"403807_CR5","unstructured":"Atkinson, M. D. and Beals, R. Finiteness conditions on closed classes of permutations, unpublished."},{"key":"403807_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P. Bose","year":"1998","unstructured":"Bose, P., Buss, J. F. and Lubiw, A. (1998) Pattern matching for permutations, Inform. Process. Lett.\n65, 277\u2013283.","journal-title":"Inform. Process. Lett."},{"key":"403807_CR7","volume-title":"Basic Techniques of Combinatorial Theory","author":"D. I. A. Cohen","year":"1978","unstructured":"Cohen, D. I. A. (1978) Basic Techniques of Combinatorial Theory, Wiley, New York."},{"key":"403807_CR8","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G. (1952) Ordering by divisibility in abstract algebras, Proc. London Math. Soc.\n2, 326\u2013336.","journal-title":"Proc. London Math. Soc."},{"key":"403807_CR9","volume-title":"Fundamental Algorithms, The Art of Computer Programming, Vol. 1","author":"D. E. Knuth","year":"1967","unstructured":"Knuth, D. E. (1967) Fundamental Algorithms, The Art of Computer Programming, Vol. 1, 1st edn, Addison-Wesley, Reading, Mass.","edition":"1st edn"},{"key":"403807_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02881113","volume":"100","author":"V. Lakshmibai","year":"1990","unstructured":"Lakshmibai, V. and Sandhya, B. (1990) Criterion for smoothness of Schubert varieties, Proc. Indian Acad. Sci. Math. Sci.\n100, 45\u201352.","journal-title":"Proc. Indian Acad. Sci. Math. Sci."},{"key":"403807_CR11","unstructured":"Murphy, M. M., Ph.D. Thesis, University of St Andrews, in preparation."},{"key":"403807_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/0404025","volume":"2","author":"L. Shapiro","year":"1991","unstructured":"Shapiro, L. and Stephens, A. B. (1991) Bootstrap percolation, the Sch\u00f6der number, and the N-kings problem, SIAM J. Discrete Math.\n2, 275\u2013280.","journal-title":"SIAM J. Discrete Math."},{"key":"403807_CR13","first-page":"268","volume":"5","author":"V. R. Pratt","year":"1973","unstructured":"Pratt, V. R. (1973) Computing permutations with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory of Computing\n5, 268\u2013277.","journal-title":"Proc. ACM Symp. Theory of Computing"},{"key":"403807_CR14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","volume":"6","author":"R. Simion","year":"1985","unstructured":"Simion, R. and Schmidt, F. W. (1985) Restricted permutations, European J. Combin.\n6, 383\u2013406.","journal-title":"European J. Combin."},{"key":"403807_CR15","doi-asserted-by":"crossref","unstructured":"Spielman, D. A. and B\u00f3na, M. (2000) An infinite antichain of permutations, Note N2, Electron. J. Combin.\n7(1).","DOI":"10.37236\/1540"},{"key":"403807_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(94)90242-9","volume":"132","author":"Z. E. Stankova","year":"1994","unstructured":"Stankova, Z. E. (1994) Forbidden subsequences, Discrete Math.\n132, 291\u2013316.","journal-title":"Discrete Math."},{"issue":"5","key":"403807_CR17","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/eujc.1996.0044","volume":"17","author":"Z. E. Stankova","year":"1996","unstructured":"Stankova, Z. E. (1996) Classification of forbidden subsequences of length 4, European J. Combin.\n17(5), 501\u2013517.","journal-title":"European J. Combin."},{"key":"403807_CR18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R. E. Tarjan","year":"1972","unstructured":"Tarjan, R. E. (1972) Sorting using networks of queues and stacks, J. ACM\n19, 341\u2013346.","journal-title":"J. ACM"},{"key":"403807_CR19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0012-365X(96)83023-8","volume":"157","author":"J. West","year":"1996","unstructured":"West, J. (1996) Generating trees and forbidden sequences, Discrete Math.\n157, 363\u2013374.","journal-title":"Discrete Math."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016500300436.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016500300436\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016500300436.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:47:47Z","timestamp":1751878067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016500300436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["403807"],"URL":"https:\/\/doi.org\/10.1023\/a:1016500300436","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}