| 171 | -- | 174 | Min Ji, T. C. Edwin Cheng. An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan |
| 175 | -- | 178 | Claire Mathieu, Charalampos Papamanthou. Distortion lower bounds for line embeddings |
| 179 | -- | 185 | Rainer Steinwandt, Viktória I. Villányi. A one-time signature using run-length encoding |
| 186 | -- | 191 | Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao. A note on computing set overlap classes |
| 192 | -- | 203 | Jyhjong Lin. A conceptual model for negotiating in service-oriented environments |
| 204 | -- | 209 | Changsheng Zhang, Jigui Sun, Xingjun Zhu, Qingyun Yang. An improved particle swarm optimization algorithm for flowshop scheduling problem |
| 210 | -- | 213 | Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang. On the false-positive rate of Bloom filters |
| 214 | -- | 218 | Stanley P. Y. Fung. Lower bounds on online deadline scheduling with preemption penalties |
| 219 | -- | 221 | Pauli Miettinen. On the Positive-Negative Partial Set Cover problem |
| 222 | -- | 225 | Volker Heun. Analysis of a modification of Gusfield s recursive algorithm for reconstructing ultrametric trees |
| 226 | -- | 228 | Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bill Kinnersley, Douglas B. West, Lesley Wiglesworth, Pratik Worah, Hehui Wu. The hub number of a graph |
| 229 | -- | 233 | Yasuhiko Takenaga, Shigeru Arai. PSPACE-completeness of an escape problem |
| 234 | -- | 237 | Ricardo dos Santos Carvalho, Carlile Lavor, Fábio Protti. Extending the geometric build-up algorithm for the molecular distance geometry problem |
| 238 | -- | 241 | Martin Kochol, Nad a Krivonáková, Silvia Smejová, Katarína Sranková. Complexity of approximation of 3-edge-coloring of graphs |
| 242 | -- | 246 | Pierre-Cyrille Héam. A note on partially ordered tree automata |
| 247 | -- | 250 | Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter. Improved algorithms for recognizing p |
| 251 | -- | 254 | Dekel Tsur. Faster algorithms for guided tree edit distance |