| 907 | -- | 943 | Xiangyu Guo, Shi Li 0001, Kelin Luo, Yuhao Zhang 0001. Minimizing the Maximum Flow Time in the Online Food Delivery Problem |
| 944 | -- | 1005 | Leslie Ann Goldberg, Marc Roth. Parameterised and Fine-Grained Subgraph Counting, Modulo 2 |
| 1006 | -- | 1030 | Ishay Haviv. On Finding Constrained Independent Sets in Cycles |
| 1031 | -- | 1056 | Tomasz Kociumaka, Gonzalo Navarro 0001, Francisco Olivares. Near-Optimal Search Time in δ-Optimal Space, and Vice Versa |
| 1057 | -- | 1079 | Sumanta Ghosh, Rohit Gurjar, Roshan Raj. A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision |
| 1080 | -- | 1134 | Benjamin Qi. On Maximizing Sums of Non-monotone Submodular and Linear Functions |
| 1135 | -- | 1162 | Liting Huang, Wei Yu, Zhaohui Liu. Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants |
| 1163 | -- | 1172 | Joanna Raczek. Complexity Issues on of Secondary Domination Number |
| 1173 | -- | 1209 | Moran Feldman, Ariel Szarf. Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model |
| 1210 | -- | 1245 | Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop. Server Cloud Scheduling |
| 1246 | -- | 1262 | Liad Blumrosen, Shahar Dobzinski. Combinatorial Reallocation Mechanisms |
| 1263 | -- | 1292 | Miriam Münch, Ignaz Rutter, Peter Stumpf. Partial and Simultaneous Transitive Orientations via Modular Decompositions |