{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:13Z","timestamp":1758586213710,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"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_20","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:40Z","timestamp":1758498340000},"page":"267-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of\u00a0Positive Influence Domination on\u00a0Partial Grids"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7528-0834","authenticated-orcid":false,"given":"Enrico","family":"Iurlano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3293-177X","authenticated-orcid":false,"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0166-218X(92)90121-P","volume":"37","author":"N Alon","year":"1992","unstructured":"Alon, N.: Transmitting in the $$n$$-dimensional cube. Discret. Appl. Math. 37, 9\u201311 (1992)","journal-title":"Discret. Appl. Math."},{"key":"20_CR2","first-page":"429","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. I: discharging. Illinois J. Math. 21, 429\u2013490 (1977)","journal-title":"Illinois J. Math."},{"key":"20_CR3","first-page":"151","volume":"110","author":"S Bermudo","year":"2019","unstructured":"Bermudo, S., Jalemskaya, D.L., Sigarreta, J.M.: Total $$2$$-domination in grid graphs. Utilitas Math. 110, 151\u2013173 (2019)","journal-title":"Utilitas Math."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-22953-4_25","volume-title":"Fundamentals of Computation Theory","author":"F Cicalese","year":"2011","unstructured":"Cicalese, F., Milani\u010d, M., Vaccaro, U.: Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 288\u2013297. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22953-4_25"},{"issue":"1\u20133","key":"20_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discret. Math."},{"issue":"1\u20132","key":"20_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0166-218X(00)00219-5","volume":"108","author":"P Damaschke","year":"2001","unstructured":"Damaschke, P.: Minus domination in small-degree graphs. Discret. Appl. Math. 108(1\u20132), 53\u201364 (2001)","journal-title":"Discret. Appl. Math."},{"key":"20_CR7","unstructured":"Dunbar, J., Hedetniemi, S., Henning, M., Slater, P.: Signed domination in graphs. In: Alavi, Y., Schwenk, A. (eds.) Graph Theory, Combinatorics, and Algorithms\u2014Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, pp. 311\u2013322. Wiley, New York (1995)"},{"issue":"1\u20133","key":"20_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0012-365X(99)00131-4","volume":"211","author":"JE Dunbar","year":"2000","unstructured":"Dunbar, J.E., Hoffman, D.G., Laskar, R.C., Markus, L.R.: $$\\alpha $$-domination. Discret. Math. 211(1\u20133), 11\u201326 (2000)","journal-title":"Discret. Math."},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"70","DOI":"10.5614\/ejgta.2014.2.1.7","volume":"2","author":"H Fernau","year":"2014","unstructured":"Fernau, H., Rodr\u00edguez-Vel\u00e1zquez, J.A.: A survey on alliances and related parameters in graphs. Electron. J. Graph Theory Appl. 2(1), 70\u201386 (2014)","journal-title":"Electron. J. Graph Theory Appl."},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/11082574","volume":"25","author":"D Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, D., Pinlou, A., Rao, M., Thomass\u00e9, S.: The domination number of grids. SIAM J. Discret. Math. 25(3), 1443\u20131453 (2011)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"20_CR11","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J Harant","year":"1999","unstructured":"Harant, J., Pruchnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Comb. Probab. Comput. 8(6), 547\u2013553 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-54423-1_21","volume-title":"LATIN 2014: Theoretical Informatics","author":"T Ishii","year":"2014","unstructured":"Ishii, T., Ono, H., Uno, Y.: (Total) vector domination for graphs with bounded branchwidth. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 238\u2013249. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54423-1_21"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. Association for Computing Machinery (2003)","DOI":"10.1145\/956750.956769"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2014.04.007","volume":"174","author":"JK Lan","year":"2014","unstructured":"Lan, J.K., Chang, G.J.: On the algorithmic complexity of $$k$$-tuple total domination. Discret. Appl. Math. 174, 81\u201391 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"9506","DOI":"10.3934\/math.2023479","volume":"8","author":"L Li","year":"2023","unstructured":"Li, L., Yue, J., Zhang, X.: Double total domination number of Cartesian product of paths. AIMS Math. 8(4), 9506\u20139519 (2023)","journal-title":"AIMS Math."},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2000.2026","volume":"82","author":"B Mohar","year":"2001","unstructured":"Mohar, B.: Face covers and the genus problem for apex graphs. J. Combin. Theory Ser. B 82(1), 102\u2013117 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(01)00055-X","volume":"282","author":"D Peleg","year":"2002","unstructured":"Peleg, D.: Local majorities, coalitions and monopolies in graphs: a review. Theoret. Comput. Sci. 282(2), 231\u2013257 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"21","key":"20_CR18","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.ipl.2012.07.010","volume":"112","author":"D Pradhan","year":"2012","unstructured":"Pradhan, D.: Algorithmic aspects of $$k$$-tuple total domination in graphs. Inf. Process. Lett. 112(21), 816\u2013822 (2012)","journal-title":"Inf. Process. Lett."},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-85097-7_11","volume-title":"Combinatorial Optimization and Applications","author":"V Raman","year":"2008","unstructured":"Raman, V., Saurabh, S., Srihari, S.: Parameterized algorithms for generalized domination. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 116\u2013126. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85097-7_11"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Rao, M., Talon, A.: The 2-domination and Roman domination numbers of grid graphs. Discrete Math. Theor. Comput. Sci. 21(1) (2019)","DOI":"10.23638\/DMTCS-21-1-9"},{"issue":"2","key":"20_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"100","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 100(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-02026-1_29","volume-title":"Combinatorial Optimization and Applications","author":"F Wang","year":"2009","unstructured":"Wang, F., Camacho, E., Xu, K.: Positive influence dominating set in online social networks. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol. 5573, pp. 313\u2013321. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02026-1_29"},{"issue":"3","key":"20_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2009.10.001","volume":"412","author":"F Wang","year":"2011","unstructured":"Wang, F., et al.: On positive influence dominating sets in social networks. Theoret. Comput. Sci. 412(3), 265\u2013269 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"20_CR24","doi-asserted-by":"publisher","first-page":"1975","DOI":"10.1007\/s40840-022-01343-8","volume":"45","author":"H Wang","year":"2022","unstructured":"Wang, H., Wang, N., Zhang, Y., Xiao, J., Sun, Y.: Positive influence domination in graphs. Bull. Malay. Math. Sci. Soc. 45(5), 1975\u20131985 (2022)","journal-title":"Bull. Malay. Math. Sci. Soc."},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-38756-2_27","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Y Zheng","year":"2013","unstructured":"Zheng, Y., Wang, J., Feng, Q.: Kernelization and lower bounds of the signed domination problem. In: Fellows, M., Tan, X., Zhu, B. (eds.) AAIM\/FAW -2013. LNCS, vol. 7924, pp. 261\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38756-2_27"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:42Z","timestamp":1758498342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_20","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":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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"}}]}}