{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:55:24Z","timestamp":1770753324468,"version":"3.50.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540571551","type":"print"},{"value":"9783540479185","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_248","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:05:43Z","timestamp":1330239943000},"page":"200-209","source":"Crossref","is-referenced-by-count":8,"title":["Pattern matching for permutations"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Jonathan F.","family":"Buss","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"D.G. Corneil, H. Lerchs, L. Stewart Burlingham, Complement-reducible graphs, Discrete Applied Math. 3, 163\u2013174, 1981.","journal-title":"Discrete Applied Math."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14, 926\u2013934, 1985.","journal-title":"SIAM J. Computing"},{"key":"20_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 and F.-H. Wang, Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Information Processing Letters 43, 293\u2013295, 1992.","journal-title":"Information Processing Letters"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/B978-0-12-417750-5.50011-7","volume-title":"Theory of Machines and Computations","author":"S. Even","year":"1971","unstructured":"S. Even and A. Itai, Queues, stacks and graphs, in Theory of Machines and Computations, ed. Z. Kohavi and A. Paz, Academic Press, New York, 71\u201386, 1971."},{"key":"20_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"20_CR6","unstructured":"D.E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 2nd edition, Addison-Wesley, 1973."},{"key":"20_CR7","unstructured":"L. Lov\u00e1sz, Combinatorial Problems and Exercises, North-Holland, 1979."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"V.R. Pratt, Computing permutations with double-ended queues, parallal stacks, and parallel queries, Fifth ACM Symposium on Theory of Computing, 268\u2013277, 1973.","DOI":"10.1145\/800125.804058"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0012-365X(81)90165-5","volume":"33","author":"D. Rotem","year":"1981","unstructured":"D. Rotem, Stack-sortable permutations, Discrete Math, 33, 185\u2013196, 1981.","journal-title":"Discrete Math"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","volume":"6","author":"R. Simion","year":"1985","unstructured":"R. Simion and F.W. Schmidt, Restricted permutations, European J. Combinatorics 6, 383\u2013405, 1985.","journal-title":"European J. Combinatorics"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/321694.321704","volume":"19","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan, Sorting using networks of queues and stacks, J. Assoc. Computing Machinery 19, 341\u2013346, 1972.","journal-title":"J. Assoc. Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_248.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:08:16Z","timestamp":1605629296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_248","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}