| 299 | -- | 301 | Bruce A. Reed, Kaleigh Smith, Adrian Vetta. Finding odd cycle transversals |
| 302 | -- | 303 | Robert Bosch, Adrianne Herman. Continuous line drawings via the traveling salesman problem |
| 304 | -- | 308 | John J. Bartholdi III, Paul Goldsman. The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle |
| 309 | -- | 315 | Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha. Min-max tree covers of graphs |
| 316 | -- | 319 | Asaf Levin. A better approximation algorithm for the budget prize collecting tree problem |
| 320 | -- | 325 | Gerhard J. Woeginger. Inapproximability results for no-wait job shop scheduling |
| 326 | -- | 330 | Fabrice Tercinet, Christophe Lenté, Emmanuel Néron. Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines |
| 331 | -- | 335 | Tamás Kis. On the complexity of the car sequencing problem |
| 336 | -- | 344 | Gautam Appa, Dimitris Magos, Ioannis Mourtos. An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6 |
| 345 | -- | 349 | Geir Dahl, Njål Foldnes, Luís Gouveia. A note on hop-constrained walk polytopes |
| 350 | -- | 354 | Uwe Schäfer. On the modulus algorithm for the linear complementarity problem |
| 355 | -- | 363 | Mohan L. Chaudhry, S. H. Seok Ho Chang. Analysis of the discrete-time bulk-service queue Geo/G:::Y:::/1/::::N::::+::::B:::: |
| 364 | -- | 373 | Y. W. Yang Woo Shin. ::::BMAP::::/::::G::::/1 queue with correlated arrivals of customers and disasters |
| 374 | -- | 379 | Srinagesh Gavirneni. Periodic review inventory control with fluctuating purchasing costs |
| 380 | -- | 389 | G. Petrella. An extension of the Euler Laplace transform inversion algorithm with applications in option pricing |
| 390 | -- | 391 | Rudolf Müller. Book reviews |
| 391 | -- | 392 | David Hartvigsen. Book review |
| 393 | -- | 394 | Adam N. Letchford. Book review |
| 394 | -- | 397 | Gilbert Laporte. Book review |