Given a social network with diffusion probabilities as edge weights and a positive integer k,
which k nodes should be chosen for initial injection of information to maximize the influence …

In the present trend of having an explosive use of smartphones and IoT-based devices,
there is an exponential growth in mobile data. It has already caused an overburden of …

We consider opinion diffusion in binary influence networks, where at each step one or more
agents update their opinions so as to be in agreement with the majority of their neighbors …

Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central
topic of study in parameterized complexity. A main aim of research in this area is to …

We study the problem of maintaining large replicated collections of files or documents in a
distributed environment with limited bandwidth. This problem arises in a number of important …

Abstract Target Set Selection, which is a prominent NP-hard problem occurring in social
network analysis and distributed computing, is notoriously hard both in terms of achieving …

Modern traceability technologies promise to improve supply chain management by
simplifying recalls, increasing visibility, and verifying sustainable supplier practices …

Identifying the most influential spreaders is an important issue for the study of the dynamics
of information diffusion in complex networks. In this paper we analyze the following …

We study opinion diffusion on social graphs where agents hold binary opinions and where
social pressure leads them to conform to the opinion manifested by the majority of their …

Once having classified an NP-hard problem fixed-parameter tractable with respect to a
certain parameter, the race for the most efficient fixed-parameter algorithm starts. Herein, the …