| 263 | -- | 297 | Xujin Chen, Bo Chen. Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design |
| 298 | -- | 313 | D. T. Lee, Tien-Ching Lin, Hsueh-I Lu. Fast Algorithms for the Density Finding Problem |
| 314 | -- | 336 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat. Real Two Dimensional Scaled Matching |
| 337 | -- | 357 | Jan Arpe, Bodo Manthey. Approximability of Minimum AND-Circuits |
| 358 | -- | 373 | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse. Nondeterministic Graph Searching: From Pathwidth to Treewidth |
| 374 | -- | 384 | Joel I. Seiferas. Sorting Networks of Logarithmic Depth, Further Simplified |
| 385 | -- | 401 | Leah Epstein, Thomas Erlebach, Asaf Levin. Variable Sized Online Interval Coloring with Bandwidth |
| 402 | -- | 424 | Romeo Rizzi. Minimum Weakly Fundamental Cycle Bases Are Hard To Find |
| 425 | -- | 453 | Pangfeng Liu, May-Chen Kuo, Da-Wei Wang. An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments |