Journals in DBLP

Inf. Process. Lett.
2003, volume: 86, number: 2

1. Kazuhiro Ogata, Kokichi Futatsugi
   Flaw and modification of the iKP electronic payment protocols. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:57-62 [Journal]
   
2. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
   A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:63-70 [Journal]
   
3. Tibor Szabó
   On the spectrum of projective norm-graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:71-74 [Journal]
   
4. L. Sunil Chandran
   A lower bound for the hitting set size for combinatorial rectangles and an application. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:75-78 [Journal]
   
5. Yosuke Kikuchi, Yukio Shibata
   On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:79-85 [Journal]
   
6. Daya Ram Gaur, Arvind Gupta, Ramesh Krishnamurti
   A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:87-91 [Journal]
   
7. Jau-Der Shih
   Fault-tolerant wormhole routing for hypercube networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:93-100 [Journal]
   
8. Richard C. Brewster, Romeo Rizzi
   On the complexity of digraph packings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:101-106 [Journal]
   
9. Scott Effler, Frank Ruskey
   A CAT algorithm for generating permutations with a fixed number of inversions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:86, n:2, pp:107-112 [Journal]