{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:43Z","timestamp":1759335583397,"version":"3.37.3"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"PRIN 2017 Project","award":["2017S559BB"],"award-info":[{"award-number":["2017S559BB"]}]},{"name":"French National Science Foundation ANR","award":["ANR-18-CE40-0010"],"award-info":[{"award-number":["ANR-18-CE40-0010"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1109\/tcns.2022.3163665","type":"journal-article","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:52:40Z","timestamp":1648669960000},"page":"1189-1201","source":"Crossref","is-referenced-by-count":6,"title":["Graph Structure-Based Heuristics for Optimal Targeting in Social Networks"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8870-7008","authenticated-orcid":false,"given":"Massimo","family":"Bini","sequence":"first","affiliation":[{"name":"Bosch Industry-on-Campus Lab, University of Tübingen, Tübingen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0962-3119","authenticated-orcid":false,"given":"Paolo","family":"Frasca","sequence":"additional","affiliation":[{"name":"Université Grenoble Alpes, CNRS, Inria, Grenoble INP, GIPSA-lab, Grenoble, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3186-6195","authenticated-orcid":false,"given":"Chiara","family":"Ravazzi","sequence":"additional","affiliation":[{"name":"Institute of Electronics, Computer and Telecommunication Engineering, National Research Council of Italy (CNR-IEIIT), c\/o Politecnico di Torino, Corso Duca Degli Abruzzi, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2258-8971","authenticated-orcid":false,"given":"Fabrizio","family":"Dabbene","sequence":"additional","affiliation":[{"name":"Institute of Electronics, Computer and Telecommunication Engineering, National Research Council of Italy (CNR-IEIIT), c\/o Politecnico di Torino, Corso Duca Degli Abruzzi, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19656-0_3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2538508"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2850287"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0853"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2021.3058620"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2017.03.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2018.03.005"},{"issue":"1-2","key":"ref9","first-page":"1","article-title":"${L}x=b$ Laplacian solvers and their algorithmic applications","volume":"8","author":"Vishnoi","year":"2012","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2304870"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2792401"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2285509"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1037\/h0046123"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1515\/9781400835355"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"article-title":"Optimal targeting in social networks","year":"2020","author":"Bini","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2307\/2224214"},{"article-title":"Some implications of local weak convergence for sparse random graphs","year":"2011","author":"Salez","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09444-0_1"}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6509490\/9894848\/9745381-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6509490\/9894848\/09745381.pdf?arnumber=9745381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:29:02Z","timestamp":1705537742000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9745381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":20,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2022.3163665","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"type":"electronic","value":"2325-5870"},{"type":"electronic","value":"2372-2533"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}