Journals in DBLP

Inf. Process. Lett.
1995, volume: 55, number: 2

1. Jeffery Westbrook, Dicky C. K. Yan
   Linear Bounds for On-Line Steiner Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:59-63 [Journal]
   
2. Steve Hill
   The Lazy Z-Buffer. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:65-70 [Journal]
   
3. Ramjee P. Swaminathan, D. Giriraj, D. K. Bhatia
   The Pagenumber of the Class of Bandwidth-k Graphs is k-1. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:71-74 [Journal]
   
4. Muhammad H. Alsuwaiyel, D. T. Lee
   Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:75-79 [Journal]
   
5. Jie Wang
   Some Results on Selectivity and Self-Reducibility. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:81-87 [Journal]
   
6. John D. Valois
   A 3-Valued Wakeup Protocol. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:89-93 [Journal]
   
7. Youssef Saab
   Iterative Improvement of Vertex Covers. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:95-98 [Journal]
   
8. Derek G. Corneil, Hiryoung Kim, Sridhar Natarajan, Stephan Olariu, Alan P. Sprague
   Simple Linear Time Recognition of Unit Interval Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:99-104 [Journal]
   
9. A. Dermouche
   A Fast Algorithm for String Matching with Mismatches. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:2, pp:105-110 [Journal]
   
10. Tien Huynh, Kim Marriott
    Incremental Constraint Deletion in Systems of Linear Constraints. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:2, pp:111-115 [Journal]