Journals in DBLP

Inf. Process. Lett.
1989, volume: 32, number: 4

1. Mikhail J. Atallah, Danny Z. Chen
   An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:159-165 [Journal]
   
2. Giri Narasimhan
   A Note on the Hamiltonian Circuit Problem on Directed Path Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:167-170 [Journal]
   
3. Marshall W. Bern, Paul E. Plassmann
   The Steiner Problem with Edge Lengths 1 and 2. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:171-176 [Journal]
   
4. Gerard Ligozat, Helene Bestougeff
   On Relations Between Intervals. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:177-182 [Journal]
   
5. Mohan B. Sharma, S. Sitharama Iyengar
   An Efficient Distributed Depth-First-Search Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:183-186 [Journal]
   
6. Micha Sharir
   A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:187-190 [Journal]
   
7. Andrzej Lingas
   Voronoi Diagrams with Barriers and the Shortest Diagonal Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:191-198 [Journal]
   
8. John A. Ellis, Manrique Mata, Gary MacGillivray
   A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:199-204 [Journal]
   
9. Ömer Egecioglu, Bahman Kalantari
   Approximating the Diameter of a Set of Points in the Euclidean Space. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1989, v:32, n:4, pp:205-211 [Journal]
   
10. Ravi S. Sandhu
    The Demand Operation in the Schematic Protection Model. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:4, pp:213-219 [Journal]