|
 8h30-9h30:
Invited speaker : Amotz Bar-Noy (CUNY,
New York)
Cellular Networks: Where are the Mobile Users?
9h30-10h30:
session S1
Yefim Dinitz and Noam Solomon:
Two Absolute Bounds for Distributed Bit Complexity
Taisuke Izumi and Toshimitsu Masuzawa:
An Improved Algorithm for Adaptive Condition-Based Consensus
10h30-11h:
pause
11h00-12h30:
session S2
Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum and Sébastien
Tixeuil:
An Omega (log n) Space Lower Bound for Graph Exploration with
Stop
Ralf Klasing, Euripides Markou, Tomasz Radzik and Fabiano Sarracco:
Hardness and Approximation Results for Black Hole Search in Arbitrary
Graphs
Giuseppe Prencipe:
On the Feasibility of Gathering by Autonomous Mobile Robots
12h30-14h30:
déjeuner
14h30-16h00:
session S3
Tiziana Calamoneri and Paola Vocca:
On the Approximability of the $L(h,k)$-Labelling
Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis
and Evi Papaioannou:
A Tight Bound for Online Coloring of Disk Graphs
Branislav Katreniak:
Biangular circle formation by asynchronous mobile robots
16h00-16h30:
pause
16h30-17h30:
session S4
A. Clementi, M. Di Ianni, M. Lauria, A. Monti , G. Rossi and
R. Silvestri:
Divide et Impera is Almost Optimal for the Bounded-Hop MST Problem
on Random Euclidean Instances
Rui Wang and Francis C. M. Lau:
Optimal Gossiping in Square Meshes in All-Port Mode and with
Short Packets
Mirjam Wattenhofer, Roger Wattenhofer and Peter Widmayer:
Geometric Routing without Geometry
19h-20h30:
visite privée de l'abbaye du Mont Saint-Michel
20h30:
dîner
|
