Journals in DBLP

Inf. Process. Lett.
2002, volume: 81, number: 4

1. Judit Büki, Csaba Szabó
   Complexity of homomorphisms to direct products of graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:175-178 [Journal]
   
2. Oukseh Lee, Kwangkeun Yi, Yunheung Paek
   A proof method for the correctness of modularized 0CFA. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:179-185 [Journal]
   
3. Toru Araki, Yukio Shibata
   Pancyclicity of recursive circulant graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:187-190 [Journal]
   
4. San Skulrattanakulchai
   4-edge-coloring graphs of maximum degree 3 in linear time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:191-195 [Journal]
   
5. Charles U. Martel
   The expected complexity of Prim's minimum spanning tree algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:197-201 [Journal]
   
6. Fanica Gavril
   Algorithms for maximum weight induced paths. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:203-208 [Journal]
   
7. Soumen Maity, Bimal K. Roy, Amiya Nayak
   On enumeration of catastrophic fault patterns. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:209-212 [Journal]
   
8. Susanne Albers, Marek Karpinski
   Randomized splay trees: Theoretical and experimental results. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:213-221 [Journal]
   
9. Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel
   On the minimum size of visibility graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2002, v:81, n:4, pp:223-230 [Journal]