The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2005, volume: 95, number: 2

  1. Zhi-Zhong Chen, Yuusuke Okamoto, Lusheng Wang
    Improved deterministic approximation algorithms for Max TSP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:333-342 [Journal]
  2. Srdjan Petrovic
    Space-efficient FCFS group mutual exclusion. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:343-350 [Journal]
  3. Savio S. H. Tse
    A short note on the lower bound of dilation for O(logn)-label interval routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:351-353 [Journal]
  4. Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
    Reviewing bounds on the circuit size of the hardest functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:354-357 [Journal]
  5. Guy Even, Dror Rawitz, Shimon Shahar
    Hitting sets when the VC-dimension is small. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:358-362 [Journal]
  6. Linh Anh Nguyen, Rajeev Goré
    Completeness of hyper-resolution via the semantics of disjunctive logic programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:363-369 [Journal]
  7. Jeff Abrahamson, Ali Shokoufandeh, Pawel Winter
    Euclidean TSP between two nested convex obstacles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:370-375 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002