Journals in DBLP

J. Algorithms
2003, volume: 48, number: 2

1. Nodari Vakhania
   A better algorithm for sequencing with release and delivery times on identical machines. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:273-293 [Journal]
   
2. Kunihiko Sadakane
   New text indexing functionalities of the compressed suffix arrays. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:294-313 [Journal]
   
3. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
   Scheduling data transfers in a network and the set scheduling problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:314-332 [Journal]
   
4. Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
   Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:333-359 [Journal]
   
5. Leah Epstein, Tamir Tassa
   Vector assignment problems: a general framework. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:360-384 [Journal]
   
6. Pascal Ferraro, Christophe Godin
   Optimal mappings with minimum number of connected components in tree-to-tree comparison problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:385-406 [Journal]
   
7. Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut
   Dynamic TCP acknowledgment in the LogP model. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:407-428 [Journal]
   
8. Sudipto Guha, Adam Meyerson, Kamesh Munagala
   A constant factor approximation algorithm for the fault-tolerant facility location problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:429-440 [Journal]
   
9. Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
   Compact floor-planning via orderly spanning trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2003, v:48, n:2, pp:441-451 [Journal]