| 385 | -- | 405 | Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, Ulrike Stege. A refined search tree technique for Dominating Set on planar graphs |
| 406 | -- | 439 | Narayan Vikas. A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results |
| 440 | -- | 466 | Jonathan Goldstine, Hing Leung, Detlef Wotschke. Measuring nondeterminism in pushdown automata |
| 467 | -- | 479 | Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons |
| 480 | -- | 494 | Mehmet Hakan Karaata. An optimal self-stabilizing strarvation-free alternator |
| 495 | -- | 505 | Stavros G. Kolliopoulos, Neal E. Young. Approximation algorithms for covering/packing integer programs |
| 506 | -- | 519 | Juha Honkala. An ::::n:::::::2:::-bound for the ultimate equivalence problem of certain D0L systems over an ::::n::::-letter alphabet |
| 520 | -- | 534 | Philipp Woelfel. Bounds on the OBDD-size of integer multiplication via universal hashing |
| 535 | -- | 575 | Roberta Gori, Giorgio Levi. On the verification of finite failure |