{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:03Z","timestamp":1781463303873,"version":"3.54.1"},"reference-count":22,"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":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.013","type":"journal-article","created":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T11:32:37Z","timestamp":1779190357000},"page":"317-327","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximation algorithm for the semitotal domination problem in unit disk graphs"],"prefix":"10.1016","volume":"391","author":[{"given":"Michael A.","family":"Henning","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawan K.","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kartik","family":"Sehgal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaurya M.","family":"Tripathi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sridhar","family":"Tuli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.dam.2026.05.013_b1","doi-asserted-by":"crossref","DOI":"10.1007\/s00373-024-02800-w","article-title":"A characterization of graphs with semitotal domination number one-third their order","volume":"40","author":"Chen","year":"2024","journal-title":"Graphs Combin."},{"issue":"2","key":"10.1016\/j.dam.2026.05.013_b2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1017\/S0004972724000509","article-title":"Graphs with semitotal domination number half their order","volume":"111","author":"Chen","year":"2025","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.dam.2026.05.013_b3","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2020.01.007","article-title":"Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width","volume":"814","author":"Galby","year":"2020","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.05.013_b4","unstructured":"M.R. Garey, D.S. Johnson, Computers and intractability, in: W.H. Freeman, Co. (Eds.), A guide to the theory of NP-completeness, San Francisco, CA, 1979. x 338 pp.."},{"key":"10.1016\/j.dam.2026.05.013_b5","first-page":"67","article-title":"Semitotal domination in graphs","volume":"94","author":"Goddard","year":"2014","journal-title":"Util. Math."},{"key":"10.1016\/j.dam.2026.05.013_b6","series-title":"Topics in Domination in Graphs","volume":"Vol. 64","year":"2020"},{"key":"10.1016\/j.dam.2026.05.013_b7","series-title":"Structures of Domination in Graphs","volume":"Vol. 66","year":"2021"},{"key":"10.1016\/j.dam.2026.05.013_b8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-09496-5","article-title":"Domination in graphs: Core concepts","author":"Haynes","year":"2023"},{"key":"10.1016\/j.dam.2026.05.013_b9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/s10878-018-0303-9","article-title":"Perfect graphs involving semitotal and semipaired domination","volume":"36","author":"Haynes","year":"2018","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.05.013_b10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s00373-017-1769-4","article-title":"Edge weighting functions on semitotal dominating sets","volume":"33","author":"Henning","year":"2017","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.05.013_b11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.disc.2014.01.021","article-title":"On matching and semitotal domination in graphs","volume":"324","author":"Henning","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.05.013_b12","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1007\/s00026-016-0331-z","article-title":"Semitotal domination in claw-free cubic graphs","volume":"20","author":"Henning","year":"2016","journal-title":"Ann. Comb."},{"key":"10.1016\/j.dam.2026.05.013_b13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.7151\/dmgt.1844","article-title":"Vertices contained in all or in no minimum semitotal dominating set of a tree","volume":"36","author":"Henning","year":"2016","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.013_b14","first-page":"165","article-title":"Semitotal domination in graphs: partition and algorithmic results","volume":"106","author":"Henning","year":"2018","journal-title":"Util. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.05.013_b15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.7151\/dmgt.2254","article-title":"The semitotal domination problem in block graphs","volume":"42","author":"Henning","year":"2022","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2026.05.013_b16","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.tcs.2018.09.019","article-title":"Algorithmic aspects of semitotal domination in graphs","volume":"766","author":"Henning","year":"2019","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.05.013_b17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6525-6","article-title":"Total domination in graphs","author":"Henning","year":"2013"},{"issue":"2","key":"10.1016\/j.dam.2026.05.013_b18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","article-title":"Simple heuristics for unit disk graphs","volume":"25","author":"Marathe","year":"1995","journal-title":"Networks"},{"key":"10.1016\/j.dam.2026.05.013_b19","series-title":"Algorithms and discrete applied mathematics","first-page":"117","article-title":"Semi-total domination in unit disk graphs","author":"Rout","year":"2024"},{"key":"10.1016\/j.dam.2026.05.013_b20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.dam.2023.05.030","article-title":"A linear-time algorithm for semitotal domination in strongly chordal graphs","volume":"338","author":"Tripathi","year":"2023","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.05.013_b21","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1051\/ro\/2024037","article-title":"Semitotal domination versus domination and total domination in trees","volume":"58","author":"Zhuang","year":"2024","journal-title":"RAIRO Oper. Res."},{"key":"10.1016\/j.dam.2026.05.013_b22","article-title":"Semitotal domination in trees","volume":"20","author":"Zhuang","year":"2018","journal-title":"Discret. Math. Theor. Comput. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002957?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002957?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:07:46Z","timestamp":1781460466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":22,"alternative-id":["S0166218X26002957"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.013","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximation algorithm for the semitotal domination problem in unit disk graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.013","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"}]}}