12. SIROCCO 2005: Mont Saint-Michel, France

• Amotz Bar-Noy:
  Cellular Networks: Where Are the Mobile Users? 1
  Electronic Edition (link) BibTeX
• Cyril Gavoille:
  Distributed Data Structures: A Survey. 2
  Electronic Edition (link) BibTeX
• Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
  On Designing Truthful Mechanisms for Online Scheduling. 3-17
  Electronic Edition (link) BibTeX
• Amos Beimel:
  On Private Computation in Incomplete Networks. 18-33
  Electronic Edition (link) BibTeX
• Jean-Claude Bermond, Laurent Braud, David Coudert:
  Traffic Grooming on the Path. 34-48
  Electronic Edition (link) BibTeX
• Davide Bilò, Guido Proietti:
  Range Augmentation Problems in Static Ad-Hoc Wireless Networks. 49-64
  Electronic Edition (link) BibTeX
• Tiziana Calamoneri, Paola Vocca:
  On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). 65-77
  Electronic Edition (link) BibTeX
• Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
  A Tight Bound for Online Coloring of Disk Graphs. 78-88
  Electronic Edition (link) BibTeX
• Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri:
  Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. 89-98
  Electronic Edition (link) BibTeX
• Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro:
  Distributed Exploration of an Unknown Graph. 99-114
  Electronic Edition (link) BibTeX
• Yefim Dinitz, Noam Solomon:
  Two Absolute Bounds for Distributed Bit Complexity. 115-126
  Electronic Edition (link) BibTeX
• Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
  Finding Short Right-Hand-on-the-Wall Walks in Graphs. 127-139
  Electronic Edition (link) BibTeX
• Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil:
  Space Lower Bounds for Graph Exploration via Reduced Automata. 140-154
  Electronic Edition (link) BibTeX
• Markus Hinkelmann, Andreas Jakoby:
  Communications in Unknown Networks: Preserving the Secret of Topology. 155-169
  Electronic Edition (link) BibTeX
• Taisuke Izumi, Toshimitsu Masuzawa:
  An Improved Algorithm for Adaptive Condition-Based Consensus. 170-184
  Electronic Edition (link) BibTeX
• Branislav Katreniak:
  Biangular Circle Formation by Asynchronous Mobile Robots. 185-199
  Electronic Edition (link) BibTeX
• Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco:
  Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. 200-215
  Electronic Edition (link) BibTeX
• Rastislav Kralovic, Richard Královic:
  On Semi-perfect 1-Factorizations. 216-230
  Electronic Edition (link) BibTeX
• Paolo Penna, Carmine Ventre:
  Free-Riders in Steiner Tree Cost-Sharing Games. 231-245
  Electronic Edition (link) BibTeX
• Giuseppe Prencipe:
  On the Feasibility of Gathering by Autonomous Mobile Robots. 246-261
  Electronic Edition (link) BibTeX
• Nicola Santoro, Peter Widmayer:
  Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. 262-276
  Electronic Edition (link) BibTeX
• Mordechai Shalom, Shmuel Zaks:
  Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. 277-291
  Electronic Edition (link) BibTeX
• Rui Wang, Francis C. M. Lau:
  Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets. 292-306
  Electronic Edition (link) BibTeX
• Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer:
  Geometric Routing Without Geometry. 307-322
  Electronic Edition (link) BibTeX