| 2005 | Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. | Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco |
| 2005 | Biangular Circle Formation by Asynchronous Mobile Robots. | Branislav Katreniak |
| 2005 | An Improved Algorithm for Adaptive Condition-Based Consensus. | Taisuke Izumi, Toshimitsu Masuzawa |
| 2005 | Communications in Unknown Networks: Preserving the Secret of Topology. | Markus Hinkelmann, Andreas Jakoby |
| 2005 | Distributed Data Structures: A Survey. | Cyril Gavoille |
| 2005 | Space Lower Bounds for Graph Exploration via Reduced Automata. | Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sbastien Tixeuil |
| 2005 | Finding Short Right-Hand-on-the-Wall Walks in Graphs. | Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung |
| 2005 | Two Absolute Bounds for Distributed Bit Complexity. | Yefim Dinitz, Noam Solomon |
| 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 | A Tight Bound for Online Coloring of Disk Graphs. | Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou |
| 2005 | On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). | Tiziana Calamoneri, Paola Vocca |
| 2005 | Range Augmentation Problems in Static Ad-Hoc Wireless Networks. | Davide Bil, Guido Proietti |
| 2005 | Traffic Grooming on the Path. | Jean-Claude Bermond, Laurent Braud, David Coudert |
| 2005 | On Private Computation in Incomplete Networks. | Amos Beimel |
| 2005 | Cellular Networks: Where Are the Mobile Users? | Amotz Bar-Noy |
| 2005 | On Designing Truthful Mechanisms for Online Scheduling. | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano |
| 2004 | The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces. | Deshi Ye, Hu Zhang |
| 2004 | On-Line Scheduling of Parallel Jobs. | Deshi Ye, Guochuan Zhang |
| 2004 | NP-Completeness Results for All-Shortest-Path Interval Routing. | Rui Wang, Francis C. M. Lau, Yan Yan Liu |
| 2004 | Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. | Aleksej Di Salvo, Guido Proietti |
| 2004 | Sharing the Cost of Multicast Transmissions in Wireless Networks. | Paolo Penna, Carmine Ventre |
| 2004 | Optimal Decision Strategies in Byzantine Environments. | Michel Paquette, Andrzej Pelc |
| 2004 | Approximation Algorithm for Hotlink Assignment in the Greedy Model. | Rachel Matichin, David Peleg |
| 2004 | Perfect Token Distribution on Trees. | Luciano Margara, Alessandro Pistocchi, Marco Vassura |