| 327 | -- | 328 | Kyung-Yong Chwa, Kunsoo Park. Guest Editorial: Special Issue on Algorithms and Computation |
| 329 | -- | 361 | Henning Meyerhenke, Thomas Sauerwald. Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning |
| 362 | -- | 383 | Maxim A. Babenko. Improved Algorithms for Even Factors and Square-Free Simple b-Matchings |
| 384 | -- | 399 | Juraj Stacho. 3-Colouring AT-Free Graphs in Polynomial Time |
| 400 | -- | 415 | Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki. Minimum Cost Partitions of Trees with Supply and Demand |
| 416 | -- | 453 | Qian-Ping Gu, Hisao Tamaki. Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size |
| 454 | -- | 480 | Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak. Computing Sparse Multiples of Polynomials |
| 481 | -- | 510 | Matthew J. Patitz, Scott M. Summers. Identifying Shapes Using Self-assembly |
| 511 | -- | 533 | Jin-yi Cai, Sangxia Huang, Pinyan Lu. From Holant to #CSP and Back: Dichotomy for Holant c Problems |