activity
20222026
most citedBeing an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source

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

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

Parameterized Complexity of Temporal Connected Components

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

We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, that is, graphs whose edges are available only at specific points in time.…

cs.DS2022

The Parameterized Complexity of Welfare Guarantees in Schelling Segregation

Argyrios Deligkas, Eduard Eiben, Tiger-Lily Goldsmith

Schelling's model considers types of agents each of whom needs to select a vertex on an undirected graph, where every agent prefers to neighbor agents of the same type. We are…