| 1 | -- | 21 | Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq. Occurrence and Substring Heuristics for i-Matching |
| 23 | -- | 49 | Josué Kuri, Gonzalo Navarro, Ludovic Mé. Fast Multipattern Search Algorithms for Intrusion Detection |
| 51 | -- | 70 | Stefan Burkhardt, Juha Kärkkäinen. Better Filtering with Gapped q-Grams |
| 71 | -- | 88 | Pierre Nicodème. Regexpcount, a symbolic package for counting problems on regular expressions and words |
| 89 | -- | 103 | Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon. Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms |
| 105 | -- | 120 | Jesper Jansson, Andrzej Lingas. A Fast Algorithm for Optimal Alignment between Similar Ordered Trees |
| 121 | -- | 135 | Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi. Computing forbidden words of regular languages |
| 137 | -- | 154 | Leszek Gasieniec, Igor Potapov. Time/Space Efficient Compressed Pattern Matching |
| 155 | -- | 180 | Foto N. Afrati, Hans Leiß, Michel de Rougemont. Definability and Compression |
| 181 | -- | 190 | Inbok Lee, Kunsoo Park, Yanghee Choi. A Simple and Scalable Algorithm for the IP Address Lookup Problem |
| 191 | -- | 210 | Veli Mäkinen. Compact Suffix Array -- A Space-Efficient Full-Text Index |