Journals in DBLP

Algorithmica
1989, volume: 4, number: 4

1. Sanjiv Kapoor, Prakash V. Ramanan
   Lower Bounds for Maximal and Convex Layers Problems. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:447-459 [Journal]
   
2. Kenneth L. Clarkson
   An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:461-469 [Journal]
   
3. Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
   Algorithms for Multicommodity Flows in Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:471-501 [Journal]
   
4. Nimrod Megiddo
   Extending NC and RNC Algorithms. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:501-517 [Journal]
   
5. Daniel S. Hirschberg, Lawrence L. Larmore
   The Set-Set LCS Problem. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:503-510 [Journal]
   
6. Prakash V. Ramanan, Kazuhiro Tsuga
   Average-Case Analysis of the Modified Harmonic Algorithm. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:519-533 [Journal]
   
7. Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
   A Dynamic Fixed Windowing Problem. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:535-550 [Journal]
   
8. Michael Luby, Prabhakar Ragde
   A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:551-567 [Journal]
   
9. Pravin M. Vaidya
   Approximate Minimum Weight Matching on Points in k-Dimensional Space. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1989, v:4, n:4, pp:569-583 [Journal]
   
10. Elena Lodi, Fabrizio Luccio, Linda Pagli
    A Preliminary Study of a Diagonal Channel-Routing Model. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:585-597 [Journal]
    
11. Steven Skiena
    Problems in Geometric Probing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:599-605 [Journal]