| 16 | -- | 0 | Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen. st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time |
| 17 | -- | 0 | Stefanie Gerke, Konstantinos Panagiotou, Justus Schwartz, Angelika Steger. Maximizing the Minimum Load for Random Processing Times |
| 18 | -- | 0 | Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder. Time Complexity of Link Reversal Routing |
| 19 | -- | 0 | Glencora Borradaile, Philip N. Klein, Claire Mathieu. A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest |
| 20 | -- | 0 | Artur Jez. Faster Fully Compressed Pattern Matching by Recompression |
| 21 | -- | 0 | Yixin Cao, Dániel Marx. Interval Deletion Is Fixed-Parameter Tractable |
| 22 | -- | 0 | Sebastian Wild, Markus E. Nebel, Ralph Neininger. Average Case and Distributional Analysis of Dual-Pivot Quicksort |
| 23 | -- | 0 | Inge Li Gørtz, Viswanath Nagarajan, R. Ravi. Minimum Makespan Multi-Vehicle Dial-a-Ride |
| 24 | -- | 0 | Reut Levi, Dana Ron. A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor |