|
 8.30-9.30
am:
Invited speaker : Amotz Bar-Noy (CUNY,
New York)
Cellular Networks: Where are the Mobile Users?
9.30-10.30
am: 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
10.30-11.00
am: break
11.00-12.30
pm: 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
12.30-2.30
pm:
lunch
2.30-4.00
pm: 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
4.00-4.30
pm:
break
4.30-5.30
pm: 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
7.00-8.30
pm:
private visit of the Mont Saint-Michel abbey
8.30
pm: dinner
|
