| 971 | -- | 994 | Reut Levi, Ronitt Rubinfeld, Anak Yodpinyanee. Local Computation Algorithms for Graphs of Non-constant Degrees |
| 995 | -- | 1021 | Carlo Comin, Romeo Rizzi. Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games |
| 1022 | -- | 1059 | Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati. Strip Planarity Testing for Embedded Planar Graphs |
| 1060 | -- | 1070 | Piotr Micek, Veit Wiechert. An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths |
| 1071 | -- | 1104 | Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil. Extending Partial Representations of Proper and Unit Interval Graphs |
| 1105 | -- | 1127 | Reuven Bar-Yehuda, Michael Beder, Dror Rawitz. A Constant Factor Approximation Algorithm for the Storage Allocation Problem |
| 1128 | -- | 1142 | Yusuke Kobayashi, Sho Toyooka. Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation |
| 1143 | -- | 1158 | Ioannis Caragiannis, Angelo Fanelli 0001, Nick Gravin. Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games |
| 1159 | -- | 1193 | GaHyun Park. A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds |
| 1194 | -- | 1215 | Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter. Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet |
| 1216 | -- | 1239 | Rajesh Chitnis, Hossein Esfandiari, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin. A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands |
| 1240 | -- | 1282 | David Furcy, Samuel Micka, Scott M. Summers. Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D |
| 1283 | -- | 1302 | Andreas Brandstädt, Raffaele Mosca. 8 -Free Graphs in Polynomial Time |