The power of any kind of network approach lies in the ability to simplify a complex system so
that one can better understand its function as a whole. Sometimes it is beneficial, however …

Elements of the theory of dynamic networks Page 1 72 COMMUNICATIONS OF THE ACM |
FEBRUARY 2018 | VOL. 61 | NO. 2 review articles IMA GE B Y ANITHA DEVI MUR THI A …

The past few years have seen intensive research efforts carried out in some apparently
unrelated areas of dynamic systems–delay-tolerant networks, opportunistic-mobility …

A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …

Distributed Computing Through Combinatorial Topology describes techniques for analyzing
distributed algorithms based on award winning combinatorial topology research. The …

Fault-Tolerant Message-Passing Distributed Systems Page 1 Michel Raynal Fault-Tolerant
Message-Passing Distributed Systems An Algorithmic Approach Page 2 Fault-Tolerant …

The study of dynamic networks has come into popularity recently, and many models and
algorithms for such networks have been suggested. In this column we survey some recent …

The past decade has seen intensive research efforts on highly dynamic wireless and mobile
networks (variously called delay-tolerant, disruptive-tolerant, challenged, opportunistic, etc) …

In this work, we introduce the notion of time to some well-known combinatorial optimization
problems. In particular, we study problems defined on temporal graphs. A temporal graph …

Distributed information processing in biological and computational systems Page 1 94
COMMUNICATIONS OF THE ACM | JANUARY 2015 | VOL. 58 | NO. 1 review articles DOI:10.1145/2678280 …