| 291 | -- | 318 | Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Efficient Computation of Substring Equivalence Classes with Suffix Arrays |
| 319 | -- | 339 | Lukas Folwarczny, Jirí Sgall. General Caching Is Hard: Even with Small Pages |
| 340 | -- | 367 | Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang. Convex Hulls Under Uncertainty |
| 368 | -- | 386 | Amotz Bar-Noy, Ben Baumer, Dror Rawitz. Set It and Forget It: Approximating the Set Once Strip Cover Problem |
| 387 | -- | 400 | Gregory Kucherov, Yakov Nekrich. Full-Fledged Real-Time Indexing for Constant Size Alphabets |
| 401 | -- | 427 | Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann 0001. On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs |
| 428 | -- | 443 | Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama. Efficiently Correcting Matrix Products |
| 444 | -- | 465 | Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann 0001, Chrysanthi N. Raftopoulou. The Book Thickness of 1-Planar Graphs is Constant |
| 466 | -- | 483 | Surender Baswana, Shahbaz Khan. Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs |
| 484 | -- | 508 | Karl Bringmann, Konstantinos Panagiotou. Efficient Sampling Methods for Discrete Distributions |
| 509 | -- | 529 | Stacey Jeffery, Frédéric Magniez, Ronald de Wolf. Optimal Parallel Quantum Query Algorithms |
| 530 | -- | 567 | Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexes |
| 568 | -- | 597 | Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato. Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules |
| 598 | -- | 623 | Susanne Albers, Matthias Hellwig. On the Value of Job Migration in Online Makespan Minimization |