Journals in DBLP

J. Algorithms
2002, volume: 45, number: 1

1. Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson
   A primal-dual schema based approximation algorithm for the element connectivity problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:45, n:1, pp:1-15 [Journal]
   
2. James Aspnes
   Fast deterministic consensus in a noisy environment. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:45, n:1, pp:16-39 [Journal]
   
3. Jan Kratochvíl, Zsolt Tuza
   On the complexity of bicoloring clique hypergraphs of graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:45, n:1, pp:40-54 [Journal]
   
4. Tsan-sheng Hsu
   Simpler and faster biconnectivity augmentation. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:45, n:1, pp:55-71 [Journal]
   
5. Eran Halperin, Ram Nathaniel, Uri Zwick
   Coloring k-colorable graphs using relatively small palettes. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2002, v:45, n:1, pp:72-90 [Journal]