{"id":"https://openalex.org/W7162184938","doi":"https://doi.org/10.1016/j.ijar.2026.109725","title":"Enumerating jointly reverse lectic orders for bi-adjacency matrices","display_name":"Enumerating jointly reverse lectic orders for bi-adjacency matrices","publication_year":2026,"publication_date":"2026-05-23","ids":{"openalex":"https://openalex.org/W7162184938","doi":"https://doi.org/10.1016/j.ijar.2026.109725"},"language":"en","primary_location":{"id":"doi:10.1016/j.ijar.2026.109725","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ijar.2026.109725","pdf_url":null,"source":{"id":"https://openalex.org/S33368595","display_name":"International Journal of Approximate Reasoning","issn_l":"0888-613X","issn":["0888-613X","1873-4731"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Approximate Reasoning","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136832709","display_name":"Tim Pattison","orcid":null},"institutions":[{"id":"https://openalex.org/I1303474014","display_name":"Defence Science and Technology Group","ror":"https://ror.org/05ddrvt52","country_code":"AU","type":"government","lineage":["https://openalex.org/I1303474014","https://openalex.org/I2801453606","https://openalex.org/I3139952251"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Tim Pattison","raw_affiliation_strings":["Defence Science & Technology Group, 13/205 Maritime Ave, Edinburgh, South Australia, 5111, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Defence Science & Technology Group, 13/205 Maritime Ave, Edinburgh, South Australia, 5111, Australia","institution_ids":["https://openalex.org/I1303474014"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063172902","display_name":"Dominik D\u00fcrrschnabel","orcid":"https://orcid.org/0000-0002-0855-4185"},"institutions":[{"id":"https://openalex.org/I4210139725","display_name":"Peace Research and European Security Studies","ror":"https://ror.org/03tre1g84","country_code":"DE","type":"other","lineage":["https://openalex.org/I4210139725"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominik D\u00fcrrschnabel","raw_affiliation_strings":["Baden W\u00fcrttemberg Cooperative State University Mosbach, Lohrtalweg 10, Mosbach, Baden W\u00fcrttemberg, 74821, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Baden W\u00fcrttemberg Cooperative State University Mosbach, Lohrtalweg 10, Mosbach, Baden W\u00fcrttemberg, 74821, Germany","institution_ids":["https://openalex.org/I4210139725"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5136818373","display_name":"Mohammed Abdullah","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mohammed Abdullah","raw_affiliation_strings":["University of Kassel, Wilhelmsh\u00f6her Allee 73, Kassel, Hesse, 34121, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kassel, Wilhelmsh\u00f6her Allee 73, Kassel, Hesse, 34121, Germany","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5136832709"],"corresponding_institution_ids":["https://openalex.org/I1303474014"],"apc_list":{"value":2960,"currency":"USD","value_usd":2960},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.74214285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"197","issue":null,"first_page":"109725","last_page":"109725"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.2906000018119812,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.2906000018119812,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.10000000149011612,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.054999999701976776,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.580299973487854},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5539000034332275},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4147999882698059},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3984000086784363},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.37400001287460327}],"concepts":[{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.580299973487854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5733000040054321},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5539000034332275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4505999982357025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4490000009536743},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4147999882698059},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3846000134944916},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37400001287460327},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3212999999523163},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2955999970436096},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2547999918460846}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.ijar.2026.109725","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.ijar.2026.109725","pdf_url":null,"source":{"id":"https://openalex.org/S33368595","display_name":"International Journal of Approximate Reasoning","issn_l":"0888-613X","issn":["0888-613X","1873-4731"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Approximate Reasoning","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7511054277420044,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1968148694","https://openalex.org/W1974745849","https://openalex.org/W2063123613","https://openalex.org/W2063906290","https://openalex.org/W2133120537","https://openalex.org/W4298075876","https://openalex.org/W4409590910"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-14T06:11:07.267592","created_date":"2026-05-24T00:00:00"}