| 865 | -- | 866 | Zhipeng Cai, Alexander Zelikovsky. Computing and Combinatorics |
| 867 | -- | 889 | Jianer Chen, Feng Shi, Jianxin Wang. Approximating Maximum Agreement Forest on Multiple Binary Trees |
| 890 | -- | 909 | Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah. Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation |
| 910 | -- | 931 | Eli Fox-Epstein, Csaba D. Tóth, Andrew Winslow. Diffuse Reflection Radius in a Simple Polygon |
| 932 | -- | 934 | Alfredo Viola. Preface-S.I.: LATIN 2014 |
| 935 | -- | 960 | Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou. A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters |
| 961 | -- | 988 | Volker Diekert, Alexei G. Myasnikov, Armin Weiß. Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits |
| 989 | -- | 1034 | Nicolas Basset. Counting and Generating Permutations in Regular Classes |
| 1035 | -- | 1076 | Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba. 2-Xor Revisited: Satisfiability and Probabilities of Functions |
| 1077 | -- | 1096 | Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds |
| 1097 | -- | 1105 | Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin. Biased Predecessor Search |
| 1106 | -- | 1138 | Antoine Genitrini, Cécile Mailler. Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability |
| 1139 | -- | 1157 | Mário César San Felice, David P. Williamson, Orlando Lee. A Randomized O(log n)-Competitive Algorithm for the Online Connected Facility Location Problem |
| 1158 | -- | 1159 | Hee-Kap Ahn, Chan-Su Shin. Guest Editor's Foreword |
| 1160 | -- | 1180 | Alex Gavryushkin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu. Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals |
| 1181 | -- | 1202 | Pål Grønås Drange, Markus S. Dregi, Pim van 't Hof. On the Computational Complexity of Vertex Integrity and Component Order Connectivity |
| 1203 | -- | 1223 | Daniel Kane, Osamu Watanabe. A Short Implicant of a CNF Formula with Many Satisfying Assignments |
| 1224 | -- | 1244 | Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu. Faster Algorithms for Computing the R* Consensus Tree |
| 1245 | -- | 1263 | Ei Ando, Shuji Kijima. An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution |
| 1264 | -- | 1275 | Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman. The Power and Limitations of Static Binary Search Trees with Lazy Finger |