| 193 | -- | 197 | Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger. On-line scheduling on a single machine: maximizing the number of early jobs |
| 199 | -- | 207 | S. Thomas McCormick, Akiyoshi Shioura. Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks |
| 209 | -- | 214 | Amir Beck, Marc Teboulle. A probabilistic result for the max-cut problem on random graphs |
| 215 | -- | 221 | Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger. Semi-online scheduling with decreasing job sizes |
| 223 | -- | 227 | Andrzej Czygrinow. Maximum dispersion problem in dense graphs |
| 229 | -- | 234 | Ülkü Gürler, Mustafa Ç. Pinar, Mohamed Mehdi Jelassi. On closed-form solutions of a resource allocation problem in parallel funding of R&D projects |
| 235 | -- | 241 | Soohan Ahn, Gyemin Lee, Jongwoo Jeon. Analysis of the M/D/1-type queue based on an integer-valued first-order autoregressive process |