Journals in DBLP

J. Algorithms
2004, volume: 50, number: 2

1. David B. Shmoys
   Foreword. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:50, n:2, pp:133- [Journal]
   
2. Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert
   The complexity of finding small triangulations of convex 3-polytopes. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:50, n:2, pp:134-167 [Journal]
   
3. William S. Evans, David G. Kirkpatrick
   Restructuring ordered binary trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:50, n:2, pp:168-193 [Journal]
   
4. Michel X. Goemans, Martin Skutella
   Cooperative facility location games. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:50, n:2, pp:194-214 [Journal]
   
5. László Babai, Igor Pak
   Strong bias of group generators: an obstacle to the "product replacement algorithm". [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:50, n:2, pp:215-231 [Journal]
   
6. Matthew Andrews
   Instability of FIFO in session-oriented networks. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:50, n:2, pp:232-245 [Journal]
   
7. Sundar Vishwanathan
   An approximation algorithm for finding long paths in Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:50, n:2, pp:246-256 [Journal]
   
8. Amihood Amir, Moshe Lewenstein, Ely Porat
   Faster algorithms for string matching with k mismatches. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:50, n:2, pp:257-275 [Journal]