Journals in DBLP

Inf. Process. Lett.
2007, volume: 101, number: 1

1. Joost Engelfriet, Tjalling Gelsema
   An exercise in structural congruence. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:1-5 [Journal]
   
2. Houman Alborzi, Hanan Samet
   Execution time analysis of a top-down R-tree construction algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:6-12 [Journal]
   
3. Eric McDermid, Christine Cheng, Ichiro Suzuki
   Hardness results on the man-exchange stable marriage problem with short preference lists. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:13-19 [Journal]
   
4. Junhu Wang
   Binary equality implication constraints, normal forms and data redundancy. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:20-25 [Journal]
   
5. Uriel Feige, James R. Lee
   An improved approximation ratio for the minimum linear arrangement problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:26-29 [Journal]
   
6. Vardges Melkonian
   Flows in dynamic networks with aggregate arc capacities. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:30-35 [Journal]
   
7. Faisal N. Abu-Khzam, Michael A. Langston
   Linear-time algorithms for problems on planar graphs with fixed disk dimension. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:36-40 [Journal]
   
8. Richard S. Bird, Stefan Sadnicki
   Minimal on-line labelling. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:41-45 [Journal]
   
9. Yoshinobu Kawabe, Ken Mano, Hideki Sakurada, Yasuyuki Tsukada
   Theorem-proving anonymity of infinite-state systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:1, pp:46-51 [Journal]