A graph whose edges only appear at certain points in time is called a temporal graph
(among other names). These graphs are temporally connected if all pairs of vertices are …

Low orbit satellite constellation as a relay network provides a possible solution for remote
real-time data gathering applications, in which freshness information updates will be …

We address the problem of testing whether a given dynamic graph is temporally
connected,{\it ie} a temporal path (also called a {\em journey}) exists between all pairs of …

We model the problem of channel assignment in mobile networks as one of temporal
coloring (T-coloring), that is, coloring a time-varying graph. In order to capture the impact of …

Precise detection and identification of anomalous events in IP traffic are crucial in many
applications. This paper intends to address this task by adopting the link stream formalism …

This document is the first part of the author's habilitation thesis (HDR), defended on June 4,
2018 at the University of Bordeaux. Given the nature of this document, the contributions that …

For a long time, researchers have worked on defining different metrics able to characterize
the importance of nodes in static networks. Recently, researchers have introduced …

Most disruption-tolerant networking protocols focus on mere contact and intercontact
characteristics to make forwarding decisions. We propose to relax such a simplistic …

Hop count limitation helps controlling the spread of messages as well as the protocol
complexity and overhead in a distributed network. For a mobile opportunistic network, we …

We define a generalization of local distributed graph problems to (synchronous round-
based) dynamic networks and present a framework for developing algorithms for these …