| 163 | -- | 164 | Yoshio Okamoto. Guest Editorial: Selected Papers from ISAAC 2017 |
| 165 | -- | 187 | Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt 0001. Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces |
| 188 | -- | 211 | Yu Yokoi. Envy-Free Matchings with Lower Quotas |
| 212 | -- | 244 | Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming |
| 245 | -- | 259 | Edvin Berglin, Gerth Stølting Brodal. A Simple Greedy Algorithm for Dynamic Graph Orientation |
| 260 | -- | 278 | Michel Habib, Lalla Mouatadid. Maximum Induced Matching Algorithms via Vertex Ordering Characterizations |
| 279 | -- | 299 | Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner |
| 300 | -- | 315 | Vincenzo Bonifaci. On the Convergence Time of a Natural Dynamics for Linear Programming |
| 316 | -- | 337 | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich. Fast Compressed Self-indexes with Deterministic Linear-Time Construction |
| 338 | -- | 354 | Casper Benjamin Freksen, Kasper Green Larsen. On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms |
| 355 | -- | 384 | Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel. Crossing Number for Graphs with Bounded Pathwidth |