{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:08:22Z","timestamp":1648865302394},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":7137,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0304-3975(94)90070-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"89-94","source":"Crossref","is-referenced-by-count":2,"title":["Le nombre de posets \u00e0 isomorphie pr\u00e8s ayant 12 \u00e9l\u00e9ments"],"prefix":"10.1016","volume":"123","author":[{"given":"Claude","family":"Chaunier","sequence":"first","affiliation":[]},{"given":"Nik","family":"Lyger\u014ds","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90070-1_BIB1","article-title":"Lattice theory","volume":"vol. 25","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0304-3975(94)90070-1_BIB2","first-page":"691","article-title":"Progr\u00e8s dans l'\u00e9num\u00e9ration des posets","volume":"314","author":"Chaunier","year":"1992","journal-title":"C. R. Acad. Sci. Paris, s\u00e9rie I"},{"key":"10.1016\/0304-3975(94)90070-1_BIB3","series-title":"Research Report CS-77-37","first-page":"100","article-title":"Graph generation","author":"Colbourn","year":"1977"},{"key":"10.1016\/0304-3975(94)90070-1_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\/0304-3975(94)90070-1_BIB5","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1145\/322033.322045","article-title":"A machine representation of finite To topologies","volume":"24","author":"Das","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)90070-1_BIB6","unstructured":"M. Ern\u00e9, The number of partially ordered sets with more points that incomparable pairs, preprint pour Discrete Math."},{"key":"10.1016\/0304-3975(94)90070-1_BIB7","first-page":"417","article-title":"Petits posets: d\u00e9nombrement, repr\u00e9sentabilit\u00e9 par cercles et \u2aa1compenseurs\u2aa2","volume":"313","author":"Fra\u00efss\u00e9","year":"1991","journal-title":"C. R. Acad. Sci. Paris, s\u00e9rie I"},{"key":"10.1016\/0304-3975(94)90070-1_BIB8","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)90070-1_BIB9","series-title":"Flammarion","article-title":"Les objets fractals","author":"Mandelbrot","year":"1975"},{"key":"10.1016\/0304-3975(94)90070-1_BIB10","series-title":"Graph and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/0304-3975(94)90070-1_BIB11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0097-3165(87)90061-6","article-title":"Counting unlabeled structures","volume":"44","author":"Pr\u00f6mel","year":"1987","journal-title":"J. Combin. Theory, Series A"},{"key":"10.1016\/0304-3975(94)90070-1_BIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","article-title":"Every one a winner","volume":"2","author":"Read","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0304-3975(94)90070-1_BIB13","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0012-365X(80)90042-4","article-title":"Catalogues of graphs and digraphs (announcement)","volume":"31","author":"Read","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)90070-1_BIB14","series-title":"Enumerative Combinatorics, Vol. 1","author":"Stanley","year":"1986"},{"key":"10.1016\/0304-3975(94)90070-1_BIB15","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1093\/comjnl\/33.6.518","article-title":"Simplicity and Power \u2013 Some unifying ideas in computing","volume":"33","author":"Wolff","year":"1990","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(94)90070-1_BIB16","series-title":"Ph.D. Dissertation","article-title":"Cycle indicators of certain classes of types of quasi-orders or topologies","author":"Wright","year":"1972"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900701?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900701?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:48Z","timestamp":1555115148000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900701"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0304397594900701"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90070-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}