An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics Henry BamburyAntoine BultelBenjamin Doerr OriginalPaper 23 May 2022 Pages: 1 - 32
Analysis of Surrogate-Assisted Information-Geometric Optimization Algorithms Youhei Akimoto OriginalPaper 22 December 2022 Pages: 33 - 63
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem Benjamin DoerrAmirhossein RajabiCarsten Witt Research Open access 22 July 2023 Pages: 64 - 89
Runtime Analysis for Permutation-based Evolutionary Algorithms Benjamin DoerrYassine GhannaneMarouane Ibn Brahim OriginalPaper 26 July 2023 Pages: 90 - 129
A Semi Brute-Force Search Approach for (Balanced) Clustering Yicheng XuVincent ChauYifei Zou OriginalPaper 01 August 2023 Pages: 130 - 146
Extended MSO Model Checking via Small Vertex Integrity Tatsuya GimaYota Otachi OriginalPaper 08 August 2023 Pages: 147 - 170
Fully Dynamic k-Center Clustering with Outliers T.-H. Hubert ChanSilvio LattanziBo Wang OriginalPaper 10 August 2023 Pages: 171 - 193
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs Giulia PunziAlessio ConteRomeo Rizzi OriginalPaper 11 August 2023 Pages: 194 - 217
The Need for Seed (in the Abstract Tile Assembly Model) Andrew AlsethMatthew J. Patitz OriginalPaper 11 August 2023 Pages: 218 - 280
Computing and Listing Avoidable Vertices and Paths Charis PapadopoulosAthanasios E. Zisis OriginalPaper Open access 04 September 2023 Pages: 281 - 306
On Parameterized Complexity of Binary Networked Public Goods Game Arnab MaitiPalash Dey OriginalPaper 28 September 2023 Pages: 307 - 333
Computing Generalized Convolutions Faster Than Brute Force Barış Can EsmerAriel KulikKarol Węgrzycki OriginalPaper Open access 06 October 2023 Pages: 334 - 366