| 1071 | -- | 1073 | Jan Holub. Foreword |
| 1075 | -- | 1097 | Amihood Amir. Theoretical issues of searching aerial photographs: a bird s eye view |
| 1099 | -- | 1109 | Abdullah N. Arslan, Ömer Egecioglu. Algorithms For The Constrained Longest Common Subsequence Problems |
| 1111 | -- | 1119 | Luigi Cinque, Sergio De Agostino, Franco Liberati, Bart J. Westgeest. A simple lossless compression heuristic for grey scale images |
| 1121 | -- | 1134 | Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen. Bdd-based analysis of gapped q-gram Filters |
| 1135 | -- | 1144 | Frantisek Franek, William F. Smyth. Sorting suffixes of two-pattern strings |
| 1145 | -- | 1154 | Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot. A first approach to finding common motifs with gaps |
| 1155 | -- | 1166 | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda. A fully compressed pattern matching algorithm for simple collage systems |
| 1167 | -- | 1178 | Yair Kaufman, Shmuel T. Klein. Semi-lossless text compression |
| 1179 | -- | 1191 | Alban Mancheron, Christophe Moan. Combinatorial characterization of the language recognized by factor and suffix oracles |
| 1193 | -- | 1206 | Ernest Ketcha Ngassam, Bruce W. Watson, Derrick G. Kourie. A framework for the dynamic implementation of finite automata for performance enhancement |
| 1207 | -- | 1217 | Jan Supol, Borivoj Melichar. Arithmetic coding in parallel |
| 1219 | -- | 1230 | Uli Laube, Maik Weinard. Conditional inequalities and the shortest common superstring problem |
| 1231 | -- | 1251 | Lili Zhang, Francine Blanchet-Sadri. Algorithms for approximate k-covering of strings |
| 1253 | -- | 1266 | Jean-Marc Champarnaud, Fabien Coulon. Enumerating nondeterministic automata for a given language without constructing the canonical automaton |
| 1267 | -- | 1295 | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos. Completeness in differential approximation classes |
| 1297 | -- | 1308 | N. Variyam Vinodchandran. Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games |