Journals in DBLP

Inf. Process. Lett.
2004, volume: 90, number: 6

1. Joachim Breit
   An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:6, pp:273-278 [Journal]
   
2. Maw-Shang Chang, Chin-Hua Lin, Chuan-Min Lee
   New upper bounds on feedback vertex numbers in butterflies. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:6, pp:279-285 [Journal]
   
3. Robert M. Hierons
   Using a minimal number of resets when testing from a finite state machine. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:6, pp:287-292 [Journal]
   
4. Mingjun Ji, Huanwen Tang, Juan Guo
   A single-point mutation evolutionary programming. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:6, pp:293-299 [Journal]
   
5. Hana Chockler, Dan Gutfreund
   A lower bound for testing juntas. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:6, pp:301-305 [Journal]
   
6. Stavros D. Nikolopoulos, Christos Nomikos, Panos Rondogiannis
   A limit characterization for the number of spanning trees of graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:90, n:6, pp:307-313 [Journal]