| 111 | -- | 0 | . Editorial Note |
| 112 | -- | 124 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto. Derandomizing the HSSW Algorithm for 3-SAT |
| 125 | -- | 141 | Huy Hoang Do, Wing-Kin Sung. Compressed Directed Acyclic Word Graph with Application in Local Alignment |
| 142 | -- | 160 | Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker. FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time |
| 161 | -- | 179 | Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou. On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms |
| 180 | -- | 206 | Narayan Vikas. Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction |
| 207 | -- | 233 | Steven M. Kautz, Brad Shutters. Self-Assembling Rulers for Approximating Generalized Sierpinski Carpets |
| 234 | -- | 246 | Lauri Ahlroth, Olli Pottonen, André Schumacher. Approximately Uniform Online Checkpointing with Bounded Memory |
| 247 | -- | 276 | Vikraman Arvind, Johannes Köbler. The Parallel Complexity of Graph Canonization Under Abelian Group Action |
| 277 | -- | 292 | Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai. On Total Unimodularity of Edge-Edge Adjacency Matrices |