{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:29:06Z","timestamp":1772119746732,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_15","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"207-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Large-Scale Multi-objective Influence Maximisation with Network Downscaling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1048-0373","authenticated-orcid":false,"given":"Elia","family":"Cunegatti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9723-1830","authenticated-orcid":false,"given":"Giovanni","family":"Iacca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4830-7162","authenticated-orcid":false,"given":"Doina","family":"Bucur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"056122","DOI":"10.1103\/PhysRevE.70.056122","volume":"70","author":"M Bogu\u00f1\u00e1","year":"2004","unstructured":"Bogu\u00f1\u00e1, M., Pastor-Satorras, R., D\u00edaz-Guilera, A., Arenas, A.: Models of social networks based on social distance attachment. Phys. Rev. E 70(5), 056122 (2004)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-019-08746-5","volume":"10","author":"AD Broido","year":"2019","unstructured":"Broido, A.D., Clauset, A.: Scale-free networks are rare. Nat. Commun. 10(1), 1\u201310 (2019)","journal-title":"Nat. Commun."},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-77536-7","volume":"10","author":"D Bucur","year":"2020","unstructured":"Bucur, D.: Top influencers can be identified universally by combining classical centralities. Sci. Rep. 10(1), 1\u201314 (2020)","journal-title":"Sci. Rep."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bucur, D., Iacca, G.: Influence maximization in social networks with genetic algorithms. In: EvoApplications (2016)","DOI":"10.1007\/978-3-319-31204-0_25"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Bucur, D., Iacca, G., Marcelli, A., Squillero, G., Tonda, A.: Improving multi-objective evolutionary influence maximization in social networks. In: EvoApplications, pp. 117\u2013124 (2018)","DOI":"10.1007\/978-3-319-77538-8_9"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bucur, D., Iacca, G., Marcelli, A., Squillero, G., Tonda, A.P.: Multi-objective evolutionary algorithms for influence maximization in social networks. In: EvoApplications (2017)","DOI":"10.1007\/978-3-319-55849-3_15"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1082\u20131090. ACM (2011)","DOI":"10.1145\/2020408.2020579"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s11067-015-9288-4","volume":"16","author":"M Fire","year":"2015","unstructured":"Fire, M., Puzis, R.: Organization mining using online social networks. Netw. Spat. Econ. 16(2), 545\u2013578 (2015). https:\/\/doi.org\/10.1007\/s11067-015-9288-4","journal-title":"Netw. Spat. Econ."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg, J., Libai, B., Muller, E.: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12, 211\u2013223 (2001)","journal-title":"Mark. Lett."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","volume":"11","author":"M Gong","year":"2016","unstructured":"Gong, M., Song, C., Duan, C., Ma, L., Shen, B.: An efficient memetic algorithm for influence maximization in social networks. IEEE Comput. Intell. Mag. 11, 22\u201333 (2016)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367\u2013368","author":"M Gong","year":"2016","unstructured":"Gong, M., Yan, J., Shen, B., Ma, L., Cai, Q.: Influence maximization in social networks based on discrete particle swarm optimization. Inf. Sci. 367\u2013368, 600\u2013614 (2016)","journal-title":"Inf. Sci."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ejor.2020.06.028","volume":"289","author":"E G\u00fcney","year":"2021","unstructured":"G\u00fcney, E., Leitner, M., Ruthmair, M., Sinnl, M.: Large-scale influence maximization via maximal covering location. Eur. J. Oper. Res. 289, 144\u2013164 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"P Holland","year":"1983","unstructured":"Holland, P., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5, 109\u2013137 (1983)","journal-title":"Soc. Netw."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"100107","DOI":"10.1016\/j.simpa.2021.100107","volume":"9","author":"G Iacca","year":"2021","unstructured":"Iacca, G., Konotopska, K., Bucur, D., Tonda, A.: An evolutionary framework for maximizing influence propagation in social networks. Softw. Impacts 9, 100107 (2021)","journal-title":"Softw. Impacts"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Jiang, Q., Song, G., Cong, G., Wang, Y., Si, W., Xie, K.: Simulated annealing based influence maximization in social networks. In: AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Karrer, B., Newman, M.E.J.: Stochastic blockmodels and community structure in networks. Phys. Rev. E 83(1Pt2), 016107 (2011)","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Konotopska, K., Iacca, G.: Graph-aware evolutionary algorithms for influence maximization. In: GECCO Companion (2021)","DOI":"10.1145\/3449726.3463138"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Vanbriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks. In: KDD (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/TNET.2019.2898413","volume":"27","author":"X Li","year":"2019","unstructured":"Li, X., Smith, J.D., Dinh, T.N., Thai, M.T.: Tiptop: (almost) exact solutions for influence maximization in billion-scale networks. IEEE\/ACM Trans. Networking 27, 649\u2013661 (2019)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li, Y., Fan, J., Wang, Y., Tan, K.L.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30, 1852\u20131872 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: a survey. ACM Comput. Surv. (CSUR). 51(3), 1\u201334 (2018). https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3186727","DOI":"10.1145\/3186727"},{"key":"15_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2021.126480","volume":"586","author":"JJ Lotf","year":"2022","unstructured":"Lotf, J.J., Azgomi, M.A., Dishabi, M.R.E.: An improved influence maximization method for social networks based on genetic algorithm. Physica A 586, 126480 (2022)","journal-title":"Physica A"},{"key":"15_CR25","unstructured":"Ma, L., et al.: Influence maximization in complex networks by using evolutionary deep reinforcement learning. IEEE Trans. Emerg. Topics Comput. Intell., 1\u201315 (2022). https:\/\/ieeexplore.ieee.org\/document\/9679820"},{"key":"15_CR26","unstructured":"McAuley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS (2012)"},{"key":"15_CR27","unstructured":"Newman, M.: Networks. Oxford University Press, New York (2018)"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Peixoto, T.P.: Nonparametric Bayesian inference of the microcanonical stochastic block model. Phys. Rev. E 95(1), 012317 (2017)","DOI":"10.1103\/PhysRevE.95.012317"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Richardson, M., Agrawal, R., Domingos, P.M.: Trust management for the semantic web. In: SEMWEB (2003)","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Davies, R., Sarkar, R., Sutton, C.: GEMSEC: graph embedding with self clustering. In: ASONAM, pp. 65\u201372 (2019)","DOI":"10.1145\/3341161.3342890"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: CIKM, pp. 1325\u20131334 (2020)","DOI":"10.1145\/3340531.3411866"},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag, V.A., Waltman, L., van Eck, N.J.: From Louvain to Leiden: guaranteeing well-connected communities. Sci. Rep. 9, 5233 (2019)","journal-title":"Sci. Rep."},{"key":"15_CR33","unstructured":"Wang, C., Zhao, J., Li, L., Jiao, L., Liu, J., Wu, K.: A multi-transformation evolutionary framework for influence maximization in social networks. arXiv preprint arXiv:2204.03297 (2022)"},{"key":"15_CR34","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang, C., Chen, W., Wang, Y.: Scalable influence maximization for independent cascade model in large-scale social networks. Data Min. Knowl. Disc. 25, 545\u2013576 (2012)","journal-title":"Data Min. Knowl. Disc."},{"issue":"3","key":"15_CR35","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10589-017-9958-x","volume":"69","author":"HH Wu","year":"2017","unstructured":"Wu, H.H., K\u00fc\u00e7\u00fckyavuz, S.: A two-stage stochastic programming approach for influence maximization in social networks. Comput. Optim. Appl. 69(3), 563\u2013595 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9958-x","journal-title":"Comput. Optim. Appl."},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292\u2013301. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056872"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:49:14Z","timestamp":1710262154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}