| 309 | -- | 335 | Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt. Certifying 3-Edge-Connectivity |
| 336 | -- | 348 | Philip Bille, Patrick Hagge Cording, Inge Li Gørtz. Compressed Subsequence Matching and Packed Tree Coloring |
| 349 | -- | 373 | Rom Aschner, Matthew J. Katz. Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints |
| 374 | -- | 388 | Roberto Solis-Oba, Paul Bonsma, Stefanie Lowski. A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves |
| 389 | -- | 425 | Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri 0001. Resilient Dynamic Programming |
| 426 | -- | 439 | Hung-Lung Wang. An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree |
| 440 | -- | 458 | Ari Freund. Improved Subquadratic 3SUM |
| 459 | -- | 486 | Troy Lee, Frédéric Magniez, Miklos Santha. Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing |
| 487 | -- | 514 | Argyrios Deligkas, John Fearnley, Rahul Savani, Paul G. Spirakis. Computing Approximate Nash Equilibria in Polymatrix Games |
| 515 | -- | 536 | S. Anand 0002, Karl Bringmann, Tobias Friedrich 0001, Naveen Garg, Amit Kumar 0001. Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines |
| 537 | -- | 554 | Benjamin Hescott, Caleb Malchik, Andrew Winslow. Tight Bounds for Active Self-Assembly Using an Insertion Primitive |
| 555 | -- | 594 | Pasin Manurangsi, Dana Moshkovitz. Improved Approximation Algorithms for Projection Games |
| 595 | -- | 618 | Lisa Hellerstein, Özgür Özkan, Linda Sellie. Max-Throughput for (Conservative) k-of-n Testing |