{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:50:46Z","timestamp":1782924646309,"version":"3.54.5"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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"],"award-info":[{"award-number":["12071194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571155"],"award-info":[{"award-number":["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":[[2026,12]]},"DOI":"10.1007\/s40314-026-03843-w","type":"journal-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:03:33Z","timestamp":1782921813000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Domination and secure domination on EPG graphs and VPG graphs"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2236-3061","authenticated-orcid":false,"given":"Cai-Xia","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shou-Jun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,1]]},"reference":[{"issue":"1\u20132","key":"3843_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"},{"issue":"2","key":"3843_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.7155\/jgaa.00253","volume":"16","author":"A Asinowski","year":"2012","unstructured":"Asinowski A, Cohen E, Golumbic MC, Limouzy V, Lipshteyn M, Stern M (2012) Vertex intersection graphs of paths on a grid. J Graph Algorithms Appl 16(2):129\u2013150","journal-title":"J Graph Algorithms Appl"},{"key":"3843_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.dam.2018.03.040","volume":"247","author":"T Araki","year":"2018","unstructured":"Araki T, Miyazaki H (2018) Secure domination in proper interval graphs. Discrete Appl Math 247:70\u201376","journal-title":"Discrete Appl Math"},{"key":"3843_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.dam.2019.02.043","volume":"262","author":"T Araki","year":"2019","unstructured":"Araki T, Yamanaka R (2019) Secure domination in cographs. Discrete Appl Math 262:179\u2013184","journal-title":"Discrete Appl Math"},{"key":"3843_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2019.10.019","volume":"278","author":"S Bessy","year":"2020","unstructured":"Bessy S, Bougeret M, Chaplick S, Gon\u00e7alves D, Paul C (2020) On independent set in $$B_1$$-EPG graphs. Discrete Appl Math 278:62\u201372","journal-title":"Discrete Appl Math"},{"key":"3843_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K Booth","year":"1976","unstructured":"Booth K, Lueker G (1976) Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J Comput Syst Sci 13:335\u2013379","journal-title":"J Comput Syst Sci"},{"key":"3843_CR7","doi-asserted-by":"crossref","unstructured":"Bornstein CF, Golumbic MC, Santos TD, Souza US, Szwarcfiter JL (2020) The complexity of Helly-$$B_1$$-EPG graph recognition. Discrete Math Theor Comput Sci 22. https:\/\/dmtcs.episciences.org\/6506\/pdf","DOI":"10.23638\/DMTCS-22-1-19"},{"key":"3843_CR8","first-page":"321","volume":"85","author":"AP Burger","year":"2013","unstructured":"Burger AP, de Villiers AP, van Vuuren JH (2013) Two algorithms for secure graph domination. J Comb Math Comb Comput 85:321\u2013339","journal-title":"J Comb Math Comb Comput"},{"key":"3843_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2022.101884","volume":"107","author":"D Chakraborty","year":"2022","unstructured":"Chakraborty D, Das S, Mukherjee J (2022) On dominating set of some subclasses of string graphs. Comput Geom 107:101884","journal-title":"Comput Geom"},{"key":"3843_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discr Math 86:165\u2013177","journal-title":"Discr Math"},{"key":"3843_CR11","first-page":"19","volume":"67","author":"EJ Cockayne","year":"2005","unstructured":"Cockayne EJ, Grobler PJP, Gr\u00fcndlingh WR, Munganga J, van Vuuren JH (2005) Protection of a graph. Util Math 67:19\u201332","journal-title":"Util Math"},{"key":"3843_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.dam.2019.10.004","volume":"281","author":"D Epstein","year":"2020","unstructured":"Epstein D, Golumbic MC, Lahiri A, Morgenstern G (2020) Hardness and approximation for L-EPG and $$B_1$$-EPG graphs. Discrete Appl Math 281:224\u2013228","journal-title":"Discrete Appl Math"},{"key":"3843_CR13","unstructured":"Galby E, Munaro A (2020) Approximating independent set and dominating set on VPG graphs. arXiv:2004.07566"},{"key":"3843_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/net.20305","volume":"54","author":"MC Golumbic","year":"2009","unstructured":"Golumbic MC, Lipshteyn M, Stern M (2009) Edge intersection graphs of single bend paths on a grid. Networks 54:130\u2013138","journal-title":"Networks"},{"key":"3843_CR15","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.dam.2013.10.035","volume":"167","author":"D Heldt","year":"2014","unstructured":"Heldt D, Knauer K, Ueckerdt T (2014) Edge-intersection graphs of grid paths: the bend-number. Discrete Appl Math 167:144\u2013162","journal-title":"Discrete Appl Math"},{"issue":"1","key":"3843_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and VLSI. J ACM 32(1):130\u2013136","journal-title":"J ACM"},{"key":"3843_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ipl.2019.01.005","volume":"145","author":"A Jha","year":"2019","unstructured":"Jha A, Pradhan D, Banerjee S (2019) The secure domination problem in cographs. Inform Proc Lett 145:30\u201338","journal-title":"Inform Proc Lett"},{"key":"3843_CR18","unstructured":"Mehrabi S (2017) Approximation algorithms for independence and domination on $$B_1$$-VPG and $$B_1$$-EPG graphs. arXiv:1702.05633"},{"key":"3843_CR19","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1016\/j.ipl.2015.05.006","volume":"115","author":"HB Merouane","year":"2015","unstructured":"Merouane HB, Chellali M (2015) On secure domination in graphs. Inform Proc Lett 115:786\u2013790","journal-title":"Inform Proc Lett"},{"key":"3843_CR20","doi-asserted-by":"crossref","unstructured":"Pergel M, Rza\u0327\u017cewski P (2017) On edge intersection graphs of paths with 2 bends. Discrete Appl Math 226:106\u2013116","DOI":"10.1016\/j.dam.2017.04.023"},{"key":"3843_CR21","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10878-017-0197-y","volume":"35","author":"D Pradhan","year":"2018","unstructured":"Pradhan D, Jha A (2018) On computing a minimum secure dominating set in block graphs. J Comb Optim 35:613\u2013631","journal-title":"J Comb Optim"},{"key":"3843_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2023.105090","volume":"295","author":"C-X Wang","year":"2023","unstructured":"Wang C-X, Yang Y, Xu S-J (2023) Algorithmic aspects of secure domination in unit disk graphs. Inform Comput 295:105090","journal-title":"Inform Comput"},{"key":"3843_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113824","volume":"957","author":"C-X Wang","year":"2023","unstructured":"Wang C-X, Yang Y, Xu S-J (2023) Secure connected domination and secure total domination in unit disk graphs and rectangle graphs. Theor Comput Sci 957:113824","journal-title":"Theor Comput Sci"},{"key":"3843_CR24","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.dam.2025.01.018","volume":"366","author":"C-X Wang","year":"2025","unstructured":"Wang C-X, Yang Y, Xu S-J (2025) The algorithm and complexity of secure domination in 3-dimensional box graphs. Discrete Appl Math 366:63\u201374","journal-title":"Discrete Appl Math"},{"key":"3843_CR25","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s40314-024-02982-2","volume":"44","author":"C-X Wang","year":"2025","unstructured":"Wang C-X, Yang Y, Xu S-J (2025) The algorithm and complexity of co-secure domination in geometric intersection graphs. Comput Appl Math 44:22","journal-title":"Comput Appl Math"},{"key":"3843_CR26","doi-asserted-by":"publisher","first-page":"385","DOI":"10.7151\/dmgt.2008","volume":"38","author":"HC Wang","year":"2018","unstructured":"Wang HC, Zhao YC, Deng YP (2018) The complexity of secure domination problem in graphs. Discuss Math Graph Theory 38:385\u2013396","journal-title":"Discuss Math Graph Theory"},{"key":"3843_CR27","doi-asserted-by":"publisher","unstructured":"Yang Y, Gutin G, Wang C-X, Xu S-J (2024) Locating domination set in some subclasses of $$B_1$$-VPG graphs and $$B_1$$-EPG graphs. Manuscript. DOI:https:\/\/doi.org\/10.2139\/ssrn.5184055","DOI":"10.2139\/ssrn.5184055"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03843-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03843-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03843-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:03:42Z","timestamp":1782921822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03843-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,1]]},"references-count":27,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["3843"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03843-w","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,1]]},"assertion":[{"value":"7 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2026","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":"446"}}