
Journals in DBLP
 Dimitrios M. Thilikos, Hans L. Bodlaender
Fast Partitioning lApex Graphs with Application to Approximating Maximum InducedSubgraph Problems. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:227232 [Journal]
 Antoni W. Mazurkiewicz
Distributed Enumeration. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:233239 [Journal]
 Joseph M. Morris
NonDeterministic Expressions and Predicate Transformers. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:241246 [Journal]
 Tiziana Calamoneri, Rossella Petreschi
A New 3D Representation of Trivalent Cayley Networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:247252 [Journal]
 Jean Frédéric Myoupo, Ahmad Wabbi
Improved Linear Systolic Algorithms for Substring Statistics. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:253258 [Journal]
 C. Micheneau
Disjoint Hamiltonian Cycles in Recursive Circulant Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:259264 [Journal]
 Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa
A Faster Parallel Algorithm for kConnectivity. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:265269 [Journal]
 Knut Verbarg
Approximate Center Points in Dense Point Sets. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:271278 [Journal]
 Berry Schoenmakers
A Tight Lower Bound for TopDown Skew Heaps. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:279284 [Journal]
