| 129 | -- | 165 | Marcella Anselmo. A non-ambiguous decomposition of regular languages and factorizing codes |
| 167 | -- | 179 | Guiqing Li, Wenlong Su, Haipeng Luo. Edge colorings of the complete graph K149 and the lower bounds of three Ramsey numbers |
| 181 | -- | 195 | Refael Hassin, Asaf Levin. Subgraphs decomposable into two trees and k-edge-connected subgraphs |
| 197 | -- | 221 | Daniel Kobler, Udi Rotics. Edge dominating set and colorings on graphs with fixed clique-width |
| 223 | -- | 239 | Dale Peterson. Gridline graphs: a review in two dimensions and an extension to higher dimensions |
| 241 | -- | 260 | Antonio Restivo, Pedro V. Silva. Periodicity vectors for labelled trees |
| 261 | -- | 273 | Stefan Szeider. Finding paths in graphs avoiding forbidden transitions |
| 275 | -- | 289 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki. A primal-dual approximation algorithm for the survivable network design problem in hypergraphs |
| 291 | -- | 296 | Jinquan Dong, Yanpei Liu, Cun-Quan Zhang. Determination of the star valency of a graph |
| 297 | -- | 304 | Marisa Gutierrez, João Meidanis. Recognizing clique graphs of directed edge path graphs |
| 305 | -- | 312 | Kazuhisa Makino. Efficient dualization of O(log n)-term monotone disjunctive normal forms |
| 313 | -- | 322 | Shuichi Sakai, Mitsunori Togasaki, Koichi Yamazaki. A note on greedy algorithms for the maximum weighted independent set problem |