2 citations · 2 across the 4 of their papers we have counts for
4 papers
Structural Lemmas on Temporal Connectivity
Daniele Carnevale, Arnaud Casteigts, David Schindl
This paper presents several lemmas on the structure of temporal connectivity in temporal graphs. Some of these lemmas are adapted from the literature on gossip from the 70-90's and…
Minimum Temporal Spanners in Happy Graphs
Arnaud Casteigts, Hendrik Molter, Michelle Döring +1
Temporal graphs are graphs whose edge set changes over discrete time steps. These graphs can model scenarios related to transportation, scheduling, social networks, and networking…
On the Hardness of Finding Temporally Connected Subgraphs of Any Size
Arnaud Casteigts, Christian Komusiewicz, Nils Morawietz
Temporal graphs are graphs whose edges are present only at certain points in time. Reachability in these graphs is defined via temporal paths, in which edges are traversed in incre…
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
Arnaud Casteigts, Serge Chaumette, Afonso Ferreira
Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at the assumptions they make on the underlying network. W…