| 509 | -- | 523 | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay. Isomorphism and canonization of tournaments and hypertournaments |
| 524 | -- | 531 | Faisal N. Abu-Khzam. A kernelization algorithm for d-Hitting Set |
| 532 | -- | 537 | Joachim Wehler. Simplified proof of the blocking theorem for free-choice Petri nets |
| 538 | -- | 560 | Bart Kuijpers, Walied Othman. Trajectory databases: Data models, uncertainty and complete query languages |
| 561 | -- | 578 | Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor. Generalized modal satisfiability |
| 579 | -- | 592 | Hubie Chen, Omer Giménez. Causal graphs and structurally restricted planning |
| 593 | -- | 608 | Henning Fernau, Michael Kaufmann, Mathias Poths. Comparing trees via crossing minimization |
| 609 | -- | 633 | Miroslav Ciric, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic. Fuzzy relation equations and reduction of fuzzy automata |
| 634 | -- | 649 | Miki Hermann, Reinhard Pichler. Counting complexity of propositional abduction |
| 650 | -- | 662 | Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem |
| 663 | -- | 685 | Jesús Arias-Fisteus, Norberto Fernández García, Luis Sánchez Fernández, Carlos Delgado Kloos. Hashing and canonicalizing Notation 3 graphs |
| 686 | -- | 696 | S. Muthukrishnan, Gopal Pandurangan. Thresholding random geometric graph properties motivated by ad hoc sensor networks |