| 1093 | -- | 1114 | Jaroslaw Byrka, Thomas Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh. An Improved Approximation Algorithm for Knapsack Median Using Sparsification |
| 1115 | -- | 1145 | George Christodoulou 0001, Alkmini Sgouritsa, Bo Tang. On the Efficiency of All-Pay Mechanisms |
| 1146 | -- | 1169 | Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca. Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques |
| 1170 | -- | 1190 | Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff. Approximating the Generalized Minimum Manhattan Network Problem |
| 1191 | -- | 1213 | Wiebke Höhn, Julián Mestre, Andreas Wiese. How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions |
| 1214 | -- | 1277 | Thomas Bläsius, Annette Karrer, Ignaz Rutter. Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices |
| 1278 | -- | 1297 | David Eppstein, Daniel S. Hirschberg. From Discrepancy to Majority |
| 1298 | -- | 1314 | Ulrich Faigle, Walter Kern, Britta Peis. Greedy Oriented Flows |
| 1315 | -- | 1329 | Xiaocheng Hu, Yufei Tao, Yi Yang, Shuigeng Zhou. Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened |
| 1330 | -- | 1356 | Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. r |
| 1357 | -- | 1382 | Klaus Jansen, Kati Land, Marten Maack. Estimating the Makespan of the Two-Valued Restricted Assignment Problem |
| 1383 | -- | 1409 | Cameron T. Chalk, Eric Martinez, Robert T. Schweller, Luis Vega, Andrew Winslow, Tim Wylie. Optimal Staged Self-Assembly of General Shapes |