- Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak. Collision-free network exploration. J. Comput. Syst. Sci., 86:70-81, 2017.
- Michael Benedikt, Joost Engelfriet, Sebastian Maneth. Determinacy and rewriting of functional top-down and MSO tree transformations. J. Comput. Syst. Sci., 85:57-73, 2017.
- Jacob Turner. Tensors masquerading as matchgates: Relaxing planarity restrictions on Pfaffian circuits. J. Comput. Syst. Sci., 86:108-116, 2017.
- Bart M. P. Jansen. Turing kernelization for finding long paths and cycles in restricted graph classes. J. Comput. Syst. Sci., 85:18-37, 2017.
- Stephan Holzer, Thomas Locher, Yvonne Anne Pignolet, Roger Wattenhofer. Deterministic multi-channel information exchange. J. Comput. Syst. Sci., 87:84-103, 2017.
- Bart Kuijpers, Bart Moelans. On the realisability of double-cross matrices by polylines in the plane. J. Comput. Syst. Sci., 86:117-135, 2017.
- Lila Kari, Steffen Kopecki. Deciding whether a regular language is generated by a splicing system. J. Comput. Syst. Sci., 84:263-287, 2017.
- Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar. Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci., 84:219-242, 2017.
- Hugo Férée. Game semantics approach to higher-order complexity. J. Comput. Syst. Sci., 87:1-15, 2017.
- Sven Schewe. Solving parity games in big steps. J. Comput. Syst. Sci., 84:243-262, 2017.