{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:34:59Z","timestamp":1783150499163,"version":"3.54.6"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031826696","type":"print"},{"value":"9783031826702","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82670-2_14","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:40:06Z","timestamp":1738816806000},"page":"179-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distance Vector Domination"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adele A.","family":"Rescigno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"404","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Error and attack tolerance of complex networks. Nature 404, 378\u2013382 (2000)","journal-title":"Nature"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8, 277\u2013284 (1987)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee, S., Jenamani, M., Pratihar, D.K.: A survey on influence maximization in a social network. Knowl. Inf. Syst. 62, 3417\u20133455 (2020). https:\/\/doi.org\/10.1007\/s10115-020-01461-4","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2010.09.007","volume":"8","author":"O Ben-Zwi","year":"2011","unstructured":"Ben-Zwi, O., Hermelin, D., Lokshtanov, D., Newman, I.: Treewidth governs the complexity of target set selection. Discret. Optim. 8(1), 87\u201396 (2011)","journal-title":"Discret. Optim."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bermond, J.-C., Gargano, L., Rescigno, A.A.: Gathering with minimum delay in tree sensor networks. In: Proceedings of SIROCCO\u201908, LNCS 5058, pp. 262\u2013276 (2008)","DOI":"10.1007\/978-3-540-69355-0_22"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Kloks, T.: Better algorithms for the pathwidth and treewidth of graphs. In: Proceedings of ICALP\u201991, LNCS 510, pp. 544\u2013555 (1991)","DOI":"10.1007\/3-540-54233-7_162"},{"issue":"1\u20132","key":"14_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2011.08.013","volume":"160","author":"N Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On Bounded-Degree Vertex Deletion parameterized by treewidth. Discret. Appl. Math. 160(1\u20132), 53\u201360 (2012)","journal-title":"Discret. Appl. Math."},{"key":"14_CR8","unstructured":"Borradaile, G., Le, H.: Optimal dynamic program for R-domination problems over tree decompositions. In: Proceedings of 11th International Symposium on Parameterized and Exact Computation, IPEC, LIPIcs, vol. 63, pp. 8:1\u20138:23 (2016)"},{"issue":"8","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1109\/JPROC.2003.814918","volume":"91","author":"C-Y Chong","year":"2003","unstructured":"Chong, C.-Y., Kumar, S.P.: Sensor networks: Evolution, opportunities, and challenges. Proc. IEEE 91(8), 1247\u20131256 (2003)","journal-title":"Proc. IEEE"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.dam.2012.10.007","volume":"161","author":"F Cicalese","year":"2013","unstructured":"Cicalese, F., Milanic, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Discrete Appl. Math. 161, 750\u2013767 (2013)","journal-title":"Discrete Appl. Math."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.02.027","volume":"535","author":"F Cicalese","year":"2014","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milanic, M., Vaccaro, U.: Latency-bounded target set selection in social networks. Theoret. Comput. Sci. 535, 1\u201315 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A.A., Vaccaro, U.: A fast and effective heuristic for discovering small target sets in social networks. In: Proceedings of the 9th International Conference on Combinatorial Optimization and Applications (COCOA) (2015)","DOI":"10.1007\/978-3-319-26626-8_15"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Influence propagation over large scale social networks. In: Proceedings of IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM\u201915), pp. 1531\u20131538 (2015)","DOI":"10.1145\/2808797.2808888"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: On finding small sets that influence large networks. Soc. Netw. Anal. Min. 6(11) (2016)","DOI":"10.1007\/s13278-016-0408-z"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1007\/s00453-017-0390-5","volume":"80","author":"G Cordasco","year":"2018","unstructured":"Cordasco, G., Gargano, L., Mecchia, M., Rescigno, A.A., Vaccaro, U.: Discovering small target sets in social networks: a fast and effective algorithm. Algorithmica 80(6), 1804\u20131833 (2018)","journal-title":"Algorithmica"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1002\/net.21756","volume":"71","author":"G Cordasco","year":"2018","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A., Vaccaro, U.: Evangelism in social networks: algorithms and complexity. Networks 71(4), 346\u2013357 (2018)","journal-title":"Networks"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2018.02.024","volume":"764","author":"G Cordasco","year":"2019","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Active influence spreading in social networks. Theoret. Comput. Sci. 764, 15\u201329 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2018.05.030","volume":"810","author":"G Cordasco","year":"2020","unstructured":"Cordasco, G., et al.: Whom to befriend to influence people. Theoret. Comput. Sci. 810, 26\u201342 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: Parameterized complexity for iterated type partitions and modular-width. Discrete Appl. Math., 350 (2024)","DOI":"10.1016\/j.dam.2024.03.009"},{"key":"14_CR20","unstructured":"Corneil, D., Habib, M., Paul, C., Tedder, M.: A recursive linear time modular decomposition algorithm via LexBFS. arXiv:0710.3901 [cs.DM] (2024)"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs recognizable sets of finite graphs. Inform. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inform. Comput."},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1), 77\u2013114 (2000)","journal-title":"Discret. Appl. Math."},{"key":"14_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. Springer International Publishing, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Dasgupta, K., Kukreja, M., Kalpakis, K.: Topology-aware placement and role assignment for energy-efficient information gathering in sensor networks. In Proceedings of IEEE Symposium on Computers and Communications, pp. 341\u2013348 (2003)","DOI":"10.1109\/ISCC.2003.1214143"},{"key":"14_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Dvor\u00e1k, P., Knop, D., Toufar, T.: Target set selection in dense graph classes. In: Proceedings of 29th International Symposium on Algorithms and Computation (ISAAC\u201918) (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.18","DOI":"10.4230\/LIPIcs.ISAAC.2018.18"},{"key":"14_CR27","unstructured":"Fink, J.F., Jacobson, M.S.: n-Domination in Graphs. Graph Theory with Applications to Algorithms and Computer Science. John Wiley & Sons, pp. 283\u2013300 (1985)"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Proceedings of 8th International Symposium on Parameterized and Exact Computation (IPEC 2013), LNCS 8246, pp. 163\u2013176 (2013)","DOI":"10.1007\/978-3-319-03898-8_15"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungarica 18, 26\u201366 (1967)","journal-title":"Acta Mathematica Academiae Scientiarum Hungarica"},{"key":"14_CR30","unstructured":"Ganian, R.: Using Neighborhood Diversity to Solve Hard Problems. arXiv 2012 (2012). arXiv:1201.3091"},{"issue":"6","key":"14_CR31","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter, M.: Threshold models of collective behaviors. Am. J. Sociol. 83(6), 1420\u20131443 (1978)","journal-title":"Am. J. Sociol."},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10878-006-9037-1","volume":"13","author":"W Goddard","year":"2007","unstructured":"Goddard, W., Henning, M.A.: Restricted domination parameters in graphs. J. Comb. Optim. 13, 353\u2013363 (2007)","journal-title":"J. Comb. Optim."},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs, Marcel Dekker (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P. (Eds.). Domination in Graphs: Advanced Topics, Marcel Dekker (1998)","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F"},{"key":"14_CR35","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J Harant","year":"1999","unstructured":"Harant, J., Prochnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Comb. Probab. Comput. 8, 547\u2013553 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Henning, M.A.: Distance domination in graphs. In: Topics in Domination in Graphs. Developments in Mathematics, vol. 64 (2020). https:\/\/doi.org\/10.1007\/978-3-030-51117-3_7","DOI":"10.1007\/978-3-030-51117-3_7"},{"issue":"2","key":"14_CR37","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR38","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dam.2016.03.002","volume":"207","author":"T Ishii","year":"2016","unstructured":"Ishii, T., Ono, H., Uno, Y.: (Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. 207, 80\u201389 (2016)","journal-title":"Discret. Appl. Math."},{"key":"14_CR39","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.dam.2018.11.002","volume":"264","author":"I Katsikarelis","year":"2019","unstructured":"Katsikarelis, I., Lampis, M., Paschos, V.T.: Structural parameters, tight bounds, and approximation for (k, r)-center. Discr. App. Math. 264, 90\u2013117 (2019)","journal-title":"Discr. App. Math."},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of KDD\u201903, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data 3(2) (2009)","DOI":"10.1145\/1514888.1514892"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"Kloks, T.: Treewidth Computations and Approximations. LNCS 842, Springer-Verlag Berlin, Heidelberg (1994). ISSN 0302-9743, https:\/\/doi.org\/10.1007\/BFb0045375","DOI":"10.1007\/BFb0045375"},{"key":"14_CR43","unstructured":"Lafond, M., Luo, W.: Parameterized complexity of domination problems using restricted modular partitions. In: MFCS 2023, pp. 61:1\u201361:14 (2023)"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Lamblet Mafort, R., Protti, F.: Vector Domination in split-indifference graphs. Inf. Process. Lett., 155 (2020). ISSN 0020-0190","DOI":"10.1016\/j.ipl.2019.105899"},{"key":"14_CR45","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64, 19\u201337 (2012)","journal-title":"Algorithmica"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Forrest, S., Balthrop, J.: Email networks and the spread of computer viruses. Phys. Rev. E 66 (2002)","DOI":"10.1103\/PhysRevE.66.035101"},{"key":"14_CR47","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":"14_CR48","unstructured":"Romanek, M.: Parameterized algorithms for modular-width. Bachelor\u2019s Thesis (2016)"},{"issue":"3","key":"14_CR49","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1145\/321958.321964","volume":"23","author":"PJ Slater","year":"1976","unstructured":"Slater, P.J.: R-domination in graphs. J. Assoc. Comp. Mach. 23(3), 446\u2013450 (1976)","journal-title":"J. Assoc. Comp. Mach."},{"key":"14_CR50","doi-asserted-by":"crossref","unstructured":"Li, P., Wang, A., Shang, J.: A simple optimal algorithm for k-tuple dominating problem in interval graphs. J. Comb. Optim. 45(14) (2023)","DOI":"10.1007\/s10878-022-00982-8"},{"key":"14_CR51","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385\u2013393 (1982)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:40:45Z","timestamp":1757133645000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}