8 citations · 12 across the 13 of their papers we have counts for
26 papers
A Reflection Calculus for Bar Induction and the Linearity of Consistency Strength Ordering
Fedor Pakhomov, Vlad Lazar
We introduce a novel extension of reflection calculus, , to analyze a family of extensions of generated by uniform -model and syntactic reflec…
An Approximation Algorithm for the Connected Maximum Coverage Problem in Directed Graphs
Gianlorenzo D'Angelo, Esmaeil Delfaraz
In the Directed rooted Connected Budgeted maximum Coverage problem (\DRCC), we are given a collection of subsets , defined over a ground set , and a directed graph…
Improving Fairness in Information Exposure by Adding Links
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
Fairness in influence maximization has been a very active research topic recently. Most works in this context study the question of how to find seeding strategies (deterministic or…
On the Cost of Demographic Parity in Influence Maximization
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
Modeling and shaping how information spreads through a network is a major research topic in network analysis. While initially the focus has been mostly on efficiency, recently fair…
Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes
Gianlorenzo D'Angelo, Esmaeil Delfaraz
In the \emph{budgeted rooted node-weighted Steiner tree} problem, we are given a graph with nodes, a predefined node , two weights associated to each node modelling cost…
Sparse Temporal Spanners with Low Stretch
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà +2
A temporal graph is an undirected graph along with a function that assigns a time-label to each edge in . A path in with non-decreasing time-labels is called tempo…
Budgeted Out-tree Maximization with Submodular Prizes
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
We consider a variant of the prize collecting Steiner tree problem in which we are given a \emph{directed graph} , a monotone submodular prize function $p:2^V \rightarrow…
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…
Computation and Bribery of Voting Power in Delegative Simple Games
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Following Zhang and Grossi~(AAAI 2021), we study in more depth a variant of weighted voting games in which agents' weights are induced by a transitive support structure. This class…
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…
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
In the adaptive influence maximization problem, we are given a social network and a budget , and we iteratively select nodes, called seeds, in order to maximize the expected…
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
In the influence maximization (IM) problem, we are given a social network and a budget , and we look for a set of nodes in the network, called seeds, that maximize the expec…
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…
Balancing spreads of influence in a social network
Ruben Becker, Federico Corò, Gianlorenzo D'Angelo +1
The personalization of our news consumption on social media has a tendency to reinforce our pre-existing beliefs instead of balancing our opinions. This finding is a concern for th…
Election Control through Social Influence with Unknown Preferences
Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani +1
The election control problem through social influence asks to find a set of nodes in a social network of voters to be the starters of a political campaign aiming at supporting a gi…
On the fixed-parameter tractability of the maximum connectivity improvement problem
Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan
In the Maximum Connectivity Improvement (MCI) problem, we are given a directed graph and an integer and we are asked to find new edges to be added to in order…
Exploiting Social Influence to Control Elections Based on Scoring Rules
Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo +1
Online social networks are used to diffuse opinions and ideas among users, enabling a faster communication and a wider audience. The way in which opinions are conditioned by social…
Coverage Centrality Maximization in Undirected Networks
Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini
Centrality metrics are among the main tools in social network analysis. Being central for a user of a network leads to several benefits to the user: central users are highly influe…
Generalized budgeted submodular set function maximization
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco +1
In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subse…
Selecting nodes and buying links to maximize the information diffusion in a network
Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
The Independent Cascade Model (ICM) is a widely studied model that aims to capture the dynamics of the information diffusion in social networks and in general complex networks. In…
Recommending links through influence maximization
Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
The link recommendation problem consists in suggesting a set of links to the users of a social network in order to increase their social circles and the connectivity of the network…