activity
20112018
most citedHow to go Viral: Cheaply and Quickly

4 citations · 6 across the 7 of their papers we have counts for

collaborators

7 papers

cs.DS2018

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…

cs.SI2015

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…

cs.DS2015

Efficiently Testing T-Interval Connectivity in Dynamic Graphs

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz +1

Many types of dynamic networks are made up of durable entities whose links evolve over time. When considered from a {\em global} and {\em discrete} standpoint, these networks are o…

cs.DM2015★ 1 cited

An Algebra to Merge Heterogeneous Classifiers

Philippe J. Giabbanelli, Joseph G. Peters

In distributed classification, each learner observes its environment and deduces a classifier. As a learner has only a local view of its environment, classifiers can be exchanged a…

cs.SI2014★ 4 cited

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 …

cs.DS2013

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/…

cs.DC2011★ 1 cited

Consensus vs Broadcast in Communication Networks with Arbitrary Mobile Omission Faults

Emmanuel Godard, Joseph Peters

We compare the solvability of the Consensus and Broadcast problems in synchronous communication networks in which the delivery of messages is not reliable. The failure model is the…