Journals in DBLP

Inf. Process. Lett.
1998, volume: 66, number: 4

1. Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara
   On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:165-170 [Journal]
   
2. Sándor P. Fekete, William R. Pulleyblank
   Traveling the Boundary of Minkowski Sums. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:171-174 [Journal]
   
3. Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro
   Efficient Token-Based Control in Rings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:175-180 [Journal]
   
4. Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka
   Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:181-186 [Journal]
   
5. Youzou Miyadera, Koushi Anzai, Hiroshi Unno, Takeo Yaku
   Depth-First Layout Algorithm for Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:187-194 [Journal]
   
6. Hiroshi G. Okuno, Shin-ichi Minato, Hideki Isozaki
   On the Properties of Combination Set Operations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:195-199 [Journal]
   
7. Ting-Yi Sung, Chun-Yuan Lin, Yen-Chu Chuang, Lih-Hsing Hsu
   Fault Tolerant Token Ring Embedding in Double Loop Networks. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:201-207 [Journal]
   
8. Hiro Ito, Mitsuo Yokoyama
   Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:209-213 [Journal]
   
9. Wei-Kuo Chiang, Rong-Jaye Chen
   On the Arrangement Graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:66, n:4, pp:215-219 [Journal]