{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T03:01:02Z","timestamp":1773370862513,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,7,7]],"date-time":"2012-07-07T00:00:00Z","timestamp":1341619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s11083-012-9269-x","type":"journal-article","created":{"date-parts":[[2012,7,6]],"date-time":"2012-07-06T09:33:56Z","timestamp":1341567236000},"page":"663-676","source":"Crossref","is-referenced-by-count":3,"title":["Generation and Enumeration of Some Classes of Interval Orders"],"prefix":"10.1007","volume":"30","author":[{"given":"F.","family":"Disanto","sequence":"first","affiliation":[]},{"given":"E.","family":"Pergola","sequence":"additional","affiliation":[]},{"given":"R.","family":"Pinzani","sequence":"additional","affiliation":[]},{"given":"S.","family":"Rinaldi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,7]]},"reference":[{"key":"9269_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0166-218X(93)90027-L","volume":"46","author":"P Baldy","year":"1993","unstructured":"Baldy, P., Morvan, M.: A linear time and space algorithm to recognize interval orders. Discrete Appl. Math. 46, 173\u2013178 (1993)","journal-title":"Discrete Appl. Math."},{"key":"9269_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(01)00250-3","volume":"246","author":"C Banderier","year":"2002","unstructured":"Banderier, C., Bousquet-Melou, M., Denise, A., Flajolet, P., Gardy, D., Gouyou-Beauchamps, D., Generating functions for generating trees. Discrete Math. 246, 29\u201355 (2002)","journal-title":"Discrete Math."},{"key":"9269_CR3","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1080\/10236199908808200","volume":"5","author":"E Barcucci","year":"1999","unstructured":"Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: ECO: a methodology for the enumeration of combinatorial objects. J. Diff. Equ. Appl. 5, 435\u2013490 (1999)","journal-title":"J. Diff. Equ. Appl."},{"key":"9269_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(93)90065-2","volume":"118","author":"KP Bogart","year":"1993","unstructured":"Bogart, K.P.: An obvious proof of Fishburn\u2019s interval order theorem. Discrete Math. 118, 233\u2013237 (1993)","journal-title":"Discrete Math."},{"key":"9269_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-218X(95)00110-D","volume":"60","author":"KP Bogart","year":"1995","unstructured":"K.P. Bogart, Bonin, J., Mitas, J.: Interval orders based on weak orders. Discrete Appl. Math. 60, 93\u201398 (1995)","journal-title":"Discrete Appl. Math."},{"key":"9269_CR6","doi-asserted-by":"crossref","unstructured":"Bona, M.: Combinatorics of Permutations. CRC Press Inc (2004)","DOI":"10.1201\/9780203494370"},{"key":"9269_CR7","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1016\/j.jcta.2009.12.007","volume":"117","author":"M Bousquet-Melou","year":"2010","unstructured":"Bousquet-Melou, M., Claesson, A., Dukes, M., Kitaev, S.: Unlabeled (2+2)-free posets, ascent sequences and pattern avoiding permutations. J. Comb. Theory Ser A 117, 884\u2013909 (2010)","journal-title":"J. Comb. Theory Ser A"},{"key":"9269_CR8","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.aam.2010.02.004","volume":"45","author":"F Disanto","year":"2010","unstructured":"Disanto, F., Ferrari, L., Pinzani, R., Rinaldi, S.: Catalan pairs: a relational-theoretic approach to Catalan numbers. Adv. Appl. Math. 45, 505\u2013517 (2010)","journal-title":"Adv. Appl. Math."},{"key":"9269_CR9","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-94-009-2639-4_9","volume-title":"Algorithms and Order","author":"MH El-Zahar","year":"1989","unstructured":"El-Zahar, M.H.: Enumeration of ordered sets. In: Rival, I. (ed.) Algorithms and Order, pp. 327\u2013352. Kluwer Acad. Publ., Dordrecht (1989)"},{"key":"9269_CR10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144\u2013149 (1970)","journal-title":"J. Math. Psychol."},{"key":"9269_CR11","doi-asserted-by":"crossref","unstructured":"Fishburn, P.C.: Interval Graphs and Interval Orders. Wiley (1985)","DOI":"10.1016\/0012-365X(85)90042-1"},{"key":"9269_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.18.2.207","volume":"18","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference in preference theory: a survey. Oper. Res. 18, 207\u2013208 (1970)","journal-title":"Oper. Res."},{"key":"9269_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00337889","volume":"17","author":"PE Haxell","year":"1987","unstructured":"Haxell, P.E., McDonald, J.J., Thomasson, S.K.: Counting interval orders. Order 17, 269\u2013272 (1987)","journal-title":"Order"},{"issue":"2004","key":"9269_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0012-365X(03)00106-7","volume":"275","author":"SM Khamis","year":"2004","unstructured":"Khamis, S.M. (2004) Height counting of unlabeled interval and N-free posets. Discrete Math. 275, 165\u2013175 (2004)","journal-title":"Discrete Math."},{"key":"9269_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1006\/jcta.2000.3075","volume":"93","author":"M Skandera","year":"2001","unstructured":"Skandera, M.: A characterization of (3+1)-free posets. J. Comb. Theory Ser A 93, 231\u2013241 (2001)","journal-title":"J. Comb. Theory Ser A"},{"key":"9269_CR16","unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences. Available on line at http:\/\/www.research.att.com\/~njas\/sequences\/"},{"key":"9269_CR17","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol. 1. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511805967"},{"key":"9269_CR18","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511609589"},{"key":"9269_CR19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1142\/S0218216598000073","volume":"7","author":"A Stoimenow","year":"1998","unstructured":"Stoimenow, A.: Enumeration of chord diagrams and an upper bound for Vassiliev invariants. J. Knot Theory Ramif. 7, 93\u2013114 (1998)","journal-title":"J. Knot Theory Ramif."},{"key":"9269_CR20","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/S0040-9383(00)00005-7","volume":"40","author":"D Zagier","year":"2001","unstructured":"Zagier, D.: Vassiliev invariants and a strange identity related to the Dedeking eta-function. Topology 40, 945\u2013960 (2001)","journal-title":"Topology"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-012-9269-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-012-9269-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-012-9269-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T16:39:27Z","timestamp":1561912767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-012-9269-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9269"],"URL":"https:\/\/doi.org\/10.1007\/s11083-012-9269-x","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,7]]}}}