activity
20152024
most citedEquimatchable factor-critical graphs and independence number 2

2 citations · 5 across the 8 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2023★ 1 cited

Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source

Argyrios Deligkas, Michelle Döring, Eduard Eiben +2

We consider the influence maximization problem over a temporal graph, where there is a single fixed source. We deviate from the standard model of influence maximization, where the…