Table of Contents

 

• F. Comellas, J. Fàbrega, & P. Fraigniaud
  Preface

 

• J. Diaz
  Adversarial Queueing Theory

 

• C. Kaklamanis
  Wavelength Routing in WDM Trees

 

• L. Barrière & S. Dobrev
  Leader Election in Abelian Cayley Graphs

 

• J-C. Bermond, L. Chacon, D. Coudert, & F. Tillerot
  Cycle Covering

 

• P. Bose & P. Morin
  Competitive Online Routing in Geometric Graphs

 

• S. D. Bruda & S. G. Akl
  Parallel Real-Time Complexity: A Strong Infinite Hierarchy

 

• S. Cantarell, A. K. Datta, F. Petit, & V. Villain
  Group Mutual Exclusion in Token Rings

 

• I. Caragiannis, C. Kaklamanis, & P. Kanellopoulos
  New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies

 

• V. Chepoi & A. Rollin
  Interval Routing in Some Planar Quadrangulations

 

• P. Damaschke
  Worst-Case Bounds for Blind Broadcasting in Small-Degree Networks

 

• M. Elkin & D. Peleg
  The Client-Server $2$-Spanner Problem and Applications to Network Design

 

• G. Fertin & A. Raspaud
  $k$--Neighborhood Broadcasting

 

• P. Flocchini, G. Prencipe, N. Santoro, & P. Widmayer
  Pattern Formation by Autonomous Robots without Chirality

 

• Y. Ganjali
  Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Scheme

 

• E. Godard & Y. Métivier
  A Characterization of Classes of Graphs Recognizable by Local Computations with Initial Knowledge

 

• P. Gvozdjak & J. G. Peters
  Modelling Links in Inclined LEO Satellite Networks

 

• P. R. Hafner
  On the graphs of McKay-Miller-Sirán

 

• A. Kesselman & Y. Mansour
  QoS-Competitive Video Buffering

 

• R. Královic & P. Ruzicka
  On Immunity and Catastrophic Indices of Graphs

 

• M. Makúch & P. Ruzicka
  On the Complexity of Path Layouts in Bounded Degree ATM Networks: A Case Study for Butterfly Networks

 

• G. Malewicz, A. Russell, & A. Shvartsman
  Optimal Scheduling for Disconnected Cooperation

 

• A. Mostéfaoui, S. Rajsbaum, M. Raynal, & M. Roy
  Efficient Condition-Based Consensus

 

• T. Nakata & M. Yamashita
  Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game

 

• A. Osterloh
  Oblivious Routing on $d$-dimensional Meshes

 

• P. Salinger & P. Tvrdik
  Broadcasting in All-Output-Port Cube-Connected Cycles with Distance-Insensitive Routing

 

• J. Watkinson, M. Adler, & F. E. Fich
  New Protocols for Asymmetric Communication Channels

 

• N. Zeh & N. Santoro
  On Finding Minimum Deadly Sets for Directed Networks

 

• Author Index