- Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia. Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms, 52:55-69, 2018.
- Ryan McIntyre, Michael Soltys. An improved upper bound and algorithm for clique covers. J. Discrete Algorithms, 48:42-56, 2018.
- Hanyu Gu, Alexander Kononov, Julia Memar, Yakov Zinder. Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms, 52:143-155, 2018.
- Andrei Kelarev, Joe Ryan 0001, Leanne Rylands, Jennifer Seberry, Xun Yi. Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller. J. Discrete Algorithms, 52:112-121, 2018.
- Cheol Ryu, Kunsoo Park. Improved pattern-scan-order algorithms for string matching. J. Discrete Algorithms, 49:27-36, 2018.
- Matthias Gallé, Matías Tealdi. xkcd-repeats: A new taxonomy of repeats defined by their context diversity. J. Discrete Algorithms, 48:1-16, 2018.
- Ghada Ben Hassine, Pierre Bergé, Arpad Rimmel, Joanna Tomasik. A lower bound for weak Schur numbers with a deterministic algorithm. J. Discrete Algorithms, 51:12-25, 2018.
- Rhyd Lewis, Kate Smith-Miles. A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems. J. Discrete Algorithms, 52:2-17, 2018.
- Robin Milosz, Sylvie Hamel. Exploring the median of permutations problem. J. Discrete Algorithms, 52:92-111, 2018.
- Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza. Tropical dominating sets in vertex-coloured graphs. J. Discrete Algorithms, 48:27-41, 2018.