8 citations · 10 across the 5 of their papers we have counts for
15 papers
Finding single-source shortest -disjoint paths: fast computation and sparse preservers
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà +3
Let be a directed graph with vertices, edges, and non-negative edge costs. Given , a fixed source vertex , and a positive integer , we consider the problem of…
When Can Liquid Democracy Unveil the Truth?
Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz +1
In this paper, we investigate the so-called ODP-problem that has been formulated by Caragiannis and Micha [10]. Here, we are in a setting with two election alternatives out of whic…
Group-Harmonic and Group-Closeness Maximization -- Approximation and Engineering
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo +3
Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing cen…
Fairness in Influence Maximization through Randomization
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi +1
The influence maximization paradigm has been used by researchers in various fields in order to study how information spreads in social networks. While previously the attention was…
Multi-Winner Election Control via Social Influence
Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo
In an election, we are given a set of voters, each having a preference list over a set of candidates, that are distributed on a social network. We consider a scenario where voters…
Maximizing Influence-based Group Shapley Centrality
Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
One key problem in network analysis is the so-called influence maximization problem, which consists in finding a set of at most seed users, in a social network, maximizing…