| 71 | -- | 74 | Tamanna Chhabra, Jorma Tarhio. A filtration method for order-preserving matching |
| 75 | -- | 79 | Patricia Bouyer, Patrick Gardy, Nicolas Markey. On the semantics of Strategy Logic |
| 80 | -- | 84 | Wantao Ning. The super connectivity of exchanged crossed cube |
| 85 | -- | 92 | Martin Manak, Ivana Kolingerová. Extension of the edge tracing algorithm to disconnected Voronoi skeletons |
| 93 | -- | 99 | Shuliang Sun. k correction and Huffman encoding |
| 100 | -- | 106 | Warut Suksompong, Charles E. Leiserson, Tao B. Schardl. On the efficiency of localized work stealing |
| 107 | -- | 110 | Xie-Bin Chen. Paired 2-disjoint path covers of multidimensional torus networks with faulty edges |
| 111 | -- | 115 | Christoph Haase, Stefan Kiefer. The complexity of the Kth largest subset problem and related problems |
| 116 | -- | 119 | Chik-How Tan, Theo Fanuela Prabowo, Duc-Phong Le. Breaking an ID-based encryption based on discrete logarithm and factorization problems |
| 120 | -- | 124 | Ilario Bonacina, Navid Talebanfard. Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis |
| 125 | -- | 127 | Pawel Parys. Weak containment for partial words is coNP-complete |
| 128 | -- | 135 | Mohamed Tolba, Amr M. Youssef. Generalized MitM attacks on full TWINE |
| 136 | -- | 143 | Cihangir Tezcan, Ali Aydin Selçuk. Improved improbable differential attacks on ISO standard CLEFIA: Expansion technique revisited |
| 144 | -- | 146 | Jethro G. Beekman. A Denial of Service attack against fair computations using Bitcoin deposits |
| 147 | -- | 152 | Robert Bredereck, Nimrod Talmon. NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting |
| 153 | -- | 156 | Vladimir Edemskiy, A. Palvinskiy. The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation |
| 157 | -- | 162 | Sergey Kitaev, Vincent Vajnovszki. Mahonian STAT on words |
| 163 | -- | 167 | Jun Yuan, Aixia Liu. Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected |
| 168 | -- | 170 | Mun-Kyu Lee, Pierre Michaud, Jeong Seop Sim, DaeHun Nyang. A simple proof of optimality for the MIN cache replacement policy |
| 171 | -- | 174 | Gelin Zhou. Two-dimensional range successor in optimal time and almost linear space |
| 175 | -- | 178 | Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Adnan Sljoka. Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs |
| 179 | -- | 182 | Meena Mahajan, Nitin Saurabh, Sébastien Tavenas. VNP=VP in the multilinear world |
| 183 | -- | 191 | Wen-Chung Kuo, Chun-Cheng Wang, Hong-Ching Hou. Signed digit data hiding scheme |
| 192 | -- | 196 | Oualid Benamara, Fatiha Merazka, Kamel Betina. An improvement of a cryptanalysis algorithm |
| 197 | -- | 202 | Sukhamay Kundu, Subhashis Majumder. A linear time algorithm for optimal k-hop dominating set of a tree |
| 203 | -- | 215 | Sheng-Yi Jiang, Lian-xi Wang. Efficient feature selection based on correlation measure between continuous and discrete features |
| 216 | -- | 0 | Alexander Chane Shiau, Tzong-Huei Shiau, Yue-Li Wang. Corrigendum to "Incidence coloring of Cartesian product graphs" [Inf. Process. Lett. (2015) 765-768] |