Journals in DBLP

J. Algorithms
2004, volume: 52, number: 1

1. Abraham Flaxman, Alan M. Frieze, Eli Upfal
   Efficient communication in an ad-hoc network. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:52, n:1, pp:1-7 [Journal]
   
2. Michael Elkin, Guy Kortsarz
   Logarithmic inapproximability of the radio broadcast problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:52, n:1, pp:8-25 [Journal]
   
3. Jochen Alber, Henning Fernau, Rolf Niedermeier
   Parameterized complexity: exponential speed-up for planar graph problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:52, n:1, pp:26-56 [Journal]
   
4. Matthew Andrews, Lisa Zhang
   Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:52, n:1, pp:57-81 [Journal]
   
5. Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku
   Efficient algorithms for the scaled indexing problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2004, v:52, n:1, pp:82-100 [Journal]