{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:08Z","timestamp":1759335488146},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"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":[[2004,1]]},"DOI":"10.1016\/s0012-365x(03)00106-7","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T18:47:46Z","timestamp":1056134866000},"page":"165-175","source":"Crossref","is-referenced-by-count":8,"title":["Height counting of unlabeled interval and N-free posets"],"prefix":"10.1016","volume":"275","author":[{"given":"Soheir M.","family":"Khamis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00106-7_BIB1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00563522","article-title":"Asymptotic enumeration of N-free partial orders","volume":"6","author":"Bayoumi","year":"1989","journal-title":"Order"},{"key":"10.1016\/S0012-365X(03)00106-7_BIB2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(94)90370-0","article-title":"Counting two-dimensional posets","volume":"131","author":"Bayoumi","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00106-7_BIB3","first-page":"117","article-title":"Algorithmic counting of types of UPO graphs and posets","volume":"127","author":"Bayoumi","year":"1997","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00106-7_BIB4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF00383201","article-title":"New results from an algorithm for counting posets","volume":"7","author":"Culberson","year":"1991","journal-title":"Order"},{"key":"10.1016\/S0012-365X(03)00106-7_BIB5","series-title":"Algorithms and Order","first-page":"327","article-title":"Enumeration of ordered sets","author":"El-Zahar","year":"1989"},{"issue":"1","key":"10.1016\/S0012-365X(03)00106-7_BIB6","first-page":"1","article-title":"Enumeration of series-parallel posets according to heights","volume":"8","author":"El-Zahar","year":"2000","journal-title":"J. Egypt. Math. Soc."},{"key":"10.1016\/S0012-365X(03)00106-7_BIB7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.18.2.207","article-title":"Intransitive indifference in preference theory","volume":"18","author":"Fishburn","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/S0012-365X(03)00106-7_BIB8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1090\/S0002-9947-1982-0662044-8","article-title":"Counting interval graphs","volume":"272","author":"Hanlon","year":"1982","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(03)00106-7_BIB9","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/S0012-365X(03)00106-7_BIB10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1023\/A:1006431609027","article-title":"The number of unlabeled orders on fourteen elements","volume":"17","author":"Heitzig","year":"2000","journal-title":"Order"},{"key":"10.1016\/S0012-365X(03)00106-7_BIB11","first-page":"157","article-title":"On numerical counting of prime, UPO, and the general type of posets according to heights","volume":"146","author":"Khamis","year":"2000","journal-title":"Congr. Numer."},{"key":"10.1016\/S0012-365X(03)00106-7_BIB12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","article-title":"Asymptotic enumeration of partial orders on a finite set","volume":"205","author":"Kleitman","year":"1975","journal-title":"Trans. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/S0012-365X(03)00106-7_BIB13","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9939-1974-0351928-7","article-title":"Enumeration of posets generated by disjoint unions and ordinal sums","volume":"45","author":"Stanley","year":"1974","journal-title":"Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(03)00106-7_BIB14","series-title":"Graphs and Order","first-page":"185","article-title":"A graph-theoretic approach to the jump-number problem","author":"Syslo","year":"1985"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T05:26:24Z","timestamp":1553059584000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0012365X03001067"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00106-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}