Journals in DBLP

J. Algorithms
1999, volume: 32, number: 1

1. Nader H. Bshouty
   Lower Bounds for the Complexity of Functions in a Realistic RAM Model. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:1, pp:1-20 [Journal]
   
2. Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente
   A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:1, pp:21-30 [Journal]
   
3. Yefim Dinitz, Zeev Nutov
   A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:1, pp:31-40 [Journal]
   
4. Ton Kloks, Dieter Kratsch, Haiko Müller
   Approximating the Bandwidth for Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:1, pp:41-57 [Journal]
   
5. Samir Khuller, Manfred Göbel, Jochen Walter
   Bases for Polynomial Invariants of Conjugates of Permutation Groups. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:32, n:1, pp:58-61 [Journal]