| 1 | -- | 42 | Chaoyi Pang, Qing Zhang, Xiaofang Zhou, David P. Hansen, Sen Wang, Anthony J. Maeder. Computing Unrestricted Synopses Under Maximum Error Bound |
| 43 | -- | 59 | Jérémie Chalopin, Shantanu Das 0001, Yann Disser, Matús Mihalák, Peter Widmayer. Mapping Simple Polygons: How Robots Benefit from Looking Back |
| 60 | -- | 94 | Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak. Collecting Weighted Items from a Dynamic Queue |
| 95 | -- | 128 | Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff. Exact and Parameterized Algorithms for Max Internal Spanning Tree |
| 129 | -- | 145 | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma. Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs |
| 146 | -- | 158 | David Peleg, Liam Roditty. Relaxed Spanners for Directed Disk Graphs |
| 159 | -- | 176 | Ali Çivril, Malik Magdon-Ismail. Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix |
| 177 | -- | 205 | Kyriaki Ioannidou, Stavros D. Nikolopoulos. The Longest Path Problem Is Polynomial on Cocomparability Graphs |
| 206 | -- | 223 | Ke Yi, Qin Zhang. Optimal Tracking of Distributed Heavy Hitters and Quantiles |
| 224 | -- | 250 | Benjamin Doerr, Leslie Ann Goldberg. Adaptive Drift Analysis |