Journals in DBLP

Algorithmica
2001, volume: 29, number: 3

1. Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam
   Solving Some Discrepancy Problems in NC. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2001, v:29, n:3, pp:371-395 [Journal]
   
2. Lata Narayanan, Sunil M. Shende
   Static Frequency Assignment in Cellular Networks. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2001, v:29, n:3, pp:396-409 [Journal]
   
3. Uriel Feige, David Peleg, Guy Kortsarz
   The Dense k-Subgraph Problem. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2001, v:29, n:3, pp:410-421 [Journal]
   
4. Adi Avidor, Yossi Azar, Jiri Sgall
   Ancient and New Algorithms for Load Balancing in the l_p Norm. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2001, v:29, n:3, pp:422-441 [Journal]
   
5. Hadas Shachnai, Tami Tamir
   On Two Class-Constrained Versions of the Multiple Knapsack Problem. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2001, v:29, n:3, pp:442-467 [Journal]
   
6. Mikhail J. Atallah, Frédéric Chyzak, Philippe Dumas
   A Randomized Algorithm for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2001, v:29, n:3, pp:468-486 [Journal]
   
7. John H. Reif
   Efficient Parallel Computation of the Characteristic Polynomial of a Sparse, Separable Matrix. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2001, v:29, n:3, pp:487-510 [Journal]