Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Election Control in Social Networks via Edge Addition or Removal
Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti
Proceedings of the AAAI Conference on Artificial Intelligence (2020) Vol. 34, Iss. 02, pp. 1878-1885
Open Access | Times Cited: 35

Showing 1-25 of 35 citing articles:

Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways
Francesco Fabbri, Yanhao Wang, Francesco Bonchi, et al.
Proceedings of the ACM Web Conference 2022 (2022), pp. 2719-2728
Open Access | Times Cited: 23
Predicting Voting Outcomes for Multi-Alternative Elections in Social Networks
Xiaoxue Liu, Fenghui Ren, Guoxin Su, et al.
IEEE Access (2024) Vol. 12, pp. 98960-98970
Open Access | Times Cited: 2
Identifying and Eliminating Majority Illusion in Social Networks
Umberto Grandi, Lawqueen Kanesh, Grzegorz Lisowski, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2023) Vol. 37, Iss. 4, pp. 5062-5069
Open Access | Times Cited: 6
Cost-effective competition on social networks: A multi-objective optimization perspective
Yilu Liu, Jing Liu, Kai Eivind Wu
Information Sciences (2022) Vol. 620, pp. 31-46
Closed Access | Times Cited: 7
Graph Algorithms and Applications 5
Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
(2006)
Open Access | Times Cited: 15
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases
Mohammad Abouei Mehrizi, Gianlorenzo D’Angelo
Algorithms (2020) Vol. 13, Iss. 10, pp. 251-251
Open Access | Times Cited: 10
Margin of Victory in Tournaments: Structural and Experimental Results
Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong
Proceedings of the AAAI Conference on Artificial Intelligence (2021) Vol. 35, Iss. 6, pp. 5228-5235
Open Access | Times Cited: 8
Persuading Voters in District-based Elections
Matteo Castiglioni, Nicola Gatti
Proceedings of the AAAI Conference on Artificial Intelligence (2021) Vol. 35, Iss. 6, pp. 5244-5251
Open Access | Times Cited: 8
Altruism Design in Networked Public Goods Games
Sixie Yu, David Kempe, Yevgeniy Vorobeychik
(2021), pp. 493-499
Open Access | Times Cited: 8
Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available
Vincenzo Auletta, Diodato Ferraioli, Gianluigi Greco
Theoretical Computer Science (2021) Vol. 869, pp. 156-180
Closed Access | Times Cited: 7
Election Manipulation on Social Networks: Seeding, Edge Removal, Edge Addition
Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti, et al.
Journal of Artificial Intelligence Research (2021) Vol. 71, pp. 1049-1090
Open Access | Times Cited: 7
Margin of victory for tournament solutions
Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong
Artificial Intelligence (2021) Vol. 302, pp. 103600-103600
Open Access | Times Cited: 6
Improving Fairness in Information Exposure by Adding Links
Ruben Becker, Gianlorenzo D’Angelo, Sajjad Ghobadi
Proceedings of the AAAI Conference on Artificial Intelligence (2023) Vol. 37, Iss. 12, pp. 14119-14126
Open Access | Times Cited: 2
Predicting voting outcomes in the presence of communities, echo chambers and multiple parties
Jacques Bara, Omer Lev, Paolo Turrini
Artificial Intelligence (2022) Vol. 312, pp. 103773-103773
Open Access | Times Cited: 4
Adding Edges for Maximizing Weighted Reachability
Federico Corò, Gianlorenzo D’Angelo, Cristina M. Pinotti
Algorithms (2020) Vol. 13, Iss. 3, pp. 68-68
Open Access | Times Cited: 5
Minimum Target Sets in Non-Progressive Threshold Models: When Timing Matters
Hossein Soltani, Ahad N. Zehmakan, Ataabak B. Hushmandi
Frontiers in artificial intelligence and applications (2023)
Open Access | Times Cited: 1
Manipulating Elections by Changing Voter Perceptions
Junlin Wu, Andrew Estornell, Lecheng Kong, et al.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (2022), pp. 557-563
Open Access | Times Cited: 2
Graph Algorithms and Applications 4
Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
WORLD SCIENTIFIC eBooks (2006)
Open Access | Times Cited: 2
Interaction and Expressivity in Collective Decision-Making
Umberto Grandi
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (2022), pp. 5813-5815
Open Access | Times Cited: 1
Graph Algorithms and Applications 3
Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis
(2004)
Open Access | Times Cited: 1
Election Manipulation on Social Networks with Messages on Multiple Candidates Extended Abstract
Matteo Castiglioni, Diodato Ferraioli, Nicola Gatti, et al.
Lecture notes in computer science (2021), pp. 205-211
Closed Access | Times Cited: 1
Altruism Design in Networked Public Goods Games
Sixie Yu, David Kempe, Yevgeniy Vorobeychik
arXiv (Cornell University) (2021)
Open Access | Times Cited: 1
On the Effectiveness of Compact Strategies for Opinion Diffusion in Social Environments
Carlo Adornetto, Valeria Fionda, Gianluigi Greco
Frontiers in artificial intelligence and applications (2023)
Open Access
Information Gerrymandering in Elections
Xiaoxue Liu, Shōhei Kato, Fenghui Ren, et al.
Lecture notes in computer science (2023), pp. 83-97
Closed Access
Page 1 - Next Page

Scroll to top