| 83 | -- | 87 | Cristian Martín, Mikel Larrea. A simple and communication-efficient Omega algorithm in the crash-recovery model |
| 88 | -- | 92 | James Bailey, Elsa Loekito. Efficient incremental mining of contrast patterns in changing data |
| 93 | -- | 98 | Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta. Weighted nearest neighbor algorithms for the graph exploration problem on cycles |
| 99 | -- | 103 | Nicoletta De Francesco, Giuseppe Lettieri, Luca Martini, Gigliola Vaglini. Partial model checking via abstract interpretation |
| 104 | -- | 107 | Santhanakrishnan Anand, Rajarathnam Chandramouli. A network flow based approach for network selection in dynamic spectrum access networks |
| 108 | -- | 112 | Narad Rampersad, Jeffrey Shallit. Detecting patterns in finite regular and context-free languages |
| 113 | -- | 115 | Peter Brass, Hyeon-Suk Na. Finding the maximum bounded intersection of k out of n halfplanes |
| 116 | -- | 122 | Yannick Chevalier, Michaël Rusinowitch. Compiling and securing cryptographic protocols |
| 123 | -- | 128 | Enno Ohlebusch, Simon Gog. Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem |