
Journals in DBLP
J. Algorithms 2002, volume: 45, number: 1
 Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson
A primaldual schema based approximation algorithm for the element connectivity problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:45, n:1, pp:115 [Journal]
 James Aspnes
Fast deterministic consensus in a noisy environment. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:45, n:1, pp:1639 [Journal]
 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:4054 [Journal]
 Tsansheng Hsu
Simpler and faster biconnectivity augmentation. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:45, n:1, pp:5571 [Journal]
 Eran Halperin, Ram Nathaniel, Uri Zwick
Coloring kcolorable graphs using relatively small palettes. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:45, n:1, pp:7290 [Journal]
