| 25 | -- | 0 | Wiebke Höhn, Tobias Jacobs. On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost |
| 26 | -- | 0 | Danny Z. Chen, Haitao Wang. Computing Shortest Paths among Curved Obstacles in the Plane |
| 27 | -- | 0 | Dániel Marx, László A. Végh. Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation |
| 28 | -- | 0 | Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx. Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable |
| 29 | -- | 0 | Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir. The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection |
| 30 | -- | 0 | Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan. Rank-Balanced Trees |
| 31 | -- | 0 | Djamal Belazzougui, Gonzalo Navarro. Optimal Lower and Upper Bounds for Representing Sequences |
| 32 | -- | 0 | Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter. Testing Planarity of Partially Embedded Graphs |
| 33 | -- | 0 | Jérémie Chalopin, Shantanu Das 0001, Yann Disser, Matús Mihalák, Peter Widmayer. Mapping Simple Polygons: The Power of Telling Convex from Reflex |
| 34 | -- | 0 | Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, Mohammad Ali Safari, Morteza Saghafian. A Bounded Budget Network Creation Game |
| 35 | -- | 0 | Noa Avigdor-Elgrabli, Yuval Rabani. An Improved Competitive Algorithm for Reordering Buffer Management |