Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]