Journals in DBLP

Algorithmica
1996, volume: 16, number: 3

1. Sivaprakasam Sunder, Xin He
   An NC Algorithm for Finding a Minimum Weighted Completion Time Schedule on Series Parallel Graphs. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1996, v:16, n:3, pp:243-262 [Journal]
   
2. Dora Giammarresi, Giuseppe F. Italiano
   Decremental 2- and 3-Connectivity on Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1996, v:16, n:3, pp:263-287 [Journal]
   
3. Costas S. Iliopoulos, D. W. G. Moore, Kunsoo Park
   Covering a String. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1996, v:16, n:3, pp:288-297 [Journal]
   
4. Andris Ambainis
   Communication Complexity in a 3-Computer Model. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1996, v:16, n:3, pp:298-301 [Journal]
   
5. Lusheng Wang, Tao Jiang, Eugene L. Lawler
   Approximation Algorithms for Tree Alignment with a Given Phylogeny. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1996, v:16, n:3, pp:302-315 [Journal]
   
6. Masato Edahiro
   Equispreading Tree in Manhattan Distance. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1996, v:16, n:3, pp:316-338 [Journal]
   
7. Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
   Shortest Noncrossing Paths in Plane Graphs. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1996, v:16, n:3, pp:339-357 [Journal]