| 2017 | The Parameterized Complexity of Happy Colorings. | Neeldhara Misra, I. Vinod Reddy |
| 2017 | Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem. | Robin Milosz, Sylvie Hamel |
| 2017 | Fully Leafed Tree-Like Polyominoes and Polycubes. | Alexandre Blondin Mass, Julien de Carufel, Alain Goupil, Maxime Samson |
| 2017 | Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem. | Sven Mallach |
| 2017 | Graph Parameters and Ramsey Theory. | Vadim V. Lozin |
| 2017 | The School Bus Routing Problem: An Analysis and Algorithm. | Rhydian Lewis, Kate Smith-Miles, Kyle Phillips |
| 2017 | Minimal Sum Labeling of Graphs. | Matej Konecn, Stanislav Kucera, Jana Novotn, Jakub Pekrek, Stepn Simsa, Martin Tpfer |
| 2017 | Combinatorial Algorithms and Methods for Security of Statistical Databases Related to the Work of Mirka Miller. | Andrei Kelarev, Jennifer Seberry, Leanne Rylands, Xun Yi |
| 2017 | Improved Lower Bound on Broadcast Function Based on Graph Partition. | Hovhannes A. Harutyunyan, Zhiyuan Li |
| 2017 | Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements. | Hanyu Gu, Julia Memar, Yakov Zinder |
| 2017 | On the Power Domination Number of de Bruijn and Kautz Digraphs. | Cyriac Grigorious, Thomas Kalinowski, Sudeep Stephen |
| 2017 | Extremal Kernelization: A Commemorative Paper. | Henning Fernau |
| 2017 | Combinatorial Questions: How Can Graph Labelling Help? | Diane M. Donovan, Thomas A. McCourt |
| 2017 | Privacy-Preserving and Co-utile Distributed Social Credit. | Josep Domingo-Ferrer |
| 2017 | Improved Complexity for Power Edge Set Problem. | Benot Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller |
| 2017 | Approximation Results for the Incremental Knapsack Problem. | Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia |
| 2017 | Complexity Dichotomies for the Minimum ℱ -Overlay Problem. | Nathann Cohen, Frdric Havet, Dorian Mazauric, Ignasi Sau, Rmi Watrigant |
| 2017 | On the Maximum Crossing Number. | Markus Chimani, Stefan Felsner, Stephen G. Kobourov, Torsten Ueckerdt, Pavel Valtr, Alexander Wolff |
| 2017 | A Multi-start Heuristic for Multiplicative Depth Minimization of Boolean Circuits. | Sergiu Carpov, Pascal Aubry, Renaud Sirdey |
| 2017 | A Construction for 0, 1, -1 Orthogonal Matrices Visualized. | Nikolay A. Balonin, Jennifer Seberry |
| 2017 | Entire H-irregularity Strength of Plane Graphs. | Martin Baca, Nurdin Hinding, Aisha Javed, Andrea Semanicov-Fenovckov |
| 2017 | Recent Advances of Palindromic Factorization. | Mai Alzamel, Costas S. Iliopoulos |
| 2017 | How to Answer a Small Batch of RMQs or LCA Queries in Practice. | Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis |
| 2017 | Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. | Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra |
| 2017 | Holes in 2-Convex Point Sets. | Oswin Aichholzer, Martin Balko, Thomas Hackl, Alexander Pilz, Pedro Ramos, Pavel Valtr, Birgit Vogtenhuber |