{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:34:52Z","timestamp":1783150492668,"version":"3.54.6"},"publisher-location":"Singapore","reference-count":47,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819628445","type":"print"},{"value":"9789819628452","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-981-96-2845-2_7","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T15:59:46Z","timestamp":1740067186000},"page":"94-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Complexity of\u00a0(d,\u00a0r)-Domination via\u00a0Modular Decomposition"],"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,21]]},"reference":[{"key":"7_CR1","unstructured":"Bakhshesh, D., Farshi, M., Hasheminezhad, M.: Complexity results for k-domination and $$\\alpha $$-domination problems and their variants. arXiv:1702.00533 [cs .CC] (2017)"},{"key":"7_CR2","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":"7_CR3","first-page":"29","volume":"10","author":"JT Bean","year":"1994","unstructured":"Bean, J.T., Henning, M.A., Swart, H.C.: On the integrity of distance domination in graphs. Aust. J. Combin. 10, 29\u201343 (1994)","journal-title":"Aust. J. Combin."},{"key":"7_CR4","unstructured":"Borradaile, G., Le, H.: Optimal dynamic program for r-domination problems over tree decompositions. In: Proceedings of IPEC 2016, pp. 8:1\u20138:23 (2016)"},{"key":"7_CR5","unstructured":"Chang, G.J., Nemhauser, G.L.: The k-domination and k-stability problem on graphs. Technical report 540, Cornell University (1982)"},{"issue":"6","key":"7_CR6","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(6), 750\u2013767 (2013)","journal-title":"Discrete Appl. Math."},{"key":"7_CR7","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. Theor. Comput. Sci. 535, 1\u201315 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0408-z","volume":"6","author":"G Cordasco","year":"2016","unstructured":"Cordasco, G., Gargano, L., Rescigno, A.A.: On finding small sets that influence large networks. Soc. Netw. Anal. Min. 6(1), 1\u201320 (2016). https:\/\/doi.org\/10.1007\/s13278-016-0408-z","journal-title":"Soc. Netw. Anal. Min."},{"issue":"6","key":"7_CR9","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":"7_CR10","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":"7_CR11","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":"7_CR12","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":"7_CR13","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":"7_CR14","unstructured":"Corneil, D., Habib, M., Paul, C., Tedder, M.: A recursive linear time modular decomposition algorithm via LexBFS. arXiv:0710.3901 [cs.DM] (2024)"},{"key":"7_CR15","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: International Conference on Communications, Montreal, Canada (1997)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Datta, A., Larmore, L., Devismes, S., Heurtefeux, K., Rivierre, Y.: Competitive self-stabilizing k-clustering. In: Proceedings of ICDCS 2012, pp. 476\u2013485 (2012)","DOI":"10.1109\/ICDCS.2012.72"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Proceedings of 36th ICALP. LNCS, vol. 5555, pp. 378\u2013389. Springer (2009)","DOI":"10.1007\/978-3-642-02927-1_32"},{"key":"7_CR18","first-page":"161","volume":"87","author":"RG Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congr. Numer. 87, 161\u2013187 (1992)","journal-title":"Congr. Numer."},{"key":"7_CR19","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, New York (1999)"},{"key":"7_CR20","unstructured":"Drange, P.G., et al.: Kernelization and sparseness: the case of dominating set. In: Proceedings of STACS16. LIPIcs, vol. 47, pp. 31:1\u201331:14 (2016)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2016.06.004","volume":"84","author":"M Etscheid","year":"2017","unstructured":"Etscheid, M., Kratsch, S., Mnich, M., R\u00f6glin, H.: Polynomial kernels for weighted problems. J. Comput. Syst. Sci. 84, 1\u201310 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR22","unstructured":"Einarson, C., Reidl, F.: A general kernelization technique for domination and independence problems in sparse classes. In: Proceedings of IPEC 2020. LIPIcs, vol. 180, 11:1\u201311:15 (2020)"},{"key":"7_CR23","unstructured":"Fischer, N., Kunnemann, M., Redzic, M.: The effect of sparsity on k-dominating set and related first-order graph properties. CoRR abs\/2312.14593 (2023)"},{"key":"7_CR24","unstructured":"Fink, J.F., Jacobson, M.S.: n-Domination in Graphs. Graph Theory with Applications to Algorithms and Computer Science, pp. 283\u2013300. Wiley (1985)"},{"key":"7_CR25","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer (2006)"},{"key":"7_CR26","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. In: Proceedings of STACS. LIPIcs, vol. 20, pp. 92\u2013103 (2013)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press (2019)","DOI":"10.1017\/9781107415157"},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"7_CR29","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Proceedings of IPEC, vol. 8246, pp. 163\u2013176 (2013)","DOI":"10.1007\/978-3-319-03898-8_15"},{"key":"7_CR31","first-page":"26","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Scientiarum Hung. 18, 26\u201366 (1967)","journal-title":"Acta Math. Acad. Scientiarum Hung."},{"key":"7_CR32","unstructured":"Harutyunyan, L.: On the total (k,r)-domination number of random graphs. arXiv:1511.07249 (2015)"},{"key":"7_CR33","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker. Inc., New York (1998)"},{"key":"7_CR34","volume-title":"Domination in Graphs - Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs - Advanced Topics. Marcel Dekker. Inc., New York (1998)"},{"key":"7_CR35","series-title":"Developments in Mathematics","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-030-51117-3_7","volume-title":"Topics in Domination in Graphs","author":"MA Henning","year":"2020","unstructured":"Henning, M.A.: Distance domination in graphs. In: Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.) Topics in Domination in Graphs. DM, vol. 64, pp. 205\u2013250. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51117-3_7"},{"key":"7_CR36","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."},{"issue":"29","key":"7_CR37","first-page":"1439","volume":"6","author":"G Jothilakshmi","year":"2011","unstructured":"Jothilakshmi, G., Pushpalatha, A.P., Suganthi, S., Swaminathan, V.: (k, r)-domination in graphs. Int. J. Contemp. Math. Sci. 6(29), 1439\u20131446 (2011)","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"7_CR38","unstructured":"Lafond, M., Luo, W.: Parameterized complexity of domination problems using restricted modular partitions. In: MFCS 2023, pp. 61:1\u201361:14 (2023)"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Lafond, M., Luo, W.: Preprocessing complexity for some graph problems parameterized by structural parameters. In: Proceedings of LAGOS 2023, pp. 130\u2013139 (2023)","DOI":"10.1016\/j.procs.2023.08.222"},{"key":"7_CR40","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"},{"issue":"10\u201311","key":"7_CR41","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1016\/j.dam.2013.01.015","volume":"161","author":"JK Lan","year":"2013","unstructured":"Lan, J.K., Chang, G.J.: Algorithmic aspects of the k-domination problem in graphs. Discrete Appl. Math. 161(10\u201311), 1513\u20131520 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"7_CR42","doi-asserted-by":"publisher","first-page":"185","DOI":"10.7151\/dmgt.1486","volume":"30","author":"Y Lu","year":"2010","unstructured":"Lu, Y., Hou, X., Xu, J.-M.: On the (2,2)-domination number of trees. Discuss. Math. Graph Theory 30(2), 185\u2013199 (2010)","journal-title":"Discuss. Math. Graph Theory"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Luo, W.: Polynomial turing compressions for some graph problems parameterized by modular-width. In: Proceedings of Computing and Combinatorics (COCOON 2023). LNCS, vol. 14422. Springer (2023)","DOI":"10.1007\/978-3-031-49190-0_9"},{"key":"7_CR44","unstructured":"Kouteck\u00fd, M.: Solving hard problems on neighborhood diversity. Master Thesis. Charles University in Prague (2013)"},{"key":"7_CR45","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":"7_CR46","unstructured":"Rom\u00e1nek, M.: Parameterized algorithms for modular-width. Bachelor\u2019s Thesis, Masaryk University (2013)"},{"issue":"3","key":"7_CR47","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."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T15:59:58Z","timestamp":1740067198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_7","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":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}