{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:59:13Z","timestamp":1772197153166,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"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":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115784","type":"journal-article","created":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:19:49Z","timestamp":1769296789000},"page":"115784","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Decomposing convex bipartite graphs into biconvex graphs and enumerating minimum weight red blue dominating sets"],"prefix":"10.1016","volume":"1068","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2014-2300","authenticated-orcid":false,"given":"Nesrine","family":"Abbas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115784_bib0001","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-7315(84)90004-2","article-title":"A parallel matching algorithm for convex bipartite graphs and applications to scheduling","volume":"1","author":"Dekel","year":"1984","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.115784_bib0002","series-title":"Proc. of the 1st Conference on Algorithms and Experiments","first-page":"1","article-title":"Covering trains by stations or the power of data reduction","volume":"98","author":"Weihe","year":"1998"},{"key":"10.1016\/j.tcs.2026.115784_bib0003","series-title":"Complexity of Computer Computations, the IBM Research Symposia Series","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"3","key":"10.1016\/j.tcs.2026.115784_bib0004","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"4","author":"V","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.tcs.2026.115784_bib0005","series-title":"Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs","volume":"12757","author":"Abbas","year":"2021"},{"key":"10.1016\/j.tcs.2026.115784_bib0006","series-title":"IEEE 35th International Conference on Data Engineering (ICDE)","first-page":"518","article-title":"Enumerating minimal weight set covers","author":"Ajami","year":"2019"},{"key":"10.1016\/j.tcs.2026.115784_bib0007","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.dam.2014.12.010","article-title":"Enumerating minimal dominating sets in chordal bipartite graphs","volume":"199","author":"Golovach","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115784_bib0008","series-title":"19th International Symposium on Algorithms and Data Structures WADS 2025","first-page":"1","article-title":"Enumerating minimal dominating sets and variants in chordal bipartite graphs","volume":"349","author":"Castelo","year":"2025"},{"key":"10.1016\/j.tcs.2026.115784_bib0009","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.jda.2011.03.006","article-title":"An exact algorithm for connected red-blue dominating set","volume":"9","author":"Abu-Khzam","year":"2011","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/j.tcs.2026.115784_bib0010","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","article-title":"The NP-completeness of steiner tree and dominating set for chordal bipartite graphs","volume":"63","author":"M\u00fcller","year":"1987","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115784_bib0011","series-title":"Domination in convex and chordal bipartite graphs","first-page":"231","author":"Damaschke","year":"1990"},{"key":"10.1016\/j.tcs.2026.115784_bib0012","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.dam.2024.08.007","article-title":"Algorithmic results for weak roman domination problem in graphs","volume":"359","author":"Paul","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115784_bib0013","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10801-020-00969-w","article-title":"The enumeration of spanning tree of weighted graphs","volume":"54","author":"Zhou","year":"2021","journal-title":"J. Algebr. Comb."},{"key":"10.1016\/j.tcs.2026.115784_bib0014","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.dam.2016.08.017","article-title":"Counting independent sets in tree convex bipartite graphs","volume":"218","author":"Lin","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115784_bib0015","series-title":"Counting independent sets and maximal independent sets in some subclasses of bipartite graphs","first-page":"236","author":"Lin","year":"2018"},{"key":"10.1016\/j.tcs.2026.115784_bib0016","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.tcs.2022.05.021","article-title":"Counting dominating sets in some subclasses of bipartite graphs","volume":"923","author":"Min-Sheng","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115784_bib0017","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(94)00220-D","article-title":"Efficient parallel algorithms for doubly convex-bipartite graphs","volume":"147","author":"Yu","year":"1995","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115784_bib0018","doi-asserted-by":"crossref","unstructured":"N. Abbas, L.K. Stewart, Biconvex graphs: ordering and algorithms 103 (2000) 1\u201319. 10.1016\/S0166-218X(99)00217-6.","DOI":"10.1016\/S0166-218X(99)00217-6"},{"issue":"3","key":"10.1016\/j.tcs.2026.115784_bib0019","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115784_bib0020","series-title":"Graph Classes: A Survey","first-page":"91","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/j.tcs.2026.115784_bib0021","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/j.tcs.2026.115784_bib0022","author":"Berge","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000435?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000435?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:05:05Z","timestamp":1772193905000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":22,"alternative-id":["S0304397526000435"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115784","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decomposing convex bipartite graphs into biconvex graphs and enumerating minimum weight red blue dominating sets","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115784","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115784"}}