297 | -- | 317 | Daniel Berend, Amir Sapir. The cyclic multi-peg Tower of Hanoi |
318 | -- | 334 | Michael Drmota, Helmut Prodinger. The register function for ::::t::::-ary trees |
335 | -- | 363 | Lukasz Kowalik, Maciej Kurowski. Oracles for bounded-length shortest paths in planar graphs |
364 | -- | 379 | Irit Katriel, Hans Leo Bodlaender. Online topological ordering |
380 | -- | 402 | Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar. Optimal constrained graph exploration |
403 | -- | 415 | Venkatesh Raman, Saket Saurabh, C. R. Subramanian. Faster fixed parameter tractable algorithms for finding feedback vertex sets |
416 | -- | 434 | Klaus Jansen, Hu Zhang. An approximation algorithm for scheduling malleable tasks under general precedence constraints |
435 | -- | 472 | Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright. Secure multiparty computation of approximations |
473 | -- | 489 | David S. Johnson. The NP-completeness column: The many limits on approximation |