{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:49:09Z","timestamp":1774910949616,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032205360","type":"print"},{"value":"9783032205377","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-20537-7_9","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:30:16Z","timestamp":1773757816000},"page":"133-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Denoising Diffusion Adaptive Search for\u00a0the\u00a0$$\\alpha $$-Domination Problem on\u00a0Social Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0582-5786","authenticated-orcid":false,"given":"Martin","family":"Wustinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7528-0834","authenticated-orcid":false,"given":"Enrico","family":"Iurlano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3293-177X","authenticated-orcid":false,"given":"G\u00fcnther","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Abu-Khzam, F.N., Lamaa, K.: Efficient heuristic algorithms for positive-influence dominating set in social networks. In: IEEE Conference on Computer Communications Workshops, INFOCOM 2018, pp. 610\u2013615. IEEE (2018). https:\/\/doi.org\/10.1109\/INFCOMW.2018.8406851","DOI":"10.1109\/INFCOMW.2018.8406851"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Aiello, W., Chung, F.R.K., Lu, L.: A random graph model for massive graphs. In: Yao, F.F., Luks, E.M. (eds.) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 171\u2013180. ACM (2000). https:\/\/doi.org\/10.1145\/335305.335326","DOI":"10.1145\/335305.335326"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/S44196-022-00098-1","volume":"15","author":"MA Akbay","year":"2022","unstructured":"Akbay, M.A., Serrano, A.L., Blum, C.: A self-adaptive variant of CMSA: application to the minimum positive influence dominating set problem. Int. J. Comput. Intell. Syst. 15(1), 44 (2022). https:\/\/doi.org\/10.1007\/S44196-022-00098-1","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Austin, J., Johnson, D.D., Ho, J., Tarlow, D., van\u00a0den Berg, R.: Structured denoising diffusion models in discrete state-spaces. In: Proceedings of the 35th International Conference on Neural Information Processing Systems, NIPS \u201921 (2021). https:\/\/doi.org\/10.48550\/arXiv.2107.03006","DOI":"10.48550\/arXiv.2107.03006"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Blum, C., Davidson, P.P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve & adapt a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016). https:\/\/doi.org\/10.1016\/j.cor.2015.10.014","DOI":"10.1016\/j.cor.2015.10.014"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Brody, S., Alon, U., Yahav, E.: How attentive are graph attention networks? In: The Tenth International Conference on Learning Representations, ICLR 2022. OpenReview.net (2022). https:\/\/doi.org\/10.48550\/arXiv.2105.14491","DOI":"10.48550\/arXiv.2105.14491"},{"issue":"9","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9), 1672\u20131696 (2011). https:\/\/doi.org\/10.1016\/j.artint.2011.03.003","journal-title":"Artif. Intell."},{"issue":"6","key":"9_CR8","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., Milani\u010d, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Discret. Appl. Math. 161(6), 750\u2013767 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.10.007","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009). https:\/\/doi.org\/10.1137\/070710111","journal-title":"SIAM Rev."},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Cleveland, W.S.: Robust locally weighted regression and smoothing scatterplots. J. Am. Stat. Assoc. 74(368), 829\u2013836 (1979). https:\/\/doi.org\/10.1080\/01621459.1979.10481038","DOI":"10.1080\/01621459.1979.10481038"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.7151\/DMGT.1241","volume":"24","author":"F Dahme","year":"2004","unstructured":"Dahme, F., Rautenbach, D., Volkmann, L.: Some remarks on alpha-domination. Discussiones Mathematicae Graph Theor. 24(3), 423\u2013430 (2004). https:\/\/doi.org\/10.7151\/DMGT.1241","journal-title":"Discussiones Mathematicae Graph Theor."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00373-017-1869-1","volume":"34","author":"A Das","year":"2017","unstructured":"Das, A., Laskar, R.C., Rad, N.J.: On $$\\alpha $$-domination in graphs. Graph. Comb. 34(1), 193\u2013205 (2017). https:\/\/doi.org\/10.1007\/s00373-017-1869-1","journal-title":"Graph. Comb."},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Rey, D., Neuh\u00e4user, M.: Wilcoxon-Signed-Rank Test, pp. 1658\u20131659. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-04898-2_616","DOI":"10.1007\/978-3-642-04898-2_616"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Dunbar, J.E., Hoffman, D.G., Laskar, R.C., Markus, L.R.: $$\\alpha $$-domination. Discrete Math. 211, 11\u201326 (2000). https:\/\/doi.org\/10.1016\/S0012-365X(99)00131-4","DOI":"10.1016\/S0012-365X(99)00131-4"},{"key":"9_CR15","unstructured":"Fairbanks, J., Besan\u00e7on, M., Simon, S., Hoffiman, J., Eubank, N., Karpinski, S.: JuliaGraphs\/Graphs.jl: an optimized graphs package for the Julia programming language (2021). https:\/\/github.com\/JuliaGraphs\/Graphs.jl\/"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/S00373-009-0864-6","volume":"25","author":"A Gagarin","year":"2009","unstructured":"Gagarin, A., Poghosyan, A., Zverovich, V.E.: Upper bounds for $$\\alpha $$-domination parameters. Graph. Comb. 25(4), 513\u2013520 (2009). https:\/\/doi.org\/10.1007\/S00373-009-0864-6","journal-title":"Graph. Comb."},{"key":"9_CR17","unstructured":"Gurobi Optimization, LLC.: Gurobi Optimizer Reference Manual (2024). https:\/\/www.gurobi.com"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-4149(74)90001-5","volume":"2","author":"F G\u00f6bel","year":"1974","unstructured":"G\u00f6bel, F., Jagers, A.: Random walks on graphs. Stoch. Process. Appl. 2(4), 311\u2013336 (1974). https:\/\/doi.org\/10.1016\/0304-4149(74)90001-5","journal-title":"Stoch. Process. Appl."},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Ho, J., Jain, A., Abbeel, P.: Denoising diffusion probabilistic models. In: Proceedings of the 34th International Conference on Neural Information Processing Systems, NIPS \u201920 (2020). https:\/\/doi.org\/10.48550\/arXiv.2006.11239","DOI":"10.48550\/arXiv.2006.11239"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Iurlano, E., Varga, J., Raidl, G.R.: Tackling the $$\\alpha $$-domination problem heuristically. In: Quesada-Arencibia, A., Affenzeller, M., Moreno-D\u00edaz, R. (eds.) 19th International Conference on Computer Aided Systems Theory, EUROCAST 2024. LNCS, vol. 15172, pp. 148\u2013156. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-82949-9_14","DOI":"10.1007\/978-3-031-82949-9_14"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Getoor, L., Senator, T.E., Domingos, P.M., Faloutsos, C. (eds.) Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"9_CR22","unstructured":"Li, Y., Guo, J., Wang, R., Yan, J.: T2T: from distribution learning in training to gradient search in testing for combinatorial optimization. In: Proceedings of the 37th International Conference on Neural Information Processing Systems, NIPS \u201923 (2023)"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Pugacheva, D., Ermakov, A., Lyskov, I., Makarov, I., Zotov, Y.: Enhancing GNNs performance on combinatorial optimization by recurrent feature update (2024). https:\/\/doi.org\/10.48550\/arXiv.2407.16468","DOI":"10.48550\/arXiv.2407.16468"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Rad, N.J., Volkmann, L.: Vertex-removal in $$\\alpha $$-domination. FILOMAT 26(6), 1257\u20131262 (2012). http:\/\/www.jstor.org\/stable\/24895832","DOI":"10.2298\/FIL1206257R"},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/S00373-015-1614-6","volume":"32","author":"NJ Rad","year":"2016","unstructured":"Rad, N.J., Volkmann, L.: Edge-removal and edge-addition in $$\\alpha $$-domination. Graph. Comb. 32(3), 1155\u20131166 (2016). https:\/\/doi.org\/10.1007\/S00373-015-1614-6","journal-title":"Graph. Comb."},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Raei, H., Yazdani, N., Asadpour, M.: A new algorithm for positive influence dominating set in social networks. In: International Conference on Advances in Social Networks Analysis and Mining, pp. 253\u2013257. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/ASONAM.2012.51","DOI":"10.1109\/ASONAM.2012.51"},{"issue":"3","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1287\/IJOC.2021.1144","volume":"34","author":"S Raghavan","year":"2022","unstructured":"Raghavan, S., Zhang, R.: Rapid influence maximization on social networks: the positive influence dominating set problem. INFORMS J. Comput. 34(3), 1345\u20131365 (2022). https:\/\/doi.org\/10.1287\/IJOC.2021.1144","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9_CR28","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0165-1765(01)00524-9","volume":"74","author":"WJ Reed","year":"2001","unstructured":"Reed, W.J.: The Pareto, Zipf and other power laws. Econ. Lett. 74(1), 15\u201319 (2001). https:\/\/doi.org\/10.1016\/S0165-1765(01)00524-9","journal-title":"Econ. Lett."},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"9_CR30","unstructured":"Rowley, C.: PythonCall.jl: Python and Julia in harmony (2022). https:\/\/github.com\/JuliaPy\/PythonCall.jl"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez, J.E.R., Sartori, C.C., Blum, C.: Q-learning ant colony optimization supported by deep learning for target set selection. In: Silva, S., Paquete, L. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2023, pp. 357\u2013366. ACM (2023). https:\/\/doi.org\/10.1145\/3583131.3590396","DOI":"10.1145\/3583131.3590396"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Soler, J.S., Raidl, G.R.: A denoising diffusion-based evolutionary algorithm framework: application to the maximum independent set problem (2025). https:\/\/doi.org\/10.48550\/arXiv.2510.08627","DOI":"10.48550\/arXiv.2510.08627"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"106197","DOI":"10.1016\/J.COR.2023.106197","volume":"154","author":"R Sun","year":"2023","unstructured":"Sun, R., Wu, J., Jin, C., Wang, Y., Zhou, W., Yin, M.: An efficient local search algorithm for minimum positive influence dominating set problem. Comput. Oper. Res. 154, 106197 (2023). https:\/\/doi.org\/10.1016\/J.COR.2023.106197","journal-title":"Comput. Oper. Res."},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Sun, Z., Yang, Y.: DIFUSCO: graph-based diffusion solvers for combinatorial optimization. In: Proceedings of the 37th International Conference on Neural Information Processing Systems, NIPS \u201923 (2023).https:\/\/doi.org\/10.48550\/arXiv.2302.08224","DOI":"10.48550\/arXiv.2302.08224"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Wang, F., Camacho, E., Xu, K.: Positive influence dominating set in online social networks. In: Du, D., Hu, X., Pardalos, P.M. (eds.) Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications. LNCS, vol.\u00a05573, pp. 313\u2013321. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02026-1_29","DOI":"10.1007\/978-3-642-02026-1_29"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Watkins, C.J.C.H., Dayan, P.: $$Q$$-learning. Mach. Learn. 8, 279\u2013292 (1992). https:\/\/doi.org\/10.1007\/BF00992698","DOI":"10.1007\/BF00992698"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Zhao, H., Yu, K., Huang, Y., Yi, R., Zhu, C., Xu, K.: DISCO: efficient diffusion solver for large-scale combinatorial optimization problems. Graph. Models 141, 101284 (2025).https:\/\/doi.org\/10.48550\/arXiv.2406.19705","DOI":"10.48550\/arXiv.2406.19705"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20537-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:03:06Z","timestamp":1774908186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}