{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:42Z","timestamp":1759335582081},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":5464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0012-365x(98)00155-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"259-264","source":"Crossref","is-referenced-by-count":8,"title":["Permutations, parenthesis words, and Schr\u00f6der numbers"],"prefix":"10.1016","volume":"190","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Harju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"ten Pas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00155-1_bib1","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 Math. Appl."},{"key":"10.1016\/S0012-365X(98)00155-1_bib2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(80)90168-5","article-title":"Enumeration of ordered trees","volume":"31","author":"Dershowitz","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00155-1_bib3","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(86)90120-2","article-title":"Ordered trees and non-crossing partitions","volume":"62","author":"Dershowitz","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00155-1_bib4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(80)90033-3","article-title":"Chain enumeration and non-crossing partitions","volume":"31","author":"Edelman","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00155-1_bib5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(93)90323-L","article-title":"T-structures, T-functions, and texts","volume":"116","author":"Ehrenfeucht","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(98)00155-1_bib6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0304-3975(94)00272-X","article-title":"Characterization and complexity of uniformly nonprimitive labeled 2-structures","volume":"154","author":"Engelfriet","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(98)00155-1_bib7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1006\/eujc.1996.0005","article-title":"On abab-avoiding and abba-avoiding set partitions","volume":"17","author":"Klazar","year":"1996","journal-title":"European J. Combin."},{"key":"10.1016\/S0012-365X(98)00155-1_bib8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(83)90255-8","article-title":"A correspondence between ordered trees and non-crossing partitions","volume":"46","author":"Prodinger","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00155-1_bib9","first-page":"361","article-title":"Vier kombinatorische Probleme","volume":"15","author":"Schr\u00f6der","year":"1870","journal-title":"Z. f\u00fcr Math. Physik"},{"key":"10.1016\/S0012-365X(98)00155-1_bib10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/0404025","article-title":"Bootstrap percolation, the Schr\u00f6der numbers, and the n-kings problem","volume":"4","author":"Shapiro","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00155-1_bib11","doi-asserted-by":"crossref","first-page":"344","DOI":"10.2307\/2974582","article-title":"Hipparchus, Plutarch, Schr\u00f6der, and Hough","volume":"104","author":"Stanley","year":"1997","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0012-365X(98)00155-1_bib12","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."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001551?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98001551?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:29:28Z","timestamp":1556396968000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98001551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0012365X98001551"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00155-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}