Journals in DBLP
J. Algorithms 1997, volume: 25, number: 2
Philip N. Klein , Sairam Subramanian A Randomized Parallel Algorithm for Single-Source Shortest Paths. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:205-220 [Journal ] D. E. G. Hare Computing the Principal Branch of log-Gamma. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:221-236 [Journal ] Peter Slavík A Tight Analysis of the Greedy Algorithm for Set Cover. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:237-254 [Journal ] Lusheng Wang , Dan Gusfield Improved Approximation Algorithms for Tree Alignment. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:255-273 [Journal ] József Békési , Gábor Galambos , Ulrich Pferschy , Gerhard J. Woeginger Greedy Algorithms for On-Line Data Compression. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:274-289 [Journal ] Yossi Azar , Leah Epstein On Two Dimensional Packing. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:290-310 [Journal ] Tomasz Luczak , Edyta Szymanska A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:311-320 [Journal ] James F. Korsh , Seymour Lipschutz Generating Multiset Permutations in Constant Time. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:321-335 [Journal ] Binay K. Bhattacharya , Damon Kaller An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:2, pp:336-358 [Journal ]