| 297 | -- | 319 | John Fearnley, Paul W. Goldberg, Rahul Savani, Troels Bjerre Sørensen. Approximate Well-supported Nash Equilibria Below Two-thirds |
| 320 | -- | 343 | Jørgen Bang-Jensen, Alessandro Maddaloni, Saket Saurabh. Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments |
| 344 | -- | 380 | Abbas Mehrabian, Nick Wormald. It's a Small World for Random Surfers |
| 381 | -- | 400 | Fatemeh Rajabi-Alni, Alireza Bagheri. 2) Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension |
| 401 | -- | 425 | Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos. Planar Disjoint-Paths Completion |
| 426 | -- | 444 | Lee-Ad Gottlieb, Tyler Neylon. Matrix Sparsification and the Sparse Null Space Problem |
| 445 | -- | 473 | J. Ian Munro, Patrick K. Nicholson. Succinct Posets |
| 474 | -- | 489 | Fangqiu Han, Subhash Suri, Xifeng Yan. Observability of Lattice Graphs |
| 490 | -- | 501 | Bjarni V. Halldórsson, Magnús M. Halldórsson, Elena Losievskaja, Mario Szegedy. Streaming Algorithms for Independent Sets in Sparse Hypergraphs |
| 502 | -- | 535 | Michel Raynal, Julien Stainer, Gadi Taubenfeld. Distributed Universality |
| 536 | -- | 568 | Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Maxim Sviridenko, Yoshiko Wakabayashi. Polynomial-Time Approximation Schemes for Circle and Other Packing Problems |
| 569 | -- | 594 | Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger. Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n |