{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T05:57:46Z","timestamp":1780984666404,"version":"3.54.1"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ijar.2026.109725","type":"journal-article","created":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T15:11:17Z","timestamp":1779549077000},"page":"109725","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Enumerating jointly reverse lectic orders for bi-adjacency matrices"],"prefix":"10.1016","volume":"197","author":[{"given":"Tim","family":"Pattison","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominik","family":"D\u00fcrrschnabel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed","family":"Abdullah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ijar.2026.109725_bib0001","series-title":"Formal Concept Analysis: Mathematical Foundations","author":"Ganter","year":"1999"},{"key":"10.1016\/j.ijar.2026.109725_bib0002","series-title":"Proceedings of the 14th International Conference on Concept Lattices and Their Applications","first-page":"219","article-title":"Efficient formal concept analysis through recursive context partitioning","volume":"2123","author":"Pattison","year":"2018"},{"key":"10.1016\/j.ijar.2026.109725_bib0003","series-title":"2014 IEEE Pacific Visualization Symposium (PacificVis)","first-page":"248","article-title":"Enhancing layout and interaction in formal concept analysis","author":"Pattison","year":"2014"},{"key":"10.1016\/j.ijar.2026.109725_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113475","article-title":"Systems of implications obtained using the carve decomposition of a formal context","volume":"318","author":"L\u00f3pez-Rodr\u00edguez","year":"2025","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.ijar.2026.109725_bib0005","series-title":"Formal Concept Analysis","first-page":"17","article-title":"Doubly-lexical order supports standardisation and recursive partitioning of formal context","author":"Pattison","year":"2023"},{"key":"10.1016\/j.ijar.2026.109725_bib0006","series-title":"Conceptual Knowledge Structures","first-page":"1","article-title":"Spanning concept trees: enhanced algorithm and visualisation","volume":"15941","author":"Pattison","year":"2025"},{"key":"10.1016\/j.ijar.2026.109725_bib0007","series-title":"Proc. 5th Conceptual Structures Tools & Interoperability Wkshp (CSTIW)","first-page":"1","article-title":"A tool for creating and visualising formal concept trees","author":"Andrews","year":"2016"},{"issue":"5","key":"10.1016\/j.ijar.2026.109725_bib0008","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","article-title":"Doubly lexical ordering of dense 0\u20131 matrices","volume":"45","author":"Spinrad","year":"1993","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"10.1016\/j.ijar.2026.109725_bib0009","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","article-title":"Doubly lexical orderings of matrices","volume":"16","author":"Lubiw","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ijar.2026.109725_bib0010","series-title":"Formal Concept Analysis","first-page":"44","article-title":"Dismantlable lattices in the mirror","author":"Berry","year":"2013"},{"key":"10.1016\/j.ijar.2026.109725_bib0011","series-title":"Conceptual Knowledge Structures. CONCEPTS 2024","first-page":"166","article-title":"Spanning concept trees: algorithms and interaction","volume":"14914","author":"Pattison","year":"2024"},{"issue":"3","key":"10.1016\/j.ijar.2026.109725_bib0012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v025.i03","article-title":"Getting things in order: an introduction to the R package seriation","volume":"25","author":"Hahsler","year":"2008","journal-title":"J. Stat. Softw."},{"key":"10.1016\/j.ijar.2026.109725_bib0013","series-title":"Pattern Discovery Using Seriation and Matrix Reordering: A Unified View, Extensions and an Application to Inventory Management","author":"Liiv","year":"2008"},{"key":"10.1016\/j.ijar.2026.109725_bib0014","series-title":"Proceedings of the International Joint Conference on Conceptual Knowledge Structures: CONCEPTS 2026","article-title":"Using JRL order to shape spanning trees for interactive FCA","author":"Pattison","year":"2026"},{"issue":"11","key":"10.1016\/j.ijar.2026.109725_bib0015","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/368996.369025","article-title":"Topological sorting of large networks","volume":"5","author":"Kahn","year":"1962","journal-title":"Commun. ACM"},{"issue":"1-4","key":"10.1016\/j.ijar.2026.109725_bib0016","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10472-007-9063-4","article-title":"A local approach to concept generation","volume":"49","author":"Berry","year":"2007","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.ijar.2026.109725_bib0017","series-title":"Applied Combinatorics","author":"Keller","year":"2017"},{"key":"10.1016\/j.ijar.2026.109725_bib0018","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00383444","article-title":"Counting linear extensions","volume":"8","author":"Brightwell","year":"1991","journal-title":"Order"},{"key":"10.1016\/j.ijar.2026.109725_bib0019","series-title":"Conceptual Knowledge Structures","first-page":"182","article-title":"A repository for formal contexts","author":"Hanika","year":"2024"},{"key":"10.1016\/j.ijar.2026.109725_bib0020","series-title":"Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications","article-title":"Some experimental results on randomly generating formal contexts","author":"Borchmann","year":"2016"}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26001015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X26001015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T05:04:53Z","timestamp":1780981493000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X26001015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":20,"alternative-id":["S0888613X26001015"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109725","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enumerating jointly reverse lectic orders for bi-adjacency matrices","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2026.109725","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"109725"}}