211 | -- | 217 | David R. Wood. An algorithm for finding a maximum clique in a graph |

219 | -- | 223 | Zeev Nutov, Michal Penn. Faster approximation algorithms for weighted triconnectivity augmentation problems |

225 | -- | 227 | Michel Burlet, Olivier Goldschmidt. A new and improved algorithm for the 3-cut problem |

229 | -- | 233 | Jean-François Hêche, Thomas M. Liebling. Finding minimum area simple pentagons |

235 | -- | 242 | Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza. Semi on-line algorithms for the partition problem |

243 | -- | 248 | Christian Ewerhart. Bayesian optimization and genericity |

249 | -- | 252 | Makoto Doi, Yow-Mow Chen, Hideo Osawa. A queueing model in which arrival times are scheduled |