Journals in DBLP
Yves F. Verhoeven Enhanced algorithms for Local Search. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:5, pp:171-176 [Journal ] Adam Kasperski , Pawel Zielinski An approximation algorithm for interval data minmax regret combinatorial optimization problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:5, pp:177-180 [Journal ] Pavlos Efraimidis , Paul G. Spirakis Weighted random sampling with a reservoir. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:5, pp:181-185 [Journal ] Morteza Fayyazi , David R. Kaeli , Waleed Meleis An adjustable linear time parallel algorithm for maximum weight bipartite matching. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:5, pp:186-190 [Journal ] Fedor V. Fomin , Kjartan Høie Pathwidth of cubic graphs and exact algorithms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:5, pp:191-196 [Journal ] Ewa Misiolek , Danny Z. Chen Two flow network simplification algorithms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:5, pp:197-202 [Journal ] Kang Li , Lusheng Wang A polynomial time approximation scheme for embedding a directed hypergraph on a ring. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:5, pp:203-207 [Journal ] Mark Adcock , Richard Cleve , Kazuo Iwama , Raymond H. Putra , Shigeru Yamashita Quantum lower bounds for the Goldreich-Levin problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2006, v:97, n:5, pp:208-211 [Journal ]