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

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

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2024

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

Argyrios Deligkas, Eduard Eiben, Robert Ganian +2

We study the parameterized complexity of a generalization of the coordinated motion planning problem on graphs, where the goal is to route a specified subset of a given set of …

cs.DM2023

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem

Argyrios Deligkas, Eduard Eiben, Gregory Gutin +2

We introduce and study a new optimization problem on digraphs, termed Maximum Weighted Digraph Partition (MWDP) problem. We prove three complexity dichotomies for MWDP: on arbitrar…