| 1293 | -- | 1334 | Mingyu Xiao 0001, Sen Huang, Xiaoyu Chen. Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs |
| 1335 | -- | 1364 | Yuefang Lian, Donglei Du, Xiao Wang, Dachuan Xu, Yang Zhou 0018. Stochastic Variance Reduction for DR-Submodular Maximization |
| 1365 | -- | 1399 | Julien Courtiel, Paul Dorbec, Romain Lecoq. Theoretical Analysis of Git Bisect |
| 1400 | -- | 1427 | Mingyang Gong, Zhi-Zhong Chen, Kuniteru Hayashi. Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time |
| 1428 | -- | 1474 | Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale. Domination and Cut Problems on Chordal Graphs with Bounded Leafage |
| 1475 | -- | 1511 | Ajinkya Gaikwad, Soumen Maity. On Structural Parameterizations of the Harmless Set Problem |
| 1512 | -- | 1544 | Sergio Cabello, David Gajser. Connectivity with Uncertainty Regions Given as Line Segments |
| 1545 | -- | 1577 | Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour. Approximations for Throughput Maximization |
| 1578 | -- | 1599 | Philip Bille, Inge Li Gørtz, Tord Stordalen. Predecessor on the Ultra-Wide Word RAM |
| 1600 | -- | 1622 | Michal Feldman, Federico Fusco, Stefano Leonardi 0001, Simon Mauras, Rebecca Reiffenhäuser. Truthful Matching with Online Items and Offline Agents |
| 1623 | -- | 1656 | Shyan Akmal, Ce Jin 0001. An Efficient Algorithm for All-Pairs Bounded Edge Connectivity |
| 1657 | -- | 1699 | Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel 0001, Saket Saurabh 0001. Improved FPT Algorithms for Deletion to Forest-Like Structures |
| 1700 | -- | 1729 | Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, Denis Pankratov. Exploration of High-Dimensional Grids by Finite State Machines |