Journals in DBLP
Atsuko Yamaguchi , Kiyoko F. Aoki , Hiroshi Mamitsuka Finding the maximum common subgraph of a partial k -tree and a graph with a polynomially bounded number of spanning trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:2, pp:57-63 [Journal ] Andrzej Szepietowski , Monika Targan A note on the oriented chromatic number of grids. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:2, pp:65-70 [Journal ] Pascal Ochem Oriented colorings of triangle-free planar graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:2, pp:71-76 [Journal ] S. Fossé , Gwénaël Richomme Some characterizations of Parikh matrix equivalent binary words. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:2, pp:77-82 [Journal ] Hagen Völzer A constructive proof for FLP. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:2, pp:83-87 [Journal ] Giorgio Ausiello , Marc Demange , Luigi Laura , Vangelis Th. Paschos Algorithms for the On-Line Quota Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:2, pp:89-94 [Journal ] Maciej Kurowski A 1.235 lower bound on the number of points needed to draw all n -vertex planar graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:2, pp:95-98 [Journal ] Heum-Geun Kang , Jun-Ki Min , Seok-Ju Chun , Chin-Wan Chung A compression method for prefix-sum cubes. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:92, n:2, pp:99-105 [Journal ]