| 2005 | A Tight Bound for Online Coloring of Disk Graphs. Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou |
| 2005 | An Improved Algorithm for Adaptive Condition-Based Consensus. Taisuke Izumi, Toshimitsu Masuzawa |
| 2005 | Biangular Circle Formation by Asynchronous Mobile Robots. Branislav Katreniak |
| 2005 | Cellular Networks: Where Are the Mobile Users? Amotz Bar-Noy |
| 2005 | Communications in Unknown Networks: Preserving the Secret of Topology. Markus Hinkelmann, Andreas Jakoby |
| 2005 | Distributed Data Structures: A Survey. Cyril Gavoille |
| 2005 | Distributed Exploration of an Unknown Graph. Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro |
| 2005 | Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri |
| 2005 | Finding Short Right-Hand-on-the-Wall Walks in Graphs. Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2005 | Free-Riders in Steiner Tree Cost-Sharing Games. Paolo Penna, Carmine Ventre |
| 2005 | Geometric Routing Without Geometry. Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer |
| 2005 | Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco |
| 2005 | Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. Nicola Santoro, Peter Widmayer |
| 2005 | Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. Mordechai Shalom, Shmuel Zaks |
| 2005 | On Designing Truthful Mechanisms for Online Scheduling. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano |
| 2005 | On Private Computation in Incomplete Networks. Amos Beimel |
| 2005 | On Semi-perfect 1-Factorizations. Rastislav Kralovic, Richard Královic |
| 2005 | On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). Tiziana Calamoneri, Paola Vocca |
| 2005 | On the Feasibility of Gathering by Autonomous Mobile Robots. Giuseppe Prencipe |
| 2005 | Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets. Rui Wang, Francis C. M. Lau |
| 2005 | Range Augmentation Problems in Static Ad-Hoc Wireless Networks. Davide Bilò, Guido Proietti |
| 2005 | Space Lower Bounds for Graph Exploration via Reduced Automata. Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil |
| 2005 | Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings Andrzej Pelc, Michel Raynal |
| 2005 | Traffic Grooming on the Path. Jean-Claude Bermond, Laurent Braud, David Coudert |
| 2005 | Two Absolute Bounds for Distributed Bit Complexity. Yefim Dinitz, Noam Solomon |