Journals in DBLP

Inf. Process. Lett.
2004, volume: 89, number: 2

1. Suzanne Seager
   The greedy algorithm for domination in graphs of maximum degree 3. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:53-56 [Journal]
   
2. Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong
   Finding optimal paths in MREP routing. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:57-63 [Journal]
   
3. Wojciech Fraczak, Anna Podolak
   A characterization of s-languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:65-70 [Journal]
   
4. Stasys Jukna
   On the minimum number of negations leading to super-polynomial savings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:71-74 [Journal]
   
5. Ralf Klasing, Christian Laforest
   Hardness results and approximation algorithms of k-tuple domination in graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:75-83 [Journal]
   
6. Dániel Marx
   List edge multicoloring in graphs with few cycles. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:85-90 [Journal]
   
7. Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
   Optimal algorithm for a special point-labeling problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:91-98 [Journal]
   
8. Paul Valiant
   The Log-Rank Conjecture and low degree polynomials. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:2, pp:99-103 [Journal]