135 citations · 211 across the 20 of their papers we have counts for
6 papers · 1 filter
Multi-Player Diffusion Games on Graph Classes
Laurent Bulteau, Vincent Froese, Nimrod Talmon
We study competitive diffusion games on graphs introduced by Alon et al. [1] to model the spread of influence in social networks. Extending results of Roshanbin [8] for two players…
The Complexity of Finding Effectors
Laurent Bulteau, Stefan Fafianie, Vincent Froese +2
The NP-hard EFFECTORS problem on directed graphs is motivated by applications in network mining, particularly concerning the analysis of probabilistic information-propagation proce…
Computing an Evolutionary Ordering is Hard
Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.
Combinatorial Voter Control in Elections
Laurent Bulteau, Jiehua Chen, Piotr Faliszewski +2
Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who wou…
Triangle counting in dynamic graph streams
Laurent Bulteau, Vincent Froese, Konstantin Kutzkov +1
Estimating the number of triangles in graph streams using a limited amount of memory has become a popular topic in the last decade. Different variations of the problem have been st…
Partitioning Perfect Graphs into Stars
René van Bevern, Robert Bredereck, Laurent Bulteau +4
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size st…