Journals in DBLP
A. Koubková , Václav Koubek Algorithms for transitive closure. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:289-296 [Journal ] Edwin Naroska , Uwe Schwiegelshohn On an on-line scheduling problem for parallel jobs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:297-304 [Journal ] Rezaul Alam Chowdhury , M. Kaykobad , Irwin King An efficient decoding technique for Huffman codes. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:305-308 [Journal ] Eric Sopena There exist oriented planar graphs with oriented chromatic number at least sixteen. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:309-312 [Journal ] Ilyong Chung , Wankyu Choi , Youngchel Kim , Mike Lee The design of conference key distribution system employing a symmetric balanced incomplete block design. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:313-318 [Journal ] Andrew G. Hart , Servet Martínez Sequential iteration of the Erlang fixed-point equations. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:319-325 [Journal ] C. T. Ng , T. C. Edwin Cheng , Aleksander Bachman , Adam Janiak Three scheduling problems with deteriorating jobs to minimize the total completion time. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:327-333 [Journal ] Bruno Zanuttini , Jean-Jacques Hébrard A unified framework for structure identification. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:335-339 [Journal ] Kurt Mehlhorn , Volker Priebe , Guido Schäfer , Naveen Sivadasan All-pairs shortest-paths computation in the presence of negative cycles. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:81, n:6, pp:341-343 [Journal ]