Accepted Papers

Shiri Chechik and David Peleg. The Fault Tolerant Capacitated k-Center Problem

Iftah Gamzu and Moti Medina. Improved Approximation for Orienting Mixed Graphs

Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco and Luca Moscardelli. Mobile Network Creation Games

Samir Elouasbi and Andrzej Pelc. Time of anonymous rendezvous in trees: Determinism vs. randomization

Michel Raynal and Julien Stainer. Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors

Stéphane Devismes, Pascal Lafourcade, Karine Altisen and Antoine Gerbaud. Analysis of Random Walks using Tabu Lists

Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten and David Peleg. Notions of Connectivity in Overlay Networks

Heger Arfaoui and Pierre Fraigniaud. What can be computed without communications?

Eyjólfur Ingi Ásgeirsson, Magnus M. Halldorsson and Pradipta Mitra. Wireless Network Stability in the SINR Model

Jérémie Chalopin, Métivier Yves and Thomas Morsellino. On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems

Dan Alistarh, Hagit Attiya, Rachid Guerraoui and Corentin Travers. Early Deciding Synchronous Renaming in O( log f ) Rounds or Less

Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing and Alfredo Navarra. Gathering of Robots on Anonymous Grids without multiplicity detection

Ioannis Caragiannis and Christos Kalaitzis. Space lower bounds for low-stretch greedy embeddings

Balasingham Balamohan, Stefan Dobrev, Paola Flocchini and Nicola Santoro. Asynchronous exploration of an unknown anonymous dangerous graph with O(1) pebbles

Henning Hasemann, Juho Hirvonen, Joel Rybicki and Jukka Suomela. Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring

Amotz Bar-Noy, Ben Baumer and Dror Rawitz. Changing of the Guards: Strip Cover with Duty Cycling

Stefan Dobrev, Rastislav Královič and Euripides Markou. Online Graph Exploration with Advice

Martin Biely, Peter Robinson and Ulrich Schmid. Agreement in Directed Dynamic Networks

Evangelos Kranakis, Lata Narayanan, Fraser MacQuarrie, Oscar Morales Ponce and Mohsen Eftekhari Hesari. Strong Connectivity of Sensor Networks with Double Antennae

Giovanni Viglietta, Giuseppe Prencipe and Linda Pagli. Getting Close Without Touching

Peter Pietrzyk, Peter Kling and Friedhelm Meyer Auf der Heide. An Algorithm for Online Facility Leasing

Xavier Vilaça, Oksana Denysyuk and Luis Rodrigues. Asynchrony and Collusion in the N-party BAR Transfer Problem

Majid Khabbazian, Stephane Durocher and Alireza Haghnegahdar. Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position

Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa. Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks

Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan and Francis C.M. Lau. Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model

Vittorio Bilo', Michele Flammini and Vasco Gallotti. On Bidimensional Congestion Games

Andreas Larsson and Philippas Tsigas. Self-stabilizing (k,r)-clustering in Clock Rate-limited Systems

Carole Delporte-Gallet, Hugues Fauconnier and Hung Tran-The. Homonyms with forgeable identifiers