Journals in DBLP

J. Algorithms
1987, volume: 8, number: 1

1. Hiroshi Imai, Takao Asano
   Dynamic Orthogonal Segment Intersection Search. [Citation Graph (1, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:1-18 [Journal]
   
2. Richard Cole, Chee-Keng Yap
   Shape from Probing. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:19-38 [Journal]
   
3. Howard J. Karloff, David B. Shmoys
   Efficient Parallel Algorithms for Edge Coloring Problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:39-52 [Journal]
   
4. Jan K. Pachl
   A Lower Bound for Probabilistic Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:53-65 [Journal]
   
5. Alejandro A. Schäffer, Christopher J. Van Wyk
   Convex Hulls of Piecewise-Smooth Jordan Curves. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:66-94 [Journal]
   
6. George Steiner
   Searching in 2-Dimensional Partial Orders. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:95-105 [Journal]
   
7. Moon-Jung Chung
   O(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:106-112 [Journal]
   
8. John L. Mohammed, Carlos S. Subi
   An Improved Block-Interchange Algorithm. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:113-121 [Journal]
   
9. George K. Georgakopoulos, Christos H. Papadimitriou
   The 1-Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1987, v:8, n:1, pp:122-130 [Journal]
   
10. Helaman R. P. Ferguson
    A Noninductive GL(n, Z) Algorithm That Constructs Integral Linear Relations for n Z-Linearly Dependent Real Numbers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:131-145 [Journal]
    
11. Shou-Hsuan Stephen Huang
    Optimal Multiway Split Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:146-156 [Journal]