Journals in DBLP

Inf. Process. Lett.
2001, volume: 79, number: 6

1. Paola Bonizzoni, Claudio Ferretti, Giancarlo Mauri, Rosalba Zizza
   Separating some splicing models. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:6, pp:255-259 [Journal]
   
2. Toshihiro Fujito
   On approximability of the independent/connected edge dominating set problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:6, pp:261-266 [Journal]
   
3. Rocco A. Servedio
   On the limits of efficient teachability. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:6, pp:267-272 [Journal]
   
4. Guohua Wan, Benjamin P.-C. Yen, Chung-Lun Li
   Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:6, pp:273-280 [Journal]
   
5. Wendy J. Myrvold, Frank Ruskey
   Ranking and unranking permutations in linear time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:6, pp:281-284 [Journal]
   
6. Sachin B. Patkar, H. Narayanan
   A note on optimal covering augmentation for graphic polymatroids. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:6, pp:285-290 [Journal]
   
7. Svetlana A. Kravchenko, Frank Werner
   A heuristic algorithm for minimizing mean flow time with unit setups. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:6, pp:291-296 [Journal]
   
8. Jie Wu, Li Sheng
   An efficient sorting algorithm for a sequence of kings in a tournament. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2001, v:79, n:6, pp:297-299 [Journal]