
Journals in DBLP
 JeanLuc Fouquet, Igor Parfenoff, Henri Thuillier
An O(n) Time Algorithm for Maximum Matching in P_{4}Tidy Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:62, n:6, pp:281287 [Journal]
 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:289294 [Journal]
 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:295300 [Journal]
 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:301303 [Journal]
 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:305313 [Journal]
 ShinIchi Nakano, Md. Saidur Rahman, Takao Nishizeki
A LinearTime Algorithm for FourPartitioning FourConnected Planar Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:62, n:6, pp:315322 [Journal]
 Shinichi 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:323327 [Journal]
 Paul Pritchard
An Old SubQuadratic Algorithm for Finding Extremal Sets. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:62, n:6, pp:329334 [Journal]
