Journals in DBLP

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

1. Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero, Massimo Santini
   Approximation algorithms for a hierarchically structured bin packing problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:215-221 [Journal]
   
2. Hiroshi Nagamochi, Takahisa Suzuki, Toshimasa Ishii
   A simple recognition of maximal planar graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:223-226 [Journal]
   
3. Guilin Wang
   Universal forgery on a group signature scheme using self-certified public keys. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:227-231 [Journal]
   
4. Vladlen Koltun
   Ready, Set, Go! The Voronoi diagram of moving points that start from a line. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:233-235 [Journal]
   
5. Jérôme Durand-Lose
   A Kleene theorem for splitable signals. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:237-245 [Journal]
   
6. Irit Dinur, Shmuel Safra
   On the hardness of approximating label-cover. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:247-254 [Journal]
   
7. Elias Dahlhaus, Peter Dankelmann, R. Ravi
   A linear-time algorithm to compute a MAD tree of an interval graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:255-259 [Journal]
   
8. Harald Fecher
   A completed hierarchy of true concurrent equivalences. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:261-265 [Journal]