| 257 | -- | 276 | Andreas Maletti, Catalin Ionut Tîrnauca. Properties of Quasi-Relabeling Tree Bimorphisms |
| 277 | -- | 287 | Oliver Friedmann. The Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time |
| 289 | -- | 309 | Henning Schnoor. The Complexity of Model Checking for Boolean Formulas |
| 311 | -- | 319 | Aysun Ozan Aytaç, Zeynep Nihan Odabas. Computing the rupture Degree in Composite Graphs |
| 321 | -- | 327 | Yen-Wu Ti, Ching-Lueh Chang, Yuh-Dauh Lyuu, Alexander Shen. Sets of k-Independent Strings |
| 329 | -- | 344 | Mihaela Paun, Nichamon Naksinehaboon, Raja Nassar, Chokchai Leangsuksun, Stephen L. Scott, Narate Taerat. Incremental Checkpoint Schemes for Weibull Failure Distribution |
| 345 | -- | 356 | Andrzej Ehrenfeucht, Michael G. Main, Grzegorz Rozenberg. Combinatorics of Life and Death for Reaction Systems |
| 357 | -- | 383 | Hans Kellerer, Vitaly A. Strusevich. Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack |
| 385 | -- | 386 | Jacir Luiz Bordim, Akihiro Fujiwara, Koji Nakano. Preface |
| 387 | -- | 404 | Martti Forsell. On the Performance and Cost of Some PRAM Models on CMP Hardware |
| 405 | -- | 425 | Yasuaki Ito, Koji Nakano. Low-Latency Connected Component Labeling Using an FPGA |
| 427 | -- | 440 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita. The Space Complexity of Leader Election in Anonymous Networks |
| 441 | -- | 457 | Stefan D. Bruda, Yuanqiao Zhang. Collapsing the Hierarchy of Parallel Computational Models |
| 459 | -- | 476 | Sayaka Kamei, Hirotsugu Kakugawa. A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set |