We study the classical Cops and Robber game when the cops and the robber move on an
infinite periodic sequence of graphs on the same set V of n vertices: in round t, the topology …

Temporal graphs (or evolving graphs) are time-varying graphs where time is assumed to be
discrete. In this paper, we consider for the first time the problem of exploring temporal graphs …

A periodic temporal graph $\mathcal {G}=(G_0, G_1,\dots, G_ {p-1})^* $ is an infinite periodic
sequence of graphs $ G_i=(V, E_i) $ where $ G=(V,\cup_i E_i) $ is called the footprint …

We consider, for the first time, the exploration of dynamic graphs of arbitrary unknown
topology. We study the number of agents necessary and sufficient to explore such graphs …

The researches about a mobile entity (called agent) on dynamic networks have attracted a
lot of attention in recent years. Exploration which requires an agent to visit all the nodes in …

In this paper, we consider the partial gathering problem of mobile agents in synchronous
dynamic bidirectional rings. The partial gathering problem is a generalization of the (well …

We examine the problem of gathering k≥ 2 agents (or multi-agent rendezvous) in dynamic
graphs which may change in every round. We consider a variant of the 1-interval …

We consider the Cops and Robber pursuit-evasion game when the edge-set of the graph is
allowed to change in time, possibly at every round. Specifically, the game is played on an …

In this paper, we consider the partial gathering problem of mobile agents in synchronous
dynamic tori. The partial gathering problem is a generalization of the (well-investigated) total …

Mobile agents (agents) are objects which can migrate autonomously in a distributed system
and execute actions at visited nodes. One of the most fundamental problems of agents is …