- Karthik C. S.. Did the train reach its destination: The complexity of finding a witness. Inf. Process. Lett., 121:17-21, 2017.
- Michael Brand. Small polyomino packing. Inf. Process. Lett., 126:30-34, 2017.
- Chang-Hsiung Tsai, Jheng-Cheng Chen. Diagnosable evaluation of enhanced optical transpose interconnection system networks. Inf. Process. Lett., 118:105-109, 2017.
- Weihua Yang, Shuli Zhao, Shurong Zhang. Strong Menger connectivity with conditional faults of folded hypercubes. Inf. Process. Lett., 125:30-34, 2017.
- Alan M. Frieze, Michael Anastos. Randomly coloring simple hypergraphs with fewer colors. Inf. Process. Lett., 126:39-42, 2017.
- Yi-Jun Chang, Hsu-Chun Yen. Area-universal drawings of biconnected outerplane graphs. Inf. Process. Lett., 118:1-5, 2017.
- Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko. The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. Inf. Process. Lett., 118:6-9, 2017.
- Alberto Giudici, Pascal Halffmann, Stefan Ruzika, Clemens Thielen. Approximation schemes for the parametric knapsack problem. Inf. Process. Lett., 120:11-15, 2017.
- Zhao Zhang, Xiaoting Li, Yishuo Shi, Hongmei Nie, Yuqing Zhu. PTAS for minimum k-path vertex cover in ball graph. Inf. Process. Lett., 119:9-13, 2017.
- Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim. Simple DFS on the complement of a graph and on partially complemented digraphs. Inf. Process. Lett., 117:35-39, 2017.