| 3075 | -- | 3098 | Timothy M. Chan, Dimitrios Skrepetos. Faster Approximate Diameter and Distance Oracles in Planar Graphs |
| 3099 | -- | 3113 | Mourad Baïou, Francisco Barahona. An Algorithm to Compute the Nucleolus of Shortest Path Games |
| 3114 | -- | 3135 | Robert T. Schweller, Andrew Winslow, Tim Wylie. Nearly Constant Tile Complexity for any Shape in Two-Handed Tile Assembly |
| 3136 | -- | 3161 | Yakov Babichenko, Yuval Emek, Michal Feldman, Boaz Patt-Shamir, Ron Peretz, Rann Smorodinsky. Stable Secretaries |
| 3162 | -- | 3185 | Tobias Maier, Peter Sanders 0001, Stefan Walzer. Dynamic Space Efficient Hashing |
| 3186 | -- | 3199 | Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong. Approximately Coloring Graphs Without Long Induced Paths |
| 3200 | -- | 3216 | Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý. A Tight Lower Bound for Planar Steiner Orientation |
| 3217 | -- | 3244 | Dmitriy Katz, Baruch Schieber, Hadas Shachnai. Flexible Resource Allocation to Interval Jobs |