Journals in DBLP

Theor. Comput. Sci.
2007, volume: 384, number: 2-3

1. Andrzej Pelc, David Peleg, Michel Raynal
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:137-138 [Journal]
   
2. Jean-Claude Bermond, Laurent Braud, David Coudert
   Traffic grooming on the path. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:139-151 [Journal]
   
3. Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou
   A tight bound for online colouring of disk graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:152-160 [Journal]
   
4. Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
   On the bounded-hop MST problem on random Euclidean instances. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:161-167 [Journal]
   
5. Yefim Dinitz, Noam Solomon
   Two absolute bounds for distributed bit complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:168-183 [Journal]
   
6. Markus Hinkelmann, Andreas Jakoby
   Communications in unknown networks: Preserving the secret of topology. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:184-200 [Journal]
   
7. Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
   Hardness and approximation results for Black Hole Search in arbitrary networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:201-221 [Journal]
   
8. Giuseppe Prencipe
   Impossibility of gathering by a set of autonomous mobile robots. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:222-231 [Journal]
   
9. Nicola Santoro, Peter Widmayer
   Agreement in synchronous networks with ubiquitous faults. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:384, n:2-3, pp:232-249 [Journal]
   
10. Mordechai Shalom, Shmuel Zaks
    Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:250-262 [Journal]
    
11. Rui Wang, Francis C. M. Lau
    Optimal gossiping in square 2D meshes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:263-286 [Journal]