Journals in DBLP

Inf. Process. Lett.
1997, volume: 62, number: 6

1. Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier
   An O(n) Time Algorithm for Maximum Matching in P₄-Tidy Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:281-287 [Journal]
   
2. Jacques Justin, Giuseppe Pirillo
   On Some Factorizations of Infinite Words by Elements of Codes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:289-294 [Journal]
   
3. Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram
   A Note on Optical Routing on Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:295-300 [Journal]
   
4. Yuan Ma, Serge A. Plotkin
   An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:301-303 [Journal]
   
5. Masataka Sassa, Takuya Ookubo
   Systematic Debugging Method for Attribute Grammar Description. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:305-313 [Journal]
   
6. Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki
   A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:315-322 [Journal]
   
7. Shin-ichi Nakayama, Shigeru Masuyama
   A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:323-327 [Journal]
   
8. Paul Pritchard
   An Old Sub-Quadratic Algorithm for Finding Extremal Sets. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1997, v:62, n:6, pp:329-334 [Journal]