| 125 | -- | 128 | Matthieu Latapy, Clémence Magnien. Coding distributive lattices with Edge Firing Games |
| 129 | -- | 134 | Marek Piotrów. A note on constructing binary heaps with periodic networks |
| 135 | -- | 140 | L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem. Walking around fat obstacles |
| 141 | -- | 144 | Francis Y. L. Chin, Fu Lee Wang. Efficient algorithm for transversal of disjoint convex polygons |
| 145 | -- | 150 | Rafael Dueire Lins. An efficient algorithm for cyclic reference counting |
| 151 | -- | 157 | Ricardo A. Baeza-Yates, Hector Soza-Pollman. Optimal bounded disorder |
| 159 | -- | 161 | Alberto Apostolico, Stefano Lonardi. A speed-up for the commute between subword trees and DAWGs |
| 163 | -- | 166 | Mohammad Taghi Hajiaghayi, Yashar Ganjali. A note on the Consecutive Ones Submatrix problem |
| 167 | -- | 172 | Pierre Yves Schobbens, Gunter Saake, Amílcar Sernadas, Cristina Sernadas. A two-level temporal logic for evolving specifications |
| 173 | -- | 174 | Claudio Arbib, Alberto Caprara. On the stability number of the edge intersection of two graphs |
| 175 | -- | 180 | Navneet Malpani, Jianer Chen. A note on practical construction of maximum bandwidth paths |