| 1 | -- | 5 | Riccardo Focardi, Flaminia L. Luccio, David Peleg. Feedback vertex set in hypercubes |
| 7 | -- | 11 | Sergei Bespamyatnikh, Michael Segal. Enumerating longest increasing subsequences and patience sorting |
| 13 | -- | 17 | Ryuhei Uehara, Zhi-Zhong Chen. Parallel approximation algorithms for maximum weighted matching in general graphs |
| 19 | -- | 24 | Tomasz Borzyszkowski. Generalized interpolation in CASL |
| 25 | -- | 32 | Lanfranco Lopriore. Protection in a single-address-space environment |
| 33 | -- | 38 | Matthias Schonlau, Martin Theus. Detecting masquerades in intrusion detection based on unpopular commands |
| 39 | -- | 44 | Joan Serra-Sagristà. Enumeration of lattice points in l::1:: norm |
| 45 | -- | 50 | Jue Xue, Ju Liu. A network-flow-based lower bound for the minimum weighted integer coloring problem |
| 51 | -- | 59 | Joep Aerts, Jan H. M. Korst, Sebastian Egner. Random duplicate storage strategies for load balancing in multimedia servers |
| 61 | -- | 66 | Jin-yi Cai, Ajay Nerurkar. A note on the non-NP-hardness of approximate lattice problems under general Cook reductions |
| 67 | -- | 73 | L. Javier García-Villalba, Amparo Fúster-Sabater. On the linear complexity of the sequences generated by nonlinear filterings |
| 75 | -- | 81 | Chu Min Li. Equivalency reasoning to solve a class of hard SAT problems |
| 83 | -- | 90 | Francesc Comellas, Javier Ozón, Joseph G. Peters. Deterministic small-world communication networks |
| 91 | -- | 94 | Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto. Evolutionary graph colouring |