Journals in DBLP

Discrete Applied Mathematics
1998, volume: 83, number: 1-3

1. Feng Bao, Yoshihide Igarashi, Sabine R. Öhring
   Reliable broadcasting in product networks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:3-20 [Journal]
   
2. Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung
   Embedding ladders and caterpillars into the hypercube. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:21-29 [Journal]
   
3. Francesc Comellas, Margarida Mitjana
   Broadcasting in cycle prefix digraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:31-39 [Journal]
   
4. Kuo-Shun Ding, Ching-Tien Ho, Jyh-Jong Tsay
   Matrix transpose on meshes with wormhole and XY routing. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:41-59 [Journal]
   
5. Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski
   Minimum-time multidrop broadcast. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:61-77 [Journal]
   
6. Paraskevi Fragopoulou, Selim G. Akl
   Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:79-96 [Journal]
   
7. Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
   Minimum time broadcast in faulty star networks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:97-119 [Journal]
   
8. Leszek Gasieniec, Andrzej Pelc
   Broadcasting with linearly bounded transmission faults. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:121-133 [Journal]
   
9. Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
   Cycles in the cube-connected cycles graph. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:135-155 [Journal]
   
10. Ornan Ori Gerstel, Avishai Wool, Shmuel Zaks
    Optimal layouts on a chain ATM network. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:157-178 [Journal]
    
11. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    The complexity of broadcasting in planar and decomposable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:179-206 [Journal]
    
12. Jave O. Kane, Joseph G. Peters
    Line broadcasting in cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:207-228 [Journal]
    
13. Ralf Klasing
    The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:229-246 [Journal]
    
14. Stephane Perennes
    Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:247-262 [Journal]
    
15. Aditya Shastri
    Time-relaxed broadcasting in communication networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:263-278 [Journal]
    
16. Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann
    Uniform homomorphisms of de Bruijn and Kautz networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:279-301 [Journal]
    
17. Emmanouel A. Varvarigos
    Optimal communication algorithms for Manhattan Street networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:303-326 [Journal]