{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T01:10:36Z","timestamp":1682471436900},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3705,"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":[[2003,7]]},"DOI":"10.1016\/s0304-3975(03)00132-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"249-268","source":"Crossref","is-referenced-by-count":2,"title":["Weak-order extensions of an order"],"prefix":"10.1016","volume":"304","author":[{"given":"Karell","family":"Bertet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Gustedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Morvan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00132-4_BIB1","first-page":"149","article-title":"Maximal antichains in partially ordered sets","volume":"25C","author":"Behrendt","year":"1988","journal-title":"ARS Combin."},{"key":"10.1016\/S0304-3975(03)00132-4_BIB2","doi-asserted-by":"crossref","unstructured":"K. Bertet, J. Gustedt, M. Morvan, Weak-order extensions of an order, in: R. M\u00f6hring (Ed.), Lecture Notes in Computer Science, Proc. 23rd Workshop on Graph-Theoretic Concepts in Computer Science June 1997, Vol. 1335, WG\u201997, Springer, Berlin, Germany, pp. 65\u201377.","DOI":"10.1007\/BFb0024488"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB3","first-page":"9","article-title":"Some algorithms for computing plethysms of quasi-symmetric functions in the sense of Malvenuto and Reutenauer","volume":"29","author":"Bertet","year":"2001","journal-title":"Comm. Algebra"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB4","unstructured":"K. Bertet, L. Nourine, Lazy completion of a partial order to the smallest lattice, in: G. Mineau, A. Fall (Eds.), 2nd Internat. Symp. on Knowledge Retrieval, Use and Storage for Efficiency, August 1997, pp. 72\u201381."},{"key":"10.1016\/S0304-3975(03)00132-4_BIB5","unstructured":"G. Birkhoff, Lattice Theory (3rd ed.), Vol. 25, American Mathematical Society, Providence, RI, 1967."},{"key":"10.1016\/S0304-3975(03)00132-4_BIB6","first-page":"1512","article-title":"Extensions et stratifications d'ensembles dispers\u00e9s","volume":"268","author":"Bonnet","year":"1969","journal-title":"C. R. Acad. Sci."},{"key":"10.1016\/S0304-3975(03)00132-4_BIB7","first-page":"31","article-title":"Calcul pratique du treillis de Galois d'une correspondence","volume":"96","author":"Bordat","year":"1986","journal-title":"Math. Sci. Hung."},{"key":"10.1016\/S0304-3975(03)00132-4_BIB8","series-title":"Algorithms and Order","first-page":"231","article-title":"The calculation of invariants for partially ordered sets","author":"Bouchitt\u00e9","year":"1989"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB9","series-title":"Probl\u00e8mes d'Ordonnancement","author":"Chretienne","year":"1988"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB10","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00333133","article-title":"Comparability invariance of the fixed point property","volume":"2","author":"Dreesen","year":"1985","journal-title":"Order"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB12","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1002\/j.1538-7305.1958.tb03887.x","article-title":"Gray codes and paths on the n-cube","volume":"37","author":"Gilbert","year":"1958","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(03)00132-4_BIB13","unstructured":"F. Gray, Pulse code communication, U.S. Patent 2632058, March 1953."},{"key":"10.1016\/S0304-3975(03)00132-4_BIB14","first-page":"893","article-title":"Extensions intervallaires minimales","volume":"313","author":"Habib","year":"1991","journal-title":"C. R. Acad. Sci."},{"key":"10.1016\/S0304-3975(03)00132-4_BIB15","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1137\/0209013","article-title":"Combinatorial gray codes","volume":"9","author":"Joichi","year":"1980","journal-title":"SIAM J. Comp."},{"issue":"3","key":"10.1016\/S0304-3975(03)00132-4_BIB17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02115811","article-title":"Computing on-line the lattice of maximal antichains of posets","volume":"11","author":"Jourdan","year":"1994","journal-title":"Order"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB18","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0196-6774(83)90042-1","article-title":"On the generation of all topological sortings","volume":"4","author":"Kalvin","year":"1983","journal-title":"J. Algorithms"},{"issue":"7","key":"10.1016\/S0304-3975(03)00132-4_BIB19","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB20","doi-asserted-by":"crossref","unstructured":"R. M\u00f6hring, F. Radermacher, The order-theoric approach: the deterministic case, APS89, 1989.","DOI":"10.1016\/B978-0-444-87358-3.50006-7"},{"key":"10.1016\/S0304-3975(03)00132-4_BIB21","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S0097539791202647","article-title":"Generating linear extensions fast","volume":"23","author":"Pruesse","year":"1994","journal-title":"SIAM J. Comp."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503001324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503001324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:33:52Z","timestamp":1682469232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503001324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0304397503001324"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00132-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}