Journals in DBLP
Pak Ching Li , Michel Toulouse Variations of the maximum leaf spanning tree problem for bipartite graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:4, pp:129-132 [Journal ] Travis Gagie Compressing probability distributions. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:4, pp:133-137 [Journal ] Zhenming Chen , Evanthia Papadopoulou , Jinhui Xu Robustness of k -gon Voronoi diagram construction. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:4, pp:138-145 [Journal ] Zheng Sun , Tian-Ming Bu On discretization methods for approximating optimal paths in regions with direction-dependent costs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:4, pp:146-152 [Journal ] Hossein Ghodosi , Rahim Zaare-Nahandi Comments on the 'm out of n oblivious transfer'. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:4, pp:153-155 [Journal ] Mohammad Taghi Hajiaghayi , Harald Räcke An O(sqrt(n))-approximation algorithm for directed sparsest cut. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:4, pp:156-160 [Journal ] Neal Lesh , Michael Mitzenmacher BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:4, pp:161-169 [Journal ]