{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:04:57Z","timestamp":1778756697829,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00270-5","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"205-223","source":"Crossref","is-referenced-by-count":16,"title":["Sorting with two ordered stacks in series"],"prefix":"10.1016","volume":"289","author":[{"given":"M.D.","family":"Atkinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.M.","family":"Murphy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Ru\u0161kuc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00270-5_BIB1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0012-365X(98)00162-9","article-title":"Restricted permutations","volume":"195","author":"Atkinson","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(01)00270-5_BIB2","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\/S0304-3975(01)00270-5_BIB3","unstructured":"R. Cori, B. Jacquard, G. Schaeffer, Description trees for some families of planar maps, Proc. 9th Conf. on Formal Power Series and Algebraic Combinatorics, Vienna, 1997, see also http:\/\/www.liafa.jussieu.fr\/cp\/FPSAC\/FPSAC97\/ARTICLES\/Schaeffer.ps.gz"},{"key":"10.1016\/S0304-3975(01)00270-5_BIB4","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1006\/jcta.1996.0074","article-title":"Raney paths and a combinatorial relationship between nonseparable rooted planar maps and two-stack-sortable permutations","volume":"75","author":"Goulden","year":"1996","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0304-3975(01)00270-5_BIB5","unstructured":"D.E. Knuth, Fundamental Algorithms, The Art of Computer Programming, vol. 1, 2nd ed., Addison-Wesley, Reading, MA, 1973."},{"key":"10.1016\/S0304-3975(01)00270-5_BIB6","unstructured":"B. Jacquard, Cartes et arbres; enumeration, generation et dessins, Ph.D. thesis, \u00c9cole Polytechnique, Palaiseau, 1997."},{"key":"10.1016\/S0304-3975(01)00270-5_BIB7","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1006\/aama.1999.0673","article-title":"Enumeration of planar constellations","volume":"24","author":"Bousquet-M\u00e9lou","year":"2000","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0304-3975(01)00270-5_BIB8","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\/S0304-3975(01)00270-5_BIB9","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":"Eur. J. Combin."},{"key":"10.1016\/S0304-3975(01)00270-5_BIB10","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00270-5_BIB11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.4153\/CJM-1963-029-x","article-title":"A census of planar maps","volume":"15","author":"Tutte","year":"1963","journal-title":"Canad. J. Math."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(01)00270-5_BIB12","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(93)90321-J","article-title":"Sorting twice through a stack","volume":"117","author":"West","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00270-5_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(92)90351-F","article-title":"A proof of Julian West's conjecture that the number of 2-stack-sortable permutations of length n is 2 (3n)!\/((2n+1)!(n+1)!)","volume":"102","author":"Zeilberger","year":"1992","journal-title":"Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002705?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002705?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:22:38Z","timestamp":1554772958000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501002705"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00270-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}