{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:25:13Z","timestamp":1771701913109,"version":"3.50.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006190","name":"Politechnika Gda?ska","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3532392","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:59:11Z","timestamp":1737399551000},"page":"17495-17505","source":"Crossref","is-referenced-by-count":4,"title":["Two Approaches to Constructing Certified Dominating Sets in Social Networks"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1807-4978","authenticated-orcid":false,"given":"Joanna","family":"Raczek","sequence":"first","affiliation":[{"name":"Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Gdańsk, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2768-7861","authenticated-orcid":false,"given":"Mateusz","family":"Miotk","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, Physics and Informatics, University of Gdańsk, Gdańsk, Poland"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.23919\/ChiCC.2018.8484008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SITIS.2013.106"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CSICC52343.2021.9420625"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/srep08321"},{"key":"ref5","article-title":"Domination problems in social networks","author":"Wang","year":"2014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-40165-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2020.2987163"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.78"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2875499"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SITIS.2014.51"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCMC51019.2021.9418258"},{"issue":"10","key":"ref12","doi-asserted-by":"crossref","first-page":"844","DOI":"10.3390\/e26100844","article-title":"A cross-entropy approach to the domination problem and its variants","volume":"26","author":"Burdett","year":"2024","journal-title":"Entropy"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2018.09.004"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-72285-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.7494\/opmath.2019.39.6.815"},{"issue":"2","key":"ref16","first-page":"247","article-title":"Algorithmic aspects of certified domination in graphs","volume":"7","author":"Jakkepalli","year":"2022","journal-title":"Commun. Combinatorics Optim."},{"issue":"12","key":"ref17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3390\/a13120339","article-title":"A performance study of some approximation algorithms for computing a small dominating set in a graph","volume":"13","author":"Li","year":"2020","journal-title":"Algorithms"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.ins.2017.10.033","article-title":"An order-based algorithm for minimum dominating set with application in graph mining","volume":"426","author":"Chalupa","year":"2018","journal-title":"Inf. Sci."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/s1793830923500684"},{"key":"ref20","article-title":"Certified domination critical graphs upon vertex removal","author":"Miotk"},{"issue":"4","key":"ref21","doi-asserted-by":"crossref","first-page":"2763","DOI":"10.29020\/nybg.ejpam.v16i4.4894","article-title":"Certified perfect domination in graphs","volume":"16","author":"Hamja","year":"2023","journal-title":"Eur. J. Pure Appl. Math."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1063\/5.0140647"},{"issue":"1","key":"ref23","doi-asserted-by":"crossref","first-page":"25","DOI":"10.2478\/ausi-2023-0003","article-title":"Connected certified domination edge critical and stable graphs","volume":"15","author":"Lone","year":"2023","journal-title":"Acta Universitatis Sapientiae, Inf."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-09496-5_2"},{"key":"ref25","volume-title":"Computers and Intractability: A Guide to Theory NP-Completeness (Series Books in the Mathematical Sciences)","author":"Garey","year":"1979"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.matcom.2022.12.018","article-title":"An iterated greedy algorithm for finding the minimum dominating set in graphs","volume":"207","author":"Casado","year":"2023","journal-title":"Math. Comput. Simul."}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10848090.pdf?arnumber=10848090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T18:43:37Z","timestamp":1738694617000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10848090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3532392","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}