|
Journals in DBLP
- Milind Dawande
A notion of cross-perfect bipartite graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:143-147 [Journal]
- Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
Fault-tolerant cycle-embedding of crossed cubes. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:149-154 [Journal]
- Giulia Galbiati
On finding cycle bases and fundamental cycle bases with a shortest maximal cycle. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:155-159 [Journal]
- T. C. Edwin Cheng, Zhaohui Liu
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:161-165 [Journal]
- Vadim V. Lozin, Dieter Rautenbach
Some results on graphs without long induced paths. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:167-171 [Journal]
- Yin-Te Tsai
The constrained longest common subsequence problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:173-176 [Journal]
- Jean-Jacques Hébrard, Bruno Zanuttini
An efficient algorithm for Horn description. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:177-182 [Journal]
- Tzong-Sun Wu, Chien-Lung Hsu, Han-Yu Lin, Po-Sheng Huang
Improvement of the Miyazaki-Takaragi threshold digital signature scheme. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:183-186 [Journal]
- Saurabh Srivastava, R. K. Ghosh
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:187-194 [Journal]
- Jianjun Zhou, Martin Müller 0003
Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:195-200 [Journal]
- Taekyoung Kwon
Erratum to: "Digital signature algorithm for securing digital identities": [Information Processing Letters 82 (2002) 247-252]. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:88, n:4, pp:201-202 [Journal]
|