{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:14Z","timestamp":1758586214614,"version":"3.44.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_21","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:41Z","timestamp":1758498341000},"page":"281-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Parameterized Complexity of\u00a0Cosecure Domination"],"prefix":"10.1007","author":[{"given":"D.","family":"Karthika","sequence":"first","affiliation":[]},{"given":"R.","family":"Muthucumaraswamy","sequence":"additional","affiliation":[]},{"given":"V. P.","family":"Abidha","sequence":"additional","affiliation":[]},{"given":"Pradeesha","family":"Ashok","sequence":"additional","affiliation":[]},{"given":"Sriram","family":"Bhyravarapu","sequence":"additional","affiliation":[]},{"given":"Sayani","family":"Das","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Ayush","family":"Sawlani","sequence":"additional","affiliation":[]},{"given":"Vikash","family":"Tripathi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Butenko, S., Cheng, X., Oliveira, C.A., Pardalos, P.M.: A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks. In: Recent Developments in Cooperative Control and Optimization, pp. 61\u201373 (2004)","DOI":"10.1007\/978-1-4613-0219-3_4"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Du, D.-Z., Wan, P.-J.: Connected Dominating Set: Theory and Applications, vol. 77. Springer, Heidelberg (2012)","DOI":"10.1007\/978-1-4614-5242-3_5"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Structures of Domination in Graphs. Developments in Mathematics, vol. 66. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-58892-2"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10(3), 211\u2013219 (1980)","journal-title":"Networks"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"222","DOI":"10.3390\/math7030222","volume":"7","author":"F Yuan","year":"2019","unstructured":"Yuan, F., Li, C., Gao, X., Yin, M., Wang, Y.: A novel hybrid algorithm for minimum total dominating set problem. Mathematics 7(3), 222 (2019)","journal-title":"Mathematics"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Zhu, J.: Approximation for minimum total dominating set. In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human, pp. 119\u2013124 (2009)","DOI":"10.1145\/1655925.1655948"},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(91)90188-N","volume":"37","author":"RW Irving","year":"1991","unstructured":"Irving, R.W.: On approximating the minimum independent dominating set. Inf. Process. Lett. 37(4), 197\u2013200 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"4\u20135","key":"21_CR9","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.dam.2012.01.003","volume":"161","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois, N., Croce, F.D., Escoffier, B., Paschos, V.T.: Fast algorithms for min independent dominating set. Discrete Appl. Math. 161(4\u20135), 558\u2013572 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1137\/070699688","volume":"23","author":"EW Chambers","year":"2009","unstructured":"Chambers, E.W., Kinnersley, B., Prince, N., West, D.B.: Extremal problems for roman domination. SIAM J. Discrete Math. 23(3), 1575\u20131586 (2009)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/00207160701374376","volume":"85","author":"H Fernau","year":"2008","unstructured":"Fernau, H.: Roman domination: a parameterized perspective. Int. J. Comput. Math. 85(1), 25\u201338 (2008)","journal-title":"Int. J. Comput. Math."},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51117-3","volume-title":"Topics in Domination in Graphs","year":"2020","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Topics in Domination in Graphs, vol. 64. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51117-3"},{"key":"21_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-09496-5","volume-title":"Domination in Graphs: Core Concepts","author":"TW Haynes","year":"2023","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Domination in Graphs: Core Concepts. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-09496-5"},{"key":"21_CR14","first-page":"167","volume":"94","author":"S Arumugam","year":"2014","unstructured":"Arumugam, S., Ebadi, K., Manrique, M.: Co-secure and secure domination in graphs. Util. Math. 94, 167\u2013182 (2014)","journal-title":"Util. Math."},{"key":"21_CR15","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.: The co-secure domination in proper interval graphs. Discret. Appl. Math. 311, 68\u201371 (2022)","journal-title":"Discret. Appl. Math."},{"key":"21_CR16","doi-asserted-by":"publisher","unstructured":"Kusum, Pandey, A.: Cosecure domination: hardness results and algorithms. In: Hsieh, S.Y., Hung, L.J., Lee, C.W. (eds.) IWOCA 2023. LNCS, vol. 13889. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-34347-6_21","DOI":"10.1007\/978-3-031-34347-6_21"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Kusum, Pandey, A.: Some new algorithmic results on co-secure domination in graphs. Theoret. Comput. Sci. 992, 13 (2024). Paper No. 114451","DOI":"10.1016\/j.tcs.2024.114451"},{"issue":"1","key":"21_CR18","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.: The algorithm and complexity of co-secure domination in geometric intersection graphs. Comput. Appl. Math. 44(1), 22 (2025)","journal-title":"Comput. Appl. Math."},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Kusum, Pandey, A.: Complexity results on cosecure domination in graphs. In: Bagchi, A., Muthu, R. (eds.) CALDAM 2023. LNCS, vol. 13947, pp. 335\u2013347. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-25211-2_26","DOI":"10.1007\/978-3-031-25211-2_26"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"106463","DOI":"10.1016\/j.ipl.2023.106463","volume":"185","author":"BS Panda","year":"2024","unstructured":"Panda, B.S., Rana, S., Mishra, S.: On the complexity of co-secure dominating set problem. Inf. Process. Lett. 185, 106463 (2024)","journal-title":"Inf. Process. Lett."},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-15155-2_17","volume-title":"Mathematical Foundations of Computer Science 2010","author":"HL Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., van Leeuwen, E.J., van Rooij, J.M.M., Vatshelle, M.: Faster algorithms on branch and clique decompositions. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 174\u2013185. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15155-2_17"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Goyal, D., Jacob, A., Kumar, K., Majumdar, D., Raman, V.: Parameterized complexity of dominating set variants in almost cluster and split graphs. J. Comput. Syst. Sci. 103631 (2025)","DOI":"10.1016\/j.jcss.2025.103631"},{"key":"21_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol. 5. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"21_CR24","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Cham (2012)","edition":"4"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-03898-8_15","volume-title":"Parameterized and Exact Computation","author":"J Gajarsk\u00fd","year":"2013","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 163\u2013176. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_15"},{"key":"21_CR26","unstructured":"Rom\u00e1nek, M.: Parameterized algorithms for modular-width (2016)"},{"issue":"2","key":"21_CR27","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:44Z","timestamp":1758498344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}