Papiers acceptés

  • Vincenzo Auletta, Roberto De Prisco, Paolo Penna et Giuseppe Persiano : On Designing Truthful Mechanisms for Online Scheduling

  • Amos Beimel : On Private Computation in Incomplete Networks

  • Jean-Claude Bermond, Laurent Braud et David Coudert : Traffic Grooming on the Path

  • Davide Biló et Guido Proietti : Range Augmentation Problems in Static Ad-Hoc Wireless Networks

  • Tiziana Calamoneri et Paola Vocca : On the Approximability of the L(h,k)-Labelling

  • Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis et Evi Papaioannou : A Tight Bound for Online Coloring of Disk Graphs

  • A. Clementi, M. Di Ianni, M. Lauria, A. Monti , G. Rossi et R. Silvestri : Divide et Impera is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances

  • Shantanu Das, Paola Flocchini, Amiya Nayak et Nicola Santoro : Distributed Exploration of an Unknown Graph

  • Yefim Dinitz et Noam Solomon : Two Absolute Bounds for Distributed Bit Complexity

  • Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane et Wing-Kin Sung : Finding Short Right-Hand-on-the-Wall Walks in Undirected Graphs

  • Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum et Sébastien Tixeuil : An Omega (log n) Space Lower Bound for Graph Exploration with Stop

  • Markus Hinkelmann et Andreas Jakoby : Communications in Unknown Networks : Preserving the Secret of Topology

  • Taisuke Izumi et 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 et Fabiano Sarracco : Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs

  • Rastislav Kralovic et Richard Kralovic :On Semi-Perfect 1-Factorizations

  • Paolo Penna et Carmine Ventre : Free-Riders in Steiner Tree Cost-Sharing Games

  • Giuseppe Prencipe : On the Feasibility of Gathering by Autonomous Mobile Robots

  • Nicola Santoro et Peter Widmayer : Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults

  • Mordechai Shalom et Shmuel Zaks : Minimizing the Number of ADMs in SONET Rings with Maximum Throughput
  • Rui Wang et Francis C. M. Lau : Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets
  • Mirjam Wattenhofer, Roger Wattenhofer et Peter Widmayer : Geometric Routing without Geometry
Dates