| 1107 | -- | 1108 | Nikhil Bansal, Irene Finocchi. Guest Editors' Foreword |
| 1109 | -- | 1130 | Kyle Genova, David P. Williamson. An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem |
| 1131 | -- | 1150 | Anna Großwendt, Heiko Röglin. Improved Analysis of Complete-Linkage Clustering |
| 1151 | -- | 1181 | Daniel Graf. How to Sort by Walking and Swapping on Paths and Trees |
| 1182 | -- | 1205 | Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket. On the Approximability of Digraph Ordering |
| 1206 | -- | 1224 | Éric Colin de Verdière. Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals |
| 1225 | -- | 1245 | Michael Dinitz, Michael Schapira, Asaf Valadarsky. Explicit Expanding Expanders |
| 1246 | -- | 1262 | Yossi Azar, Oren Gilon. Scheduling with Deadlines and Buffer Management with Processing Requirements |
| 1263 | -- | 1283 | Rasmus Pagh, Ninh Pham, Francesco Silvestri 0001, Morten Stöckel. I/O-Efficient Similarity Join |