{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:32Z","timestamp":1759637552968},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45678-3_31","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T11:12:14Z","timestamp":1195125134000},"page":"355-367","source":"Crossref","is-referenced-by-count":12,"title":["Algorithms for Pattern Involvement in Permutations"],"prefix":"10.1007","author":[{"given":"Michael H.","family":"Albert","sequence":"first","affiliation":[]},{"given":"Robert E. L.","family":"Aldred","sequence":"additional","affiliation":[]},{"given":"Mike D.","family":"Atkinson","sequence":"additional","affiliation":[]},{"given":"Derek A.","family":"Holton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0012-365X(98)00162-9","volume":"195","author":"M.D. Atkinson","year":"1999","unstructured":"M.D. Atkinson: Restricted permutations, Discrete Math.195 (1999), 27\u201338. 355, 363","journal-title":"Discrete Math."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P. Bose","year":"1998","unstructured":"P. Bose, J.F. Buss, A. Lubiw: Pattern matching for permutations, Inform. Process. Lett.65 (1998), 277\u2013283.","journal-title":"Process. Lett."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0020-0190(92)90114-B","volume":"43","author":"M.-S. Chang","year":"1992","unstructured":"M.-S. Chang, F.-H. Wang: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Inform. Process.L ett. 43 (1992), 293\u2013295.","journal-title":"Process.L ett."},{"key":"31_CR4","unstructured":"O. Guibert: Personal communication."},{"key":"31_CR5","volume-title":"The Art of Computer Programming","author":"D. E. Knuth","year":"1967","unstructured":"D. E. Knuth: Fundamental Algorithms, The Art of Computer Programming Vol.1 (First Edition), Addison-Wesley, Reading, Mass.(1967).","edition":"First Edition"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"V. R. Pratt: Computing permutations with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory of Computing 5 (1973), 268\u2013277.","DOI":"10.1145\/800125.804058"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","volume":"6","author":"R. Simion","year":"1985","unstructured":"R. Simion, F.W. Schmidt: Restricted permutations, Europ. J.C ombinatorics 6 (1985), 383\u2013406.","journal-title":"Europ. J.C ombinatorics"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(94)90242-9","volume":"132","author":"Z.E. Stankova","year":"1994","unstructured":"Z.E. Stankova: Forbidden subsequences, Discrete Math. 132 (1994), 291\u2013316.","journal-title":"Discrete Math."},{"issue":"5","key":"31_CR9","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1006\/eujc.1996.0044","volume":"17","author":"Z. E. Stankova","year":"1996","unstructured":"Z. E. Stankova: Classification of forbidden subsequences of length 4, European J. Combin.17 (1996), no.5, 501\u2013517.","journal-title":"European J. Combin"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan: Sorting using networks of queues and stacks, Journal of the ACM 19 (1972), 341\u2013346.","journal-title":"Journal of the ACM"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0012-365X(96)83023-8","volume":"157","author":"J. West","year":"1996","unstructured":"J. West: Generating trees and forbidden sequences, Discrete Math.157 (1996), 363\u2013374.","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:56:20Z","timestamp":1551092180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}