Journals in DBLP

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

1. Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota
   Cliques, holes and the vertex coloring polytope. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:4, pp:159-164 [Journal]
   
2. Andreas Brandstädt, Van Bang Le, H. N. de Ridder
   Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:4, pp:165-173 [Journal]
   
3. Pierluigi Crescenzi, Federico Greco
   The minimum likely column cover problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:4, pp:175-179 [Journal]
   
4. András Kovács, Tamás Kis
   Partitioning of trees for minimizing height and cardinality. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:4, pp:181-185 [Journal]
   
5. Leroy Johnson
   Tumble, a fast simple iteration algorithm for Fibonacci. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:4, pp:187-189 [Journal]
   
6. Salvador Lucas
   Strong and NV-sequentiality of constructor systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:4, pp:191-201 [Journal]
   
7. Fu-Hsing Wang, Yue-Li Wang, Jou-Ming Chang
   Feedback vertex sets in star graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:4, pp:203-208 [Journal]
   
8. Ciprian Doru Giurcaneanu
   On some properties of the NML estimator for Bernoulli strings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:4, pp:209-213 [Journal]