{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:50:59Z","timestamp":1782481859855,"version":"3.54.5"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"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,9]]},"DOI":"10.1016\/j.tcs.2026.116121","type":"journal-article","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:22:46Z","timestamp":1781911366000},"page":"116121","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the complexity of minimum membership dominating set"],"prefix":"10.1016","volume":"1083","author":[{"given":"D.","family":"Karthika","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R.","family":"Muthucumaraswamy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Bentert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5479-1950","authenticated-orcid":false,"given":"Sriram","family":"Bhyravarapu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjay","family":"Seetharaman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116121_bib0001","series-title":"50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025","first-page":"94","article-title":"On the complexity of minimum membership dominating set","volume":"15538","author":"Karthika","year":"2025"},{"issue":"11","key":"10.1016\/j.tcs.2026.116121_bib0002","doi-asserted-by":"crossref","first-page":"3430","DOI":"10.1007\/s00453-023-01139-7","article-title":"Parameterized complexity of minimum membership dominating set","volume":"85","author":"Agrawal","year":"2023","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116121_bib0003","series-title":"Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Proceedings","first-page":"188","article-title":"Interference in cellular networks: the minimum membership set cover problem","volume":"3595","author":"Kuhn","year":"2005"},{"key":"10.1016\/j.tcs.2026.116121_bib0004","series-title":"Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Proceedings","first-page":"339","article-title":"Minimum membership set covering and the consecutive ones property","volume":"4059","author":"Dom","year":"2006"},{"key":"10.1016\/j.tcs.2026.116121_bib0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2021.05.002","article-title":"Minimum membership covering and hitting","volume":"876","author":"Mitchell","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116121_bib0006","series-title":"Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings","first-page":"638","article-title":"Minimum membership hitting sets of axis parallel segments","volume":"10976","author":"Narayanaswamy","year":"2018"},{"issue":"3","key":"10.1016\/j.tcs.2026.116121_bib0007","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0095-8956(73)90042-7","article-title":"Perfect codes in graphs","volume":"15","author":"Biggs","year":"1973","journal-title":"J. Comb. Theory B"},{"issue":"2","key":"10.1016\/j.tcs.2026.116121_bib0008","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0095-8956(86)90079-1","article-title":"Perfect codes over graphs","volume":"40","author":"Kratochv\u00edl","year":"1986","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"10.1016\/j.tcs.2026.116121_bib0009","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1137\/17M1129532","article-title":"Perfect codes in cayley graphs","volume":"32","author":"Huang","year":"2018","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.tcs.2026.116121_bib0010","series-title":"Perfect Codes in Graphs and their Powers","author":"Kratochv\u00edl","year":"1987"},{"issue":"3","key":"10.1016\/j.tcs.2026.116121_bib0011","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(01)00207-1","article-title":"Perfect code is W[1]-complete","volume":"81","author":"Cesati","year":"2002","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.116121_bib0012","first-page":"141","article-title":"Perfect domination","volume":"3","author":"Fellows","year":"1991","journal-title":"Australas. J Comb."},{"issue":"1","key":"10.1016\/j.tcs.2026.116121_bib0013","first-page":"157","article-title":"Complexity of domination-type problems in graphs","volume":"1","author":"Telle","year":"1994","journal-title":"Nord. J. Comput."},{"key":"10.1016\/j.tcs.2026.116121_bib0014","series-title":"Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial k-Trees","author":"Telle","year":"1994"},{"key":"10.1016\/j.tcs.2026.116121_bib0015","series-title":"Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday","first-page":"262","article-title":"Fast algorithms for join operations on tree decompositions","volume":"12160","author":"van Rooij","year":"2020"},{"key":"10.1016\/j.tcs.2026.116121_bib0016","series-title":"Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023","first-page":"3664","article-title":"Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs","author":"Focke","year":"2023"},{"issue":"18","key":"10.1016\/j.tcs.2026.116121_bib0017","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1016\/j.dam.2013.06.012","article-title":"[1, 2]-sets in graphs","volume":"161","author":"Chellali","year":"2013","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.tcs.2026.116121_bib0018","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.tcs.2019.11.032","article-title":"On the parameterized complexity of [1, j]-domination problems","volume":"804","author":"Meybodi","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2026.116121_bib0019","doi-asserted-by":"crossref","first-page":"3267","DOI":"10.1051\/ro\/2025125","article-title":"Algorithms for minimum membership dominating set problem","volume":"59","author":"Reddy","year":"2025","journal-title":"RAIRO Oper. Res."},{"issue":"3","key":"10.1016\/j.tcs.2026.116121_bib0020","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1007\/s00453-022-01006-x","article-title":"Minimum eccentricity shortest path problem with respect to structural parameters","volume":"85","author":"Kucera","year":"2023","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.tcs.2026.116121_bib0021","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","article-title":"A fast branching algorithm for cluster vertex deletion","volume":"58","author":"Boral","year":"2016","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.116121_bib0022","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.dam.2019.12.010","article-title":"Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms","volume":"283","author":"Komusiewicz","year":"2020","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.116121_bib0023","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","article-title":"Upper bounds to the clique width of graphs","volume":"101","author":"Courcelle","year":"2000","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"10.1016\/j.tcs.2026.116121_bib0024","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","article-title":"Approximating clique-width and branch-width","volume":"96","author":"Oum","year":"2006","journal-title":"J. Comb. Theory B"},{"issue":"3","key":"10.1016\/j.tcs.2026.116121_bib0025","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1142\/S0129054100000260","article-title":"On the clique-width of some perfect graph classes","volume":"11","author":"Golumbic","year":"2000","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116121_bib0026","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003506?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003506?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T13:20:33Z","timestamp":1782480033000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":26,"alternative-id":["S0304397526003506"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116121","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the complexity of minimum membership dominating set","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116121","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":"116121"}}