Fixed-parameter algorithms and kernelization are two powerful methods to solve NP-hard
problems. Yet so far those algorithms have been largely restricted to static inputs. In this …

We consider the problem of inferring the local transition functions of discrete dynamical
systems from observed behavior. Our focus is on synchronous systems whose local …

The last decade witnessed an increased interest in exact and parameterized exponential-
time algorithms for NP-hard problems. The hardness of polynomial-time approximation of …

Parallel machine scheduling has been extensively studied in the past decades, with
applications ranging from production planning to job processing in large computing clusters …

The main challenge in viral marketing, that is powered by social networks, is to minimize the
seed set that will initiate the diffusion process and maximize the total influence at its …

We introduce a dynamic version of the graph coloring problem and prove its fixed-parameter
tractability with respect to the edit-parameter. This is used to present a {\em turbo-charged} …

The main challenge in viral marketing, that is powered by social networks, is to minimize the
seed set that will initiate the diffusion process and maximize the total influence at its …

The study of how fast advertisements and ideas propagate across a social network started to
gain notable attention recently. In this context, the notion of an influencer has been …

We launch a study on the dynamic form of the graph coloring problem proving it to be fixed-
parameter tractable with respect to the edit-parameter. This leads us to present a new turbo …