{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:02Z","timestamp":1759063742163},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,15]],"date-time":"2014-03-15T00:00:00Z","timestamp":1394841600000},"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":[[2015,7]]},"DOI":"10.1007\/s11083-014-9321-0","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T03:17:54Z","timestamp":1395112674000},"page":"147-155","source":"Crossref","is-referenced-by-count":4,"title":["Linear Extensions of N-free Orders"],"prefix":"10.1007","volume":"32","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[]},{"given":"Thibault","family":"Manneville","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,15]]},"reference":[{"key":"9321_CR1","first-page":"21","volume":"52","author":"A Atkinson","year":"1985","unstructured":"Atkinson, A., Chang, H.: Extensions of partial orders of bounded width. Congressus Numerantium 52, 21\u201335 (1985)","journal-title":"Congressus Numerantium"},{"key":"9321_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00383170","volume":"7","author":"M Atkinson","year":"1990","unstructured":"Atkinson, M.: On computing the number of linear extensions of a tree. Order 7, 23\u201325 (1990)","journal-title":"Order"},{"key":"9321_CR3","doi-asserted-by":"crossref","first-page":"14","DOI":"10.37236\/769","volume":"15","author":"J Bandlow","year":"2008","unstructured":"Bandlow, J.: An elementary proof of the hook formula. Electron. J. Combin. 15, 14 (2008)","journal-title":"Electron. J. Combin."},{"key":"9321_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/103418.103441","volume-title":"Counting linear extensions is #P-complete. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, STOC \u201991","author":"G Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions is #P-complete. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, STOC \u201991, pp. 175\u2013181. ACM, New York (1991)"},{"key":"9321_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.4064\/fm-65-2-157-167","volume":"65","author":"P Grillet","year":"1969","unstructured":"Grillet, P.: Maximal chains and antichains. Fundamenta Mathematicae 65, 157\u2013167 (1969)","journal-title":"Fundamenta Mathematicae"},{"key":"9321_CR6","doi-asserted-by":"crossref","unstructured":"Habib, M., Jegou, R.: N-free posets as generalization of series-parallel posets. Discret. Appl. Math. 12, 279\u2013291 (1985). Elsevier Science Publisher, B.V. North Holland","DOI":"10.1016\/0166-218X(85)90030-7"},{"key":"9321_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0012-365X(87)90006-9","volume":"63","author":"M Habib","year":"1987","unstructured":"Habib, M., M\u00f6hring, R.: On some complexity properties of N-free posets and posets with bounded decomposition diameter. Discret. Math. (North Holland) 63, 157\u2013182 (1987)","journal-title":"Discret. Math. (North Holland)"},{"key":"9321_CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0012-365X(03)00106-7","volume":"275","author":"S Khamis","year":"2004","unstructured":"Khamis, S.: Height counting of interval and N-free posets. Disc. Math. 275, 165\u2013175 (2004)","journal-title":"Disc. Math."},{"key":"9321_CR9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.endm.2006.06.030","volume":"24","author":"A Kwiatkowska","year":"2006","unstructured":"Kwiatkowska, A., Syslo, M.: On page number of N-free posets. Electron. Notes in Disc. Math. 24, 243\u2013249 (2006)","journal-title":"Electron. Notes in Disc. Math."},{"key":"9321_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/fm-79-1-11-22","volume":"79","author":"B Leclerc","year":"1973","unstructured":"Leclerc, B., Montjardet, B.: Ordres c.a.c. Fundamenta Mathematicae 79, 11\u201322 (1973)","journal-title":"Fundamenta Mathematicae"},{"key":"9321_CR11","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.: Computationally tractable classes of ordered sets. In: Rival, I. (ed.) Algorithms and Order, pp. 105\u2013194. Kluwer Acad. Publ. (1989)","DOI":"10.1007\/978-94-009-2639-4_4"},{"key":"9321_CR12","doi-asserted-by":"crossref","unstructured":"Negger, J., Kim, S.: Basic Posets. World Scientific (1999)","DOI":"10.1142\/3890"},{"key":"9321_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0053-6","volume-title":"Ordered Sets, an Introduction","author":"B Schr\u00f6der","year":"2003","unstructured":"Schr\u00f6der, B.: Ordered Sets, an Introduction. Birkh\u00e4user, Boston (2003)"},{"key":"9321_CR14","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00396269","volume":"1","author":"M Syslo","year":"1984","unstructured":"Syslo, M.: Minimizing the jump number for partially ordered sets : a graph-theoretic approach. Order 1, 7\u201319 (1984)","journal-title":"Order"},{"key":"9321_CR15","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and Partially Ordered Sets, Dimension Theory","author":"W Trotter","year":"1992","unstructured":"Trotter, W.: Combinatorics and Partially Ordered Sets, Dimension Theory. The Johns Hopkins University Press, Baltimore (1992)"},{"key":"9321_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.37236\/2345","volume":"19","author":"I Zaguia","year":"2012","unstructured":"Zaguia, I.: The 1\/3\u22122\/3 conjecture for N-free ordered sets. Electron. J. Combin. 19, 29 (2012)","journal-title":"Electron. J. Combin."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-014-9321-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-014-9321-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-014-9321-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T07:19:06Z","timestamp":1689059946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-014-9321-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,15]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9321"],"URL":"https:\/\/doi.org\/10.1007\/s11083-014-9321-0","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,15]]}}}