| 2739 | -- | 2765 | Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh. Online Geometric Covering and Piercing |
| 2766 | -- | 2785 | Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev. Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle |
| 2786 | -- | 2821 | Joan Boyar, Lene M. Favrholdt, Kim S. Larsen. Online Unit Profit Knapsack with Predictions |
| 2822 | -- | 2844 | David G. Harris 0001. Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication |
| 2845 | -- | 2884 | Bengt J. Nilsson, Eli Packer. Approximation Algorithms for the Two-Watchman Route in a Simple Polygon |
| 2885 | -- | 2928 | Jelle J. Oostveen, Erik Jan van Leeuwen. Parameterized Complexity of Streaming Diameter and Connectivity Problems |
| 2929 | -- | 2958 | Amirhossein Rajabi, Carsten Witt. Stagnation Detection in Highly Multimodal Fitness Landscapes |
| 2959 | -- | 2996 | Irvan Jahja, Haifeng Yu. Sublinear Algorithms in T-Interval Dynamic Networks |
| 2997 | -- | 3026 | Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld. New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling |
| 3027 | -- | 3053 | David Eppstein. Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time |
| 3054 | -- | 3078 | József Balogh, Felix Christian Clemen, Adrian Dumitrescu. On a Traveling Salesman Problem for Points in the Unit Cube |