Journals in DBLP

Inf. Process. Lett.
2007, volume: 104, number: 3

1. Venkatesh Raman, Somnath Sikdar
   Parameterized complexity of the induced subgraph problem in directed graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:3, pp:79-85 [Journal]
   
2. Toru Araki
   On the k-tuple domination of de Bruijn and Kautz digraphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:3, pp:86-90 [Journal]
   
3. Mikolaj Bojanczyk
   A new algorithm for testing if a regular language is locally threshold testable. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:3, pp:91-94 [Journal]
   
4. Markus E. Nebel
   On the lexicographical generation of compressed codes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:3, pp:95-100 [Journal]
   
5. Sylvain Duquesne
   Improving the arithmetic of elliptic curves in the Jacobi model. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:3, pp:101-105 [Journal]
   
6. Mariano Zelke
   Optimal per-edge processing times in the semi-streaming model. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:3, pp:106-112 [Journal]
   
7. Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
   Spanning trees with minimum weighted degrees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:104, n:3, pp:113-116 [Journal]