66 citations · 91 across the 15 of their papers we have counts for
18 papers
Parameterized Complexity of Immunization in the Threshold Model
Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno
We consider the problem of controlling the spread of harmful items in networks, such as the contagion proliferation of diseases or the diffusion of fake news. We assume the linear…
Iterated Type Partitions
Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno
This paper deals with the complexity of some natural graph problems when parametrized by {measures that are restrictions of} clique-width, such as modular-width and neighborhood di…
Minimum--Entropy Couplings and their Applications
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Given two discrete random variables and with probability distributions and , respectively, denote by ${\cal C}({…
Time-Bounded Influence Diffusion with Incentives
Gennaro Cordasco, Luisa Gargano, Joseph Peters +2
A widely studied model of influence diffusion in social networks represents the network as a graph with an influence threshold for each node. Initially the members…
Bounds on the Entropy of a Function of a Random Variable and their Applications
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
It is well known that the entropy of a discrete random variable is always greater than or equal to the entropy of a function of , with equality if and o…
vs.
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
It is well known that the entropy of a finite random variable is always greater or equal to the entropy of a function of , with equality if and only if …
How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals
Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro
Given two discrete random variables and , with probability distributions and , respectively, denote by ${\cal C}(…
Evangelism in Social Networks: Algorithms and Complexity
Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno +1
We consider a population of interconnected individuals that, with respect to a piece of information, at each time instant can be subdivided into three (time-dependent) categories:…
On Finding Small Sets that Influence Large Networks
Gennaro Cordasco, Luisa Gargano, Adele Anna Rescigno
We consider the problem of selecting a minimum size subset of nodes in a network, that allows to activate all the nodes of the network. We present a fast and simple algorithm that,…
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm
Gennaro Cordasco, Luisa Gargano, Marco Mecchia +2
Given a network represented by a graph , we consider a dynamical process of influence diffusion in that evolves as follows: Initially only the nodes of a given $S\subs…
Optimizing Spread of Influence in Weighted Social Networks via Partial Incentives
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno +1
A widely studied process of influence diffusion in social networks posits that the dynamics of influence diffusion evolves as follows: Given a graph , representing the net…
Spread of Influence in Weighted Networks under Time and Budget Constraints
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +3
Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading from S in G, within a…
How to go Viral: Cheaply and Quickly
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +3
Given a social network represented by a graph , we consider the problem of finding a bounded cardinality set of nodes with the property that the influence spreading from …
Influence Diffusion in Social Networks under Time Window Constraints
Luisa Gargano, Pavol Hell, Joseph G. Peters +1
We study a combinatorial model of the spread of influence in networks that generalizes existing schemata recently proposed in the literature. In our model, agents change behaviors/…
Latency-Bounded Target Set Selection in Social Networks
Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano +2
Motivated by applications in sociology, economy and medicine, we study variants of the Target Set Selection problem, first proposed by Kempe, Kleinberg and Tardos. In our scenario…
Minimum Weight Dynamo and Fast Opinion Spreading
Sara Brunetti, Gennaro Cordasco, Luisa Gargano +2
We consider the following multi--level opinion spreading model on networks. Initially, each node gets a weight from the set [0..k-1], where such a weight stands for the individuals…
Strong Conflict-Free Coloring of Intervals
Luisa Gargano, Adele A. Rescigno
We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the colo…
Community Detection via Semi-Synchronous Label Propagation Algorithms
Gennaro Cordasco, Luisa Gargano
A recently introduced novel community detection strategy is based on a label propagation algorithm (LPA) which uses the diffusion of information in the network to identify communit…