Journals in DBLP

Networks
2002, volume: 39, number: 2

1. Daniela Ferrero, Carles Padró
   Partial line directed hypergraphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:2, pp:61-67 [Journal]
   
2. Glenn K. Manacher, Terrance A. Mankus
   A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:2, pp:68-72 [Journal]
   
3. Paul L. Mariz, Shahriar Shahriari
   Edge-cutsets in the directed hypercube. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:2, pp:73-76 [Journal]
   
4. V. Venkata Rao, R. Sridharan
   Minimum-weight rooted not-necessarily-spanning arborescence problem. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:2, pp:77-87 [Journal]
   
5. Anders Dessmark, Andrzej Pelc
   Deterministic radio broadcasting at low cost. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:2, pp:88-97 [Journal]
   
6. Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard
   Oriented hypercubes. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:2, pp:98-106 [Journal]
   
7. Paul McAree, Lawrence Bodin, Michael O. Ball
   Models for the design and analysis of a large package sort facility. [Citation Graph (0, 0)][DBLP]
   Networks, 2002, v:39, n:2, pp:107-120 [Journal]