{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T18:30:39Z","timestamp":1775932239460,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,6]]},"DOI":"10.1145\/3625007.3627293","type":"proceedings-article","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:12:42Z","timestamp":1710515562000},"page":"237-244","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Maximizing Influence with Graph Neural Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7731-9448","authenticated-orcid":false,"given":"George","family":"Panagopoulos","sequence":"first","affiliation":[{"name":"Ecole Polytechnique, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2175-2610","authenticated-orcid":false,"given":"Nikolaos","family":"Tziortziotis","sequence":"additional","affiliation":[{"name":"Jellyfish, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5923-4440","authenticated-orcid":false,"given":"Michalis","family":"Vazirgiannis","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8770-3969","authenticated-orcid":false,"given":"Fragkiskos","family":"Malliaros","sequence":"additional","affiliation":[{"name":"Centrale Supelec, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2024,3,15]]},"reference":[{"issue":"4","key":"e_1_3_2_1_1_1","first-page":"1298","article-title":"Planning paths for package delivery in heterogeneous multirobot teams","volume":"12","author":"Mathew N.","year":"2015","unstructured":"N. Mathew, S. L. Smith, and S. L. Waslander, \"Planning paths for package delivery in heterogeneous multirobot teams,\" IEEE T-ASE, vol. 12, no. 4, pp. 1298--1308, 2015.","journal-title":"IEEE T-ASE"},{"issue":"5","key":"e_1_3_2_1_2_1","first-page":"738","article-title":"Combinatorial optimization for electric vehicles management","volume":"6","author":"Touati-Moungla N.","year":"2012","unstructured":"N. Touati-Moungla and V. Jost, \"Combinatorial optimization for electric vehicles management,\" Journal of Energy and Power Engineering, vol. 6, no. 5, pp. 738--743, 2012.","journal-title":"Journal of Energy and Power Engineering"},{"key":"e_1_3_2_1_3_1","volume-title":"Reinforcement learning: An introduction","author":"Sutton R. S.","year":"2018","unstructured":"R. S. Sutton and A. G. Barto, Reinforcement learning: An introduction. MIT press, 2018."},{"key":"e_1_3_2_1_4_1","volume-title":"On learning paradigms for the travelling salesman problem,\" CoRR","author":"Joshi C. K.","year":"2019","unstructured":"C. K. Joshi, T. Laurent, and X. Bresson, \"On learning paradigms for the travelling salesman problem,\" CoRR, 2019."},{"key":"e_1_3_2_1_5_1","volume-title":"Attention, learn to solve routing problems!\" in ICLR","author":"Kool W.","year":"2019","unstructured":"W. Kool, H. Van Hoof, and M. Welling, \"Attention, learn to solve routing problems!\" in ICLR, 2019."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"D. Kempe J. Kleinberg and \u00c9. Tardos \"Maximizing the spread of influence through a social network \" in KDD 2003.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0262-1"},{"issue":"3","key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","first-page":"034316","DOI":"10.1103\/PhysRevE.106.034316","article-title":"Unifying information propagation models on networks and influence maximization","volume":"106","author":"Tian Y.","year":"2022","unstructured":"Y. Tian and R. Lambiotte, \"Unifying information propagation models on networks and influence maximization,\" Physical Review E, vol. 106, no. 3, p. 034316, 2022.","journal-title":"Physical Review E"},{"key":"e_1_3_2_1_9_1","volume-title":"Influence maximization in near-linear time: A martingale approach,\" in SIGMOD","author":"Tang Y.","year":"2015","unstructured":"Y. Tang, Y. Shi, and X. Xiao, \"Influence maximization in near-linear time: A martingale approach,\" in SIGMOD, 2015."},{"key":"e_1_3_2_1_10_1","volume-title":"Efficient influence maximization in social networks,\" in SIGKDD","author":"Chen W.","year":"2009","unstructured":"W. Chen, Y. Wang, and S. Yang, \"Efficient influence maximization in social networks,\" in SIGKDD, 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-020-00117-1"},{"key":"e_1_3_2_1_12_1","volume-title":"Cost-effective outbreak detection in networks,\" in KDD","author":"Leskovec J.","year":"2007","unstructured":"J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, \"Cost-effective outbreak detection in networks,\" in KDD, 2007."},{"key":"e_1_3_2_1_13_1","volume-title":"Pointer networks,\" in NeurIPS","author":"Vinyals O.","year":"2015","unstructured":"O. Vinyals, M. Fortunato, and N. Jaitly, \"Pointer networks,\" in NeurIPS, 2015."},{"key":"e_1_3_2_1_14_1","volume-title":"Neural combinatorial optimization with reinforcement learning,\" in ICLR","author":"Bello I.","year":"2017","unstructured":"I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, \"Neural combinatorial optimization with reinforcement learning,\" in ICLR, 2017."},{"key":"e_1_3_2_1_15_1","volume-title":"Learning combinatorial optimization algorithms over graphs,\" CoRR","author":"Dai H.","year":"2017","unstructured":"H. Dai, E. B. Khalil, Y. Zhang, B. Dilkina, and L. Song, \"Learning combinatorial optimization algorithms over graphs,\" CoRR, 2017."},{"key":"e_1_3_2_1_16_1","first-page":"1","article-title":"Finding key players in complex networks through deep reinforcement learning","author":"Fan C.","year":"2020","unstructured":"C. Fan, L. Zeng, Y. Sun, and Y.-Y. Liu, \"Finding key players in complex networks through deep reinforcement learning,\" Nature Machine Intelligence, pp. 1--8, 2020.","journal-title":"Nature Machine Intelligence"},{"key":"e_1_3_2_1_17_1","volume-title":"Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs,\" in NeurIPS","author":"Manchanda S.","year":"2020","unstructured":"S. Manchanda, A. Mittal, A. Dhawan, S. Medya, S. Ranu, and A. Singh, \"Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs,\" in NeurIPS, 2020."},{"key":"e_1_3_2_1_18_1","volume-title":"Deepis: Susceptibility estimation on social networks,\" in WSDM","author":"Xia W.","year":"2021","unstructured":"W. Xia, Y. Li, J. Wu, and S. Li, \"Deepis: Susceptibility estimation on social networks,\" in WSDM, 2021."},{"key":"e_1_3_2_1_19_1","volume-title":"Learning to make decisions via submodular regularization,\" in ICLR","author":"Alieva A.","year":"2020","unstructured":"A. Alieva, A. Aceves, J. Song, S. Mayo, Y. Yue, and Y. Chen, \"Learning to make decisions via submodular regularization,\" in ICLR, 2020."},{"key":"e_1_3_2_1_20_1","first-page":"392","article-title":"Diffugreedy: An influence maximization algorithm based on diffusion cascades","author":"Panagopoulos G.","year":"2018","unstructured":"G. Panagopoulos, F. D. Malliaros, and M. Vazirgiannis, \"Diffugreedy: An influence maximization algorithm based on diffusion cascades,\" in Complex Networks, 2018, pp. 392--404.","journal-title":"Complex Networks"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1609\/icwsm.v14i1.7319","article-title":"Influence maximization using influence and susceptibility embeddings","author":"Panagopoulos G.","year":"2020","unstructured":"G. Panagopoulos, F. D. Malliaros, and M. Vazirgianis, \"Influence maximization using influence and susceptibility embeddings,\" in ICWSM, 2020, pp. 511--521.","journal-title":"ICWSM"},{"key":"e_1_3_2_1_22_1","volume-title":"Scalable influence estimation without sampling,\" CoRR","author":"Lokhov A. Y.","year":"2019","unstructured":"A. Y. Lokhov and D. Saad, \"Scalable influence estimation without sampling,\" CoRR, 2019."},{"key":"e_1_3_2_1_23_1","volume-title":"Adaptive influence maximization,\" in KDD","author":"Cautis B.","year":"2019","unstructured":"B. Cautis, S. Maniu, and N. Tziortziotis, \"Adaptive influence maximization,\" in KDD, 2019."},{"key":"e_1_3_2_1_24_1","volume-title":"Combinatorial optimization with graph convolutional networks and guided tree search,\" CoRR","author":"Li Z.","year":"2018","unstructured":"Z. Li, Q. Chen, and V. Koltun, \"Combinatorial optimization with graph convolutional networks and guided tree search,\" CoRR, 2018."},{"issue":"10","key":"e_1_3_2_1_25_1","first-page":"2770","article-title":"On the upper bounds of spread for greedy algorithms in social network influence maximization","volume":"27","author":"Zhou C.","year":"2015","unstructured":"C. Zhou, P. Zhang, W. Zang, and L. Guo, \"On the upper bounds of spread for greedy algorithms in social network influence maximization,\" IEEE TKDE, vol. 27, no. 10, pp. 2770--2783, 2015.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2208436.2208448"},{"key":"e_1_3_2_1_27_1","volume-title":"Emergence of scaling in random networks,\" science","author":"Barab\u00e1si A.-L.","unstructured":"A.-L. Barab\u00e1si and R. Albert, \"Emergence of scaling in random networks,\" science, vol. 286, no. 5439, pp. 509--512, 1999."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.026107"},{"key":"e_1_3_2_1_29_1","volume-title":"Multi-task learning for influence estimation and maximization,\" IEEE TKDE","author":"Panagopoulos G.","year":"2020","unstructured":"G. Panagopoulos, F. Malliaros, and M. Vazirgiannis, \"Multi-task learning for influence estimation and maximization,\" IEEE TKDE, 2020."},{"key":"e_1_3_2_1_30_1","volume-title":"Irie: Scalable and robust influence maximization in social networks,\" in ICDM","author":"Jung K.","year":"2012","unstructured":"K. Jung, W. Heo, and W. Chen, \"Irie: Scalable and robust influence maximization in social networks,\" in ICDM, 2012."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"issue":"1","key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40649-016-0033-z","article-title":"Real-time topic-aware influence maximization using preprocessing","volume":"3","author":"Chen W.","year":"2016","unstructured":"W. Chen, T. Lin, and C. Yang, \"Real-time topic-aware influence maximization using preprocessing,\" Computational social networks, vol. 3, no. 1, pp. 1--19, 2016.","journal-title":"Computational social networks"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"event":{"name":"ASONAM '23: International Conference on Advances in Social Networks Analysis and Mining","location":"Kusadasi Turkiye","acronym":"ASONAM '23","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"]},"container-title":["Proceedings of the International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625007.3627293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3625007.3627293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:48Z","timestamp":1750178808000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3625007.3627293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":33,"alternative-id":["10.1145\/3625007.3627293","10.1145\/3625007"],"URL":"https:\/\/doi.org\/10.1145\/3625007.3627293","relation":{},"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"2024-03-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}