
Journals in DBLP
J. Algorithms 2003, volume: 48, number: 1
 Kirk Pruhs
Foreword. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:1 [Journal]
 Erik D. Demaine, Alejandro LópezOrtiz
A linear lower bound on index size for text retrieval. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:215 [Journal]
 Amos Fiat, Haim Kaplan
Making data structures confluently persistent. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:1658 [Journal]
 Amotz BarNoy, Richard E. Ladner
Competitive online stream merging algorithms for mediaondemand. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:5990 [Journal]
 Ulrich Meyer
Averagecase complexity of singlesource shortestpaths algorithms: lower and upper bounds. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:91134 [Journal]
 Adrian Dumitrescu, Joseph S. B. Mitchell
Approximation algorithms for TSP with neighborhoods in the plane. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:135159 [Journal]
 Vijay Raghavan, Jeremy Spinrad
Robust algorithms for restricted domains. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:160172 [Journal]
 Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter
Performance study of phylogenetic methods: (unweighted) quartet methods and neighborjoining. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:173193 [Journal]
 Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
An efficient graph algorithm for dominance constraints. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:194219 [Journal]
 Refael Hassin, Asaf Levin
Minimum spanning tree with hop restrictions. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:220238 [Journal]
 Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
Packing cycles in undirected graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:239256 [Journal]
 Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or
Capacitated vertex covering. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:48, n:1, pp:257270 [Journal]
