{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:14:07Z","timestamp":1761801247843,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Science"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.jocs.2017.05.008","type":"journal-article","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T04:01:46Z","timestamp":1495425706000},"page":"446-455","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Encoding partial orders through modular decomposition"],"prefix":"10.1016","volume":"25","author":[{"given":"Laurent","family":"Beaudou","sequence":"first","affiliation":[]},{"given":"Kaoutar","family":"Ghazi","sequence":"additional","affiliation":[]},{"given":"Giacomo","family":"Kahn","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Raynaud","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Thierry","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jocs.2017.05.008_bib0005","first-page":"115","article-title":"Efficient management of transitive relationships in large data and knowledge bases","author":"Agrawal","year":"1989","journal-title":"ACM SIGMOD International Conference on Management of Data"},{"year":"1971","series-title":"Etude combinatoire des ordonn\u00e9s finis, Applications","author":"Bouchet","key":"10.1016\/j.jocs.2017.05.008_bib0010"},{"key":"10.1016\/j.jocs.2017.05.008_bib0015","first-page":"143","article-title":"Representation of an order as union of interval orders","author":"Capelle","year":"1994","journal-title":"Proceedings of ORDAL\u201994, LNCS 831"},{"key":"10.1016\/j.jocs.2017.05.008_bib0020","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/165854.165905","article-title":"Efficient handling of multiple inheritance hierarchies","author":"Caseau","year":"1993","journal-title":"Proceedings of OOPSLA\u201993"},{"key":"10.1016\/j.jocs.2017.05.008_bib0025","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1111\/0824-7935.00081","article-title":"Encoding of multiple inheritance hierarchies and partial orders","volume":"15","author":"Caseau","year":"1999","journal-title":"Comput. Intell."},{"key":"10.1016\/j.jocs.2017.05.008_bib0030","first-page":"77","article-title":"Generalized polychotomic encoding","author":"Colomb","year":"2008","journal-title":"Proceedings of MCO\u201908"},{"key":"10.1016\/j.jocs.2017.05.008_bib0035","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1111\/0824-7935.00076","article-title":"The foundations of taxonomic encodings","volume":"14","author":"Fall","year":"1998","journal-title":"Comput. Intell."},{"key":"10.1016\/j.jocs.2017.05.008_bib0040","first-page":"545","article-title":"Polychotomic encoding: a better quasi-optimal bit-vector encoding of tree hierarchies","author":"Filman","year":"2002","journal-title":"Proceedings of ECOOP\u20192002"},{"key":"10.1016\/j.jocs.2017.05.008_bib0045","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbare graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hungar."},{"issue":"5","key":"10.1016\/j.jocs.2017.05.008_bib0050","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1145\/1086642.1086643","article-title":"Efficient subtyping tests with PQ-encoding","volume":"27","author":"Gil","year":"2005","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/j.jocs.2017.05.008_bib0055","first-page":"1","article-title":"Bit-vector encoding for partially ordered sets","author":"Habib","year":"1994","journal-title":"Proceedings of ORDAL\u201994, LNCS 831"},{"issue":"2-3","key":"10.1016\/j.jocs.2017.05.008_bib0060","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.tcs.2003.10.029","article-title":"Computational aspects of the 2-dimension of partially ordered sets","volume":"312","author":"Habib","year":"2004","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.jocs.2017.05.008_bib0065","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/99935.99944","article-title":"A compression technique to materialize transitive closure","volume":"15","author":"Jagadish","year":"1990","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.jocs.2017.05.008_bib0070","first-page":"128","article-title":"Near optimal hierarchical encoding of types","author":"Krall","year":"1997","journal-title":"Proceedings of ECOOP\u201997"},{"key":"10.1016\/j.jocs.2017.05.008_bib0075","doi-asserted-by":"crossref","first-page":"587","DOI":"10.21136\/CMJ.1963.100589","article-title":"On the pseudo-dimension of ordered sets","volume":"13","author":"Novak","year":"1963","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/j.jocs.2017.05.008_bib0080","series-title":"ECOOP\u201903 Conference Proceedings","first-page":"378","article-title":"Java subtype tests in real-time","author":"Palacz","year":"2003"},{"key":"10.1016\/j.jocs.2017.05.008_bib0085","first-page":"165","article-title":"A quasi optimal bit-vector encoding of tree hierarchies","author":"Raynaud","year":"2001","journal-title":"Proceedings of ECOOP\u20192001, LNCS 2072"},{"issue":"3","key":"10.1016\/j.jocs.2017.05.008_bib0090","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s11083-009-9135-7","article-title":"The complexity of embedding orders into small products of chains","volume":"27","author":"Raynaud","year":"2010","journal-title":"Order"},{"key":"10.1016\/j.jocs.2017.05.008_bib0095","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","article-title":"Ein satz\u00fcber untermengen einer endlichen menge","volume":"27","author":"Sperner","year":"1928","journal-title":"Math. Z."},{"issue":"5","key":"10.1016\/j.jocs.2017.05.008_bib0100","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1137\/S0097539794274404","article-title":"An efficient data structure for lattice operations","volume":"28","author":"Talamo","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jocs.2017.05.008_bib0105","first-page":"634","article-title":"Simple, linear-time modular decomposition","author":"Tedder","year":"2008","journal-title":"ICALP. N 5125 in LNCS"},{"key":"10.1016\/j.jocs.2017.05.008_bib0110","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/263698.263730","article-title":"Efficient type inclusion tests","author":"Vitek","year":"1997","journal-title":"OOPSLA\u201997"},{"key":"10.1016\/j.jocs.2017.05.008_bib0115","doi-asserted-by":"crossref","DOI":"10.1145\/504282.504290","article-title":"Efficient subtyping tests with pq-encoding","author":"Zibin","year":"2001","journal-title":"Proceedings of OOPSLA\u20192001"},{"year":"2001","series-title":"Sur quelques interactions entre structures de donn\u00e9es et algorithmes efficaces pour les ordres et les graphes","author":"Thierry","key":"10.1016\/j.jocs.2017.05.008_bib0120"}],"container-title":["Journal of Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877750317300704?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877750317300704?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:11:27Z","timestamp":1761801087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877750317300704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":24,"alternative-id":["S1877750317300704"],"URL":"https:\/\/doi.org\/10.1016\/j.jocs.2017.05.008","relation":{},"ISSN":["1877-7503"],"issn-type":[{"type":"print","value":"1877-7503"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Encoding partial orders through modular decomposition","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jocs.2017.05.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}