{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T02:40:00Z","timestamp":1784774400760,"version":"3.55.0"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,3]]},"abstract":"<jats:p> Unit disk graphs are the intersection graphs of equal sized disks in the plane, they are widely used as a mathematical model for wireless ad-hoc networks and some problems in computational geometry. In this paper we first show that Roman dominating set and connected Roman dominating set problems in unit disk graphs are NP-complete, and then present two approximation algorithms for these problems. <\/jats:p>","DOI":"10.1142\/s1793830910000504","type":"journal-article","created":{"date-parts":[[2010,4,20]],"date-time":"2010-04-20T09:35:00Z","timestamp":1271756100000},"page":"99-105","source":"Crossref","is-referenced-by-count":14,"title":["ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS"],"prefix":"10.1142","volume":"02","author":[{"given":"WEIPING","family":"SHANG","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"XIUMEI","family":"WANG","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"XIAODONG","family":"HU","sequence":"additional","affiliation":[{"name":"Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.06.004"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1178"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00811-7"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0903"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250205"},{"key":"rf9","first-page":"136","author":"Stewart I.","journal-title":"Sci. American"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1023\/B:MONE.0000013625.87793.13"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:23:17Z","timestamp":1565140997000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":8,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1142\/S1793830910000504"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000504","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}