| 1 | -- | 32 | Henry Bambury, Antoine Bultel, Benjamin Doerr. An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics |
| 33 | -- | 63 | Youhei Akimoto. Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms |
| 64 | -- | 89 | Benjamin Doerr, Amirhossein Rajabi, Carsten Witt. Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem |
| 90 | -- | 129 | Benjamin Doerr, Yassine Ghannane, Marouane Ibn Brahim. Runtime Analysis for Permutation-based Evolutionary Algorithms |
| 130 | -- | 146 | Yicheng Xu, Vincent Chau, Chenchen wu, Yong Zhang 0001, Vassilis Zissimopoulos, Yifei Zou. A Semi Brute-Force Search Approach for (Balanced) Clustering |
| 147 | -- | 170 | Tatsuya Gima, Yota Otachi. Extended MSO Model Checking via Small Vertex Integrity |
| 171 | -- | 193 | T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang. Fully Dynamic k-Center Clustering with Outliers |
| 194 | -- | 217 | Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi. Refined Bounds on the Number of Eulerian Tours in Undirected Graphs |
| 218 | -- | 280 | Andrew Alseth, Matthew J. Patitz. The Need for Seed (in the Abstract Tile Assembly Model) |
| 281 | -- | 306 | Charis Papadopoulos, Athanasios E. Zisis. Computing and Listing Avoidable Vertices and Paths |
| 307 | -- | 333 | Arnab Maiti, Palash Dey. On Parameterized Complexity of Binary Networked Public Goods Game |
| 334 | -- | 366 | Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki. Computing Generalized Convolutions Faster Than Brute Force |