{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:34:23Z","timestamp":1776846863049,"version":"3.51.2"},"reference-count":17,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0020-0190(97)00209-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"277-283","source":"Crossref","is-referenced-by-count":99,"title":["Pattern matching for permutations"],"prefix":"10.1016","volume":"65","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan F.","family":"Buss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00209-3_BIB1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0020-0190(92)90114-B","article-title":"Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs","volume":"43","author":"Chang","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00209-3_BIB2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement-reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Applied Math."},{"key":"10.1016\/S0020-0190(97)00209-3_BIB3","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00209-3_BIB4","series-title":"Theory of Machines and Computations","first-page":"71","article-title":"Queues, stacks and graphs","author":"Even","year":"1971"},{"key":"10.1016\/S0020-0190(97)00209-3_BIB5","series-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(97)00209-3_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0020-0190(97)00209-3_BIB7","article-title":"Finding pattern matchings for permutations","author":"Ibarra","year":"1995","journal-title":"Tech. Rept."},{"key":"10.1016\/S0020-0190(97)00209-3_BIB8","series-title":"The Art of Computer Programming, vol. 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/S0020-0190(97)00209-3_BIB9","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0020-0190(97)00209-3_BIB10","series-title":"Proc. 5th ACM Symp. on Theory of Computing","first-page":"268","article-title":"Computing permutations with double-ended queues, parallel stacks, and parallel queries","author":"Pratt","year":"1973"},{"key":"10.1016\/S0020-0190(97)00209-3_BIB11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0012-365X(81)90165-5","article-title":"Stack-sortable permutations","volume":"33","author":"Rotem","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(97)00209-3_BIB12","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\/S0020-0190(97)00209-3_BIB13","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":"European J. Combinatorics"},{"key":"10.1016\/S0020-0190(97)00209-3_BIB14","doi-asserted-by":"crossref","unstructured":"Z. Stankova, Forbidden subsequences, Discrete Math. (to appear).","DOI":"10.1016\/0012-365X(94)90242-9"},{"key":"10.1016\/S0020-0190(97)00209-3_BIB15","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\/S0020-0190(97)00209-3_BIB16","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\/S0020-0190(97)00209-3_BIB17","article-title":"Generating trees and forbidden subsequences, extended abstract, poster session","author":"West","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:23Z","timestamp":1556058443000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019097002093"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00209-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}