
Journals in DBLP
 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:159164 [Journal]
 Andreas Brandstädt, Van Bang Le, H. N. de Ridder
Efficient robust algorithms for the Maximum Weight Stable Set Problem in chairfree graph classes. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:4, pp:165173 [Journal]
 Pierluigi Crescenzi, Federico Greco
The minimum likely column cover problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:4, pp:175179 [Journal]
 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:181185 [Journal]
 Leroy Johnson
Tumble, a fast simple iteration algorithm for Fibonacci. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:4, pp:187189 [Journal]
 Salvador Lucas
Strong and NVsequentiality of constructor systems. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:4, pp:191201 [Journal]
 FuHsing Wang, YueLi Wang, JouMing Chang
Feedback vertex sets in star graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:4, pp:203208 [Journal]
 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:209213 [Journal]
