Journals in DBLP

Inf. Process. Lett.
1994, volume: 51, number: 3

1. Mark Jerrum
   Counting Trees in a Graph is #P-Complete. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:111-116 [Journal]
   
2. Erl-Huei Lu, Yi-Chang Chen, Hsiao-Peng Wuu
   A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:117-120 [Journal]
   
3. K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston
   A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:121-124 [Journal]
   
4. Bapiraju Vinnakota, V. V. Bapeswara Rao
   Enumeration of Binary Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:125-127 [Journal]
   
5. Wen-Chin Chen, Wen-Chun Ni
   Internal Path Length of the Binary Representation of Heap-Ordered Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:129-132 [Journal]
   
6. Refael Hassin, Shlomi Rubinstein
   Approximations for the Maximum Acyclic Subgraph Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:133-140 [Journal]
   
7. Vladimir G. Deineko, René van Dal, Günter Rote
   The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:141-148 [Journal]
   
8. Jayme Luiz Szwarcfiter, Guy Chaty
   Enumerating the Kernels of a Directed Graph with no Odd Circuits. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:149-153 [Journal]
   
9. G. Ramalingam, Thomas W. Reps
   On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:51, n:3, pp:155-161 [Journal]