Journals in DBLP

Inf. Process. Lett.
2007, volume: 103, number: 5

1. X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, Q. X. Wang
   Particle swarm optimization-based algorithms for TSP and generalized TSP. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:5, pp:169-176 [Journal]
   
2. Louise Leenen, Thomas Meyer, Aditya Ghose
   Relaxations of semiring constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:5, pp:177-182 [Journal]
   
3. Adam Janiak, Radoslaw Rudek
   The learning effect: Getting to the core of the problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:5, pp:183-187 [Journal]
   
4. Flemming Nielson, Hanne Riis Nielson, Henrik Pilegaard
   What is a free name in a process algebra? [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:5, pp:188-194 [Journal]
   
5. Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira, José Coelho de Pina
   Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:5, pp:195-202 [Journal]
   
6. Barbara König, Vitali Kozioura
   Incremental construction of coverability graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:103, n:5, pp:203-209 [Journal]