Journals in DBLP

J. Algorithms
2001, volume: 40, number: 1

1. Salvador Roura
   Digital Access to Comparison-Based Tree Data Structures and Algorithms. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:40, n:1, pp:1-23 [Journal]
   
2. Anupam Gupta
   Improved Bandwidth Approximation for Trees and Chordal Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:40, n:1, pp:24-36 [Journal]
   
3. Philippe Flajolet, Xavier Gourdon, Daniel Panario
   The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:40, n:1, pp:37-81 [Journal]
   
4. Xin He
   A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:40, n:1, pp:82-101 [Journal]
   
5. Avner Dor, Eitan Greenshtein
   An Almost-Greedy Search on Random Binary Vectors and Random Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2001, v:40, n:1, pp:102-133 [Journal]