| 201 | -- | 220 | Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing. Time-optimal Tree Computations on Sparse Meshes |
| 221 | -- | 236 | Aaron Feigelson, Lisa Hellerstein. The Forbidden Projections of Unate Functions |
| 237 | -- | 257 | Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger. The VC-dimension of Set Systems Defined by Graphs |
| 259 | -- | 270 | Dieter Kratsch, Ton Kloks, Haiko Müller. Measuring the Vulnerability for Classes of Intersection Graphs |
| 271 | -- | 280 | Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger. Simple But Efficient Approaches for the Collapsing Knapsack Problem |
| 281 | -- | 305 | Ivan Stojmenovic. Multiplicative Circulant Networks Topological Properties and Communication Algorithms |