
Conferences in DBLP
 Amotz BarNoy
Cellular Networks: Where Are the Mobile Users? [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:1 [Conf]
 Cyril Gavoille
Distributed Data Structures: A Survey. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:2 [Conf]
 Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
On Designing Truthful Mechanisms for Online Scheduling. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:317 [Conf]
 Amos Beimel
On Private Computation in Incomplete Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:1833 [Conf]
 JeanClaude Bermond, Laurent Braud, David Coudert
Traffic Grooming on the Path. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:3448 [Conf]
 Davide Bilò, Guido Proietti
Range Augmentation Problems in Static AdHoc Wireless Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:4964 [Conf]
 Tiziana Calamoneri, Paola Vocca
On the Approximability of the L(h, k)Labelling Problem on Bipartite Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:6577 [Conf]
 Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
A Tight Bound for Online Coloring of Disk Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:7888 [Conf]
 Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri
Divide and Conquer Is Almost Optimal for the BoundedHop MST Problem on Random Euclidean Instances. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:8998 [Conf]
 Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro
Distributed Exploration of an Unknown Graph. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:99114 [Conf]
 Yefim Dinitz, Noam Solomon
Two Absolute Bounds for Distributed Bit Complexity. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:115126 [Conf]
 Shlomi Dobrev, Jesper Jansson, Kunihiko Sadakane, WingKin Sung
Finding Short RightHandontheWall Walks in Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:127139 [Conf]
 Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil
Space Lower Bounds for Graph Exploration via Reduced Automata. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:140154 [Conf]
 Markus Hinkelmann, Andreas Jakoby
Communications in Unknown Networks: Preserving the Secret of Topology. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:155169 [Conf]
 Taisuke Izumi, Toshimitsu Masuzawa
An Improved Algorithm for Adaptive ConditionBased Consensus. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:170184 [Conf]
 Branislav Katreniak
Biangular Circle Formation by Asynchronous Mobile Robots. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:185199 [Conf]
 Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:200215 [Conf]
 Rastislav Kralovic, Richard Královic
On Semiperfect 1Factorizations. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:216230 [Conf]
 Paolo Penna, Carmine Ventre
FreeRiders in Steiner Tree CostSharing Games. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:231245 [Conf]
 Giuseppe Prencipe
On the Feasibility of Gathering by Autonomous Mobile Robots. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:246261 [Conf]
 Nicola Santoro, Peter Widmayer
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:262276 [Conf]
 Mordechai Shalom, Shmuel Zaks
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:277291 [Conf]
 Rui Wang, Francis C. M. Lau
Optimal Gossiping in Square Meshes in AllPort Mode and with Short Packets. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:292306 [Conf]
 Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer
Geometric Routing Without Geometry. [Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:307322 [Conf]
