Journals in DBLP

Inf. Process. Lett.
2006, volume: 99, number: 5

1. Yasuhiko Takenaga, Toby Walsh
   Tetravex is NP-complete. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:171-174 [Journal]
   
2. Alistair Moffat, Vo Ngoc Anh
   Binary codes for locally homogeneous sequences. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:175-180 [Journal]
   
3. Markus Kuba
   On Quickselect, partial sorting and Multiple Quickselect. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:181-186 [Journal]
   
4. Asaf Levin
   Real time scheduling with a budget: Parametric-search is better than binary search. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:187-191 [Journal]
   
5. Shisheng Li, Guangzhong Sun, Guoliang Chen
   Improved algorithm for finding next-to-shortest paths. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:192-194 [Journal]
   
6. Julián Mestre
   On the multi-radius cover problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:195-198 [Journal]
   
7. Philippe Janssen, Lhouari Nourine
   Minimum implicational basis for meet-semidistributive lattices. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:199-202 [Journal]
   
8. Yoshifumi Sakai
   A linear space algorithm for computing a longest common increasing subsequence. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:203-207 [Journal]
   
9. Raymond R. Devillers, Laurent Van Begin
   Boundedness undecidability for synchronized nets. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:5, pp:208-214 [Journal]