14. SIROCCO 2007: Castiglioncello, Italy

Invited Talks

• Alessandro Panconesi:
  Fast Distributed Algorithms Via Primal-Dual (Extended Abstract). 1-6
  
• Luisa Gargano:
  Time Optimal Gathering in Sensor Networks. 7-10
  
• Hans L. Bodlaender:
  Treewidth: Structure and Algorithms. 11-25
  

Autonomous Systems: Graph Exploration

• Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang:
  Fast Periodic Graph Exploration with Constant Memory. 26-40
  
• Miroslaw Dynia, Jakub Lopuszanski, Christian Schindelhauer:
  Why Robots Need Maps. 41-50
  
• Nicolas Nisse, David Soguet:
  Graph Searching with Advice. 51-65
  

Distributed Algorithms: Fault Tolerance

• Achour Mostéfaoui, Michel Raynal, Corentin Travers:
  From Renaming to Set Agreement. 66-80
  
• Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès:
  A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. 81-95
  
• Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil:
  A New Self-stabilizing Maximal Matching Algorithm. 96-108
  

Distributed Algorithms and Data Structures

• Amos Korman, Shay Kutten:
  Labeling Schemes with Queries. 109-123
  
• Maurice Herlihy, Yossi Lev, Victor Luchangco, Nir Shavit:
  A Simple Optimistic Skiplist Algorithm. 124-138
  
• Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, Andrea Vitaletti:
  Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. 139-150
  

Autonomous Systems: Location Problems

• Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
  Optimal Moves for Gossiping Among Mobile Agents. 151-165
  
• Yoann Dieudonné, Franck Petit:
  Swing Words to Make Circle Formation Quiescent. 166-179
  
• Asaf Efrima, David Peleg:
  Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots. 180-194
  

Wireless Networks

• Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia:
  Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. 195-207
  
• Tiziana Calamoneri, Emanuele G. Fusco, Anil M. Shende, Sunil M. Shende:
  Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers. 208-221
  
• Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis:
  Location Oblivious Distributed Unit Disk Graph Coloring. 222-233
  

Communication Networks: Fault Tolerance

• Iztok Banic, Janez Zerovnik:
  Edge Fault-Diameter of Cartesian Product of Graphs. 234-245
  
• Rastislav Kralovic, Richard Královic:
  Rapid Almost-Complete Broadcasting in Faulty Networks. 246-260
  
• Jean-Claude Bermond, Frédéric Giroire, Stéphane Pérennes:
  Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions. 261-273
  

Autonomous Systems: Fault Tolerance

• Yoshiaki Katayama, Yuichi Tomida, Hiroyuki Imazu, Nobuhiro Inuzuka, Koichi Wada:
  Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots. 274-288
  
• Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita:
  Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents. 289-303
  

Communication Networks: Parallel Computing and Selfish Routing

• Guy Even, Tamir Levi, Ami Litman:
  Optimal Conclusive Sets for Comparator Networks. 304-317
  
• George Karakostas, Taeyon Kim, Anastasios Viglas, Hao Xia:
  Selfish Routing with Oblivious Users. 318-327
  
• Hajo Broersma, Matthew Johnson, Daniël Paulusma:
  Upper Bounds and Algorithms for Parallel Knock-Out Numbers. 328-340