{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:18:03Z","timestamp":1758637083992,"version":"3.38.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071194","11571155"],"award-info":[{"award-number":["12071194","11571155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s40314-024-02982-2","type":"journal-article","created":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T20:04:30Z","timestamp":1730923470000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The algorithm and complexity of co-secure domination in geometric intersection graphs"],"prefix":"10.1007","volume":"44","author":[{"given":"Cai-Xia","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shou-Jun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,6]]},"reference":[{"issue":"1\u20132","key":"2982_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237(1\u20132):123\u2013134","journal-title":"Theor Comput Sci"},{"key":"2982_CR2","first-page":"167","volume":"94","author":"S Arumugam","year":"2014","unstructured":"Arumugam S, Ebadi K, Manrique M (2014) Co-secure and secure domination in graphs. Util Math 94:167\u2013182","journal-title":"Util Math"},{"key":"2982_CR3","doi-asserted-by":"crossref","unstructured":"Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (1999) Complexity and approximation. Springer, New York","DOI":"10.1007\/978-3-642-58412-1"},{"issue":"4","key":"2982_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(86)90135-3","volume":"23","author":"AA Bertossi","year":"1986","unstructured":"Bertossi AA, Bonuccelli MA (1986) Hamiltonian circuits in interval graph generalizations. Inf Process Lett 23(4):195\u2013200","journal-title":"Inf Process Lett"},{"issue":"3","key":"2982_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T Biedl","year":"1998","unstructured":"Biedl T, Kant G (1998) A better heuristic for orthogonal graph drawings. Comput Geom 9(3):159\u2013180","journal-title":"Comput Geom"},{"issue":"2","key":"2982_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11590-010-0211-0","volume":"5","author":"S Butenko","year":"2011","unstructured":"Butenko S, Anderoglu SK, Ursulenko O (2011) On connected domination in unit ball graphs. Optim Lett 5(2):195\u2013205","journal-title":"Optim Lett"},{"key":"2982_CR7","first-page":"747","volume-title":"Domination in geometric intersection graphs","author":"T Erlebach","year":"2008","unstructured":"Erlebach T, van Leeuwen EJ (2008) Domination in geometric intersection graphs. Springer, Berlin, pp 747\u2013758"},{"key":"2982_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"issue":"12","key":"2982_CR9","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68(12):1497\u20131514","journal-title":"Proc IEEE"},{"key":"2982_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2015.08.024","volume":"602","author":"RW Hung","year":"2015","unstructured":"Hung RW, Yao CC, Chan SJ (2015) The Hamiltonian properties of supergrid graphs. Theor Comput Sci 602:132\u2013148","journal-title":"Theor Comput Sci"},{"key":"2982_CR11","doi-asserted-by":"crossref","unstructured":"Kusum, Pandey A (2023) Complexity results on cosecure domination in graphs, CALDAM: Algorithms and Discrete Applied Mathematics, pp 335\u2013347","DOI":"10.1007\/978-3-031-25211-2_26"},{"key":"2982_CR12","doi-asserted-by":"publisher","first-page":"106463","DOI":"10.1016\/j.ipl.2023.106463","volume":"185","author":"BS Panda","year":"2024","unstructured":"Panda BS, Rana S, Mishra S (2024) On the complexity of co-secure dominating set problem. Inf Process Lett 185:106463","journal-title":"Inf Process Lett"},{"key":"2982_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"LG Valiant","year":"1981","unstructured":"Valiant LG (1981) Universality considerations in VLSI circuits. IEEE Trans Comput C 30:135\u2013140","journal-title":"IEEE Trans Comput C"},{"key":"2982_CR14","doi-asserted-by":"crossref","unstructured":"Wang C-X, Yang Y, Xu S-J (2023a) Secure connected domination and secure total domination in unit disk graphs and rectangle graphs. Theor Comput Sci 957:113824","DOI":"10.1016\/j.tcs.2023.113824"},{"key":"2982_CR15","doi-asserted-by":"crossref","unstructured":"Wang C-X, Yang Y, Xu S-J (2023b) Algorithmic aspects of secure domination in unit disk graphs. Inf Comput 295:105090","DOI":"10.1016\/j.ic.2023.105090"},{"key":"2982_CR16","unstructured":"Wang CX, Yang Y, Xu SJ (2023c) The algorithm and complexity of secure domination in 3-dimensional box graphs, manuscript"},{"key":"2982_CR17","unstructured":"West DB (2001) Introduction to graph theory, vol 2. Prentice Hall, Upper Saddle River"},{"key":"2982_CR18","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.dam.2022.01.013","volume":"311","author":"Y-H Zou","year":"2022","unstructured":"Zou Y-H, Liu J-J, Chang S-C, Hsu C-C (2022) The co-secure domination in proper interval graphs. Discrete Appl Math 311:68\u201371","journal-title":"Discrete Appl Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02982-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02982-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02982-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T05:16:19Z","timestamp":1741065379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02982-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,6]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2982"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02982-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,11,6]]},"assertion":[{"value":"2 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"22"}}