Main page

Call for Papers

Program Committee

Invited Talks

List of Accepted Papers

Proceedings

Registration

Schedule

Venue

Social Events

Getting there

Media Gallery

SIROCCO history

SIROCCO 2004 SIROCCO 2003 SIROCCO 2002 SIROCCO 2001 SIROCCO 2000

• Vincenzo Auletta, Roberto De Prisco, Paolo Penna, and Giuseppe Persiano: On Designing Truthful Mechanisms for Online Scheduling
  
  
• Amos Beimel: On Private Computation in Incomplete Networks
  
  
• Jean-Claude Bermond, Laurent Braud, and David Coudert: Traffic Grooming on the Path
  
  
• Davide Biló and Guido Proietti: Range Augmentation Problems in Static Ad-Hoc Wireless Networks
  
  
• Tiziana Calamoneri and Paola Vocca: On the Approximability of the L(h,k)-Labelling
  
  
• Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, and Evi Papaioannou: A Tight Bound for Online Coloring of Disk Graphs
  
  
• A. Clementi, M. Di Ianni, M. Lauria, A. Monti , G. Rossi, and R. Silvestri: Divide et Impera is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances
  
  
• Shantanu Das, Paola Flocchini, Amiya Nayak, and Nicola Santoro: Distributed Exploration of an Unknown Graph
  
  
• Yefim Dinitz and Noam Solomon: Two Absolute Bounds for Distributed Bit Complexity
  
  
• Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane, and Wing-Kin Sung: Finding Short Right-Hand-on-the-Wall Walks in Undirected Graphs
  
  
• Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, and Sébastien Tixeuil: An Omega (log n) Space Lower Bound for Graph Exploration with Stop
  
  
• Markus Hinkelmann and Andreas Jakoby: Communications in Unknown Networks: Preserving the Secret of Topology
  
  
• Taisuke Izumi and Toshimitsu Masuzawa: An Improved Algorithm for Adaptive Condition-Based Consensus
  
  
• Branislav Katreniak: Biangular circle formation by asynchronous mobile robots
  
  
• Ralf Klasing, Euripides Markou, Tomasz Radzik, and Fabiano Sarracco: Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs
  
  
• Rastislav Kralovic and Richard Kralovic:On Semi-Perfect 1-Factorizations
  
  
• Paolo Penna and Carmine Ventre: Free-Riders in Steiner Tree Cost-Sharing Games
  
  
• Giuseppe Prencipe: On the Feasibility of Gathering by Autonomous Mobile Robots
  
  
• Nicola Santoro and Peter Widmayer: Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults
  
  
• Mordechai Shalom and Shmuel Zaks: Minimizing the Number of ADMs in SONET Rings with Maximum Throughput
  
  
• Rui Wang and Francis C. M. Lau: Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets
  
  
• Mirjam Wattenhofer, Roger Wattenhofer, and Peter Widmayer: Geometric Routing without Geometry