{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T10:17:49Z","timestamp":1780481869370,"version":"3.54.1"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007488","name":"Indian Institute of Technology Delhi","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.tcs.2026.116076","type":"journal-article","created":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T05:25:37Z","timestamp":1780118737000},"page":"116076","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Bipartite domination in graphs: complexity and algorithms"],"prefix":"10.1016","volume":"1081","author":[{"given":"Bhawani Sankar","family":"Panda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subhasmita","family":"Joshi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dalu","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116076_bib0001","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"2013"},{"issue":"3","key":"10.1016\/j.tcs.2026.116076_bib0002","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","article-title":"Towards a theory of domination in graphs","volume":"7","author":"Cockayne","year":"1977","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.tcs.2026.116076_bib0003","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1137\/S0895480100375831","article-title":"Domination in graphs applied to electric power networks","volume":"15","author":"Haynes","year":"2002","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2026.116076_bib0004","series-title":"Topics in Domination in Graphs","volume":"Vol. 64","author":"Haynes","year":"2020"},{"issue":"7","key":"10.1016\/j.tcs.2026.116076_bib0005","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.disc.2012.11.031","article-title":"Independent domination in graphs: a survey and recent results","volume":"313","author":"Goddard","year":"2013","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.116076_bib0006","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0012-365X(00)00012-1","article-title":"Acyclic domination","volume":"222","author":"Hedetniemi","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.116076_bib0007","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1556\/314.2022.00015","article-title":"Bipartite domination in graphs","volume":"28","author":"Bachstein","year":"2022","journal-title":"Math. Pannonica"},{"issue":"1","key":"10.1016\/j.tcs.2026.116076_bib0008","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1556\/314.2023.00003","article-title":"The lower bipartite number of a graph","volume":"29","author":"Bachstein","year":"2023","journal-title":"Math. Pannonica"},{"issue":"3","key":"10.1016\/j.tcs.2026.116076_bib0009","doi-asserted-by":"crossref","first-page":"8","DOI":"10.9734\/arjom\/2023\/v19i3645","article-title":"Bipartite domination in some classes of graphs","volume":"19","author":"Pelias","year":"2023","journal-title":"Asian Res. J. Math."},{"issue":"5","key":"10.1016\/j.tcs.2026.116076_bib0010","doi-asserted-by":"crossref","first-page":"41","DOI":"10.9734\/arjom\/2023\/v19i5658","article-title":"Bipartite domination number of mycielski graph of some graph families","volume":"19","author":"Pelias","year":"2023","journal-title":"Asian Res. J. Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.116076_bib0011","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","article-title":"Dominating sets for split and bipartite graphs","volume":"19","author":"Bertossi","year":"1984","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.116076_bib0012","series-title":"Conference on Algorithms and Discrete Applied Mathematics, Lecture Notes in Computer Science 15536","first-page":"234","article-title":"Bipartite domination in graphs: complexity and algorithms","author":"Panda","year":"2025"},{"issue":"2","key":"10.1016\/j.tcs.2026.116076_bib0013","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","article-title":"The node-deletion problem for hereditary properties is NP-complete","volume":"20","author":"Lewis","year":"1980","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.116076_bib0014","series-title":"Introduction to Algorithms","author":"Cormen","year":"2022"},{"key":"10.1016\/j.tcs.2026.116076_bib0015","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","article-title":"Approximation hardness of dominating set problems in bounded degree graphs","volume":"206","author":"Chlebik","year":"2008","journal-title":"Inf. Comput."},{"issue":"10","key":"10.1016\/j.tcs.2026.116076_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.112985","article-title":"Well-partitioned chordal graphs","volume":"345","author":"Ahn","year":"2022","journal-title":"Discret. Math."},{"key":"10.1016\/j.tcs.2026.116076_bib0017","series-title":"The Design of Approximation Algorithms","author":"Williamson","year":"2011"},{"key":"10.1016\/j.tcs.2026.116076_bib0018","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.dam.2018.03.029","article-title":"Domination in some subclasses of bipartite graphs","volume":"252","author":"Pandey","year":"2019","journal-title":"Discret. Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003269?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003269?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T09:51:16Z","timestamp":1780480276000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":18,"alternative-id":["S0304397526003269"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116076","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bipartite domination in graphs: complexity and algorithms","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116076","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":"116076"}}