Journals in DBLP
Ernst Althaus , Kurt Mehlhorn Maximum Network Flow with Floating Point Arithmetic. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:109-113 [Journal ] Chongkye Rhee On the Chromatic Index of Graphs with 2m + 1 Vertices and 2m ^{2} Edges. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:115-118 [Journal ] Nakhoon Baek , Sung Yong Shin On Circularly-Hidden Surface Removal. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:119-123 [Journal ] Jurek Czyzowicz , Evangelos Kranakis , Jorge Urrutia A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:125-126 [Journal ] Guoliang Xue , Shangzhi Sun , J. Ben Rosen Fast Data Transmission and Maximal Dynamic Flow. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:127-132 [Journal ] Chan-Su Shin , Sung Kwon Kim , Sung-Ho Kim , Kyung-Yong Chwa Algorithms for Drawing Binary Trees in the Plane. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:133-139 [Journal ] Seongyeol Kim , Ilyong Chung Application of the Special Latin Square to a Parallel Routing Algorithm on a Recursive Circulant Network. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:141-147 [Journal ] Bruce E. Litow , Bernard Mans A Note on the Ádám Conjecture for Double Loops. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:149-153 [Journal ] Vassil S. Dimitrov , Graham A. Jullien , William C. Miller An Algorithm for Modular Exponentiation. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:155-159 [Journal ] Carlos Cabrelli , Ursula Molter A Linear Time Algorithm for a Matching Problem on the Circle. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:66, n:3, pp:161-164 [Journal ]