
Journals in DBLP
J. Algorithms 2004, volume: 52, number: 1
 Abraham Flaxman, Alan M. Frieze, Eli Upfal
Efficient communication in an adhoc network. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:1, pp:17 [Journal]
 Michael Elkin, Guy Kortsarz
Logarithmic inapproximability of the radio broadcast problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:1, pp:825 [Journal]
 Jochen Alber, Henning Fernau, Rolf Niedermeier
Parameterized complexity: exponential speedup for planar graph problems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:1, pp:2656 [Journal]
 Matthew Andrews, Lisa Zhang
Minimizing endtoend delay in highspeed networks with a simple coordinated schedule. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:1, pp:5781 [Journal]
 BiingFeng Wang, JyhJye Lin, ShanChyun Ku
Efficient algorithms for the scaled indexing problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:1, pp:82100 [Journal]
