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