Dagstuhl Presentations
(in alphabetical order of surname of presenter)
Final Programme
Parsimonious Flooding in Dynamic Graphs
Introducing Speed in Population Protocols
On the Analysis of Graphs Evolving over Time Data
Model, and Algorithm Challenges
Efficient Randomized Broadcasting in Sparse Random
Networks
Path Splicing with Guaranteed Fault Tolerance
Universal Spatial Gossip Protocols
Time and Space Efficient Distributed Anonymous Graph
Exploration
Using Swap Edges to Bypass Transient Edge Failures
SINR Scheduling Algorithms
Derandomizing Random Walks in Undirected Graphs Using
Locally Fair Exploration Strategies
On population protocols when population goes to infinity
Dynamic contention resolution on a multiple access
channel
Robust sequencing on a single machine
Spatial Node Distribution of Manhattan Path Based
Random Waypoint Mobility Models
Finding Similar Users in Social Networks
Information Spreading in Dynamic Networks
Private Capacities in Mechanism Design
Information Processing by Mobile Agents in Networks
Dynamic Adaptation with Mutable Protocols
On the Expansion and Diameter of Bluetooth-Like
Topologies
Overnesia: an Overlay Network for Virtual Super-Peers
Competitive Buffer Management with Packet Dependencies
Non clairvoyant scheduling with precedence constraints
Self-Stabilizing Overlay Networks
Relocation Analysis of Stabilizing MAC Algorithmsfor
Large-Scale Mobile Ad Hoc Networks
Nash Equlibria in Searching Games
Mediated Population Protocols
Clock Synchronization