1. Maurice Herlihy, Yossi Lev, Victor Luchangco and Nir Shavit. A Simple Optimistic skip-list Algorithm

2. Asaf Efrima and David Peleg. Distributed algorithms for partitioning a swarm of autonomous mobile robots

3. Iztok Banic and Janez Zerovnik. Edge fault-diameter of Cartesian product of graphs

4. Amos Korman and Shay Kutten. Labeling Schemes with Queries

5. Victor Chepoi, Tristan Fèvat, Emmanuel Godard and Yann Vaxèes. A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives

6. Guy Even, Tamir Levi and Ami Litman. Optimal Conclusive Sets for Comparator Networks

7. Miroslaw Dynia, Jakub Lopuszanski and Christian Schindelhauer. Why Robots Need Maps

8. George Karakostas, Taeyon Kim, Hao Xia and Anastasios Viglas. Selfish routing with oblivious users

9. Mathieu Couture, Michel Barbeau, Prosenjit Bose, Evangelos Kranakis and Paz Carmi. Location Oblivious Distributed Unit Disk Graph Coloring

10. Achour Mosteafoui, Michel Raynal and Corentin TRAVERS. From Renaming to Set Agreement

11. Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa. Optimal Moves for Gossiping among Mobile Agents

12. Yoshiaki Katayama, Yuichi Tomida, Hiroyuki Imazu, Nobuhiro Inuzuka and Koichi Wada. Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots

13. Leszek Gasieniec, Ralf Klasing, Russel A. Martin, Alfredo Navarra and Xiaohui Zhang. Fast Periodic Graph Exploration with Constant Memory

14. Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie and Andrea Vitaletti. Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs

15. Fredrik Manne, Morten Mjelde, Laurence Pilard and Sebastien Tixeuil. A New Self-Stabilizing Maximal Matching Algorithm

16. David Soguet and Nicolas NISSE. Graph searching with advice

17. Hajo Broersma, Matthew Johnson and Daniel Paulusma. Upper bounds and algorithms for parallel knock-out numbers

18. Rastislav Kralovic and Richard Kralovic. Rapid Almost-Complete Broadcasting in Faulty Networks

19. Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny and Jorge Urrutia. Local Edge Colouring of Yao-like Subgraphs of Unit Disk Graphs

20. Shantanu Das, Paola Flocchini, Nicola Santoro and Masafumi Yamashita. Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents

21. Tiziana Calamoneri, Emanuele Guido Fusco, Anil Shende and Sunil Shende. Proxy Assignments for Filling Gaps in Wireless Ad-hoc Lattice Computers

22. Jean-Claude Bermond, Frederic Giroire and Stephane Perennes. Design of Minimal Fault Tolerant On-Board Networks: practical constructions

23. Yoann Dieudonnè and Franck Petit. Swing Words to Make Circle Formation Quiescent