Journals in DBLP

Inf. Process. Lett.
2006, volume: 97, number: 1

1. Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu
   A tight lower bound for job scheduling with cancellation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:1-3 [Journal]
   
2. Xiaotie Deng, Li-Sha Huang
   On the complexity of market equilibria with maximum social welfare. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:4-11 [Journal]
   
3. Amos Beimel, Enav Weinreb
   Monotone circuits for monotone weighted threshold functions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:12-18 [Journal]
   
4. Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser
   Transforming spanning trees and pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:19-22 [Journal]
   
5. Haim Kaplan, Nira Shafrir
   The greedy algorithm for edit distance with moves. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:23-27 [Journal]
   
6. Bolette Ammitzbøll Madsen
   An algorithm for Exact Satisfiability analysed with the number of clauses as parameter. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:28-30 [Journal]
   
7. Uriel Feige, Daniel Reichman
   On the hardness of approximating Max-Satisfy. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:31-35 [Journal]
   
8. Salvatore Caporaso
   A decidable characterization of the classes between lintime and exptime. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:97, n:1, pp:36-40 [Journal]