Trees with many leaves in tournaments - Alistair Benford; Richard Montgomery (J. Comb. Theory B, 2025)

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games - Alistair Benford; Per Kristian Lehre (Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025, 2025)

Bicriteria Optimisation of Average and Worst-Case Performance Using Coevolutionary Algorithms - Alistair Benford; Markus Olhofer; Tobias Rodemann; Per Kristian Lehre (IEEE Congress on Evolutionary Computation, CEC 2024, Yokohama, Japan, June 30 - July 5, 2024, 2024)

Runtime Analysis of Coevolutionary Algorithms on a Class of Symmetric Zero-Sum Games - Alistair Benford; Per Kristian Lehre (Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024, 2024)

UK AI Conference, 22 November 2024, The Exchange, University of Birmingham, Birmingham, United Kingdom - Alistair Benford; Christian Cabrera; Sarah Kiden; Arianna Salili-James; Vincent Gbouna Zakka (PMLR, 2024)

Runtime analysis of a coevolutionary algorithm on impartial combinatorial games - Alistair Benford; Per Kristian Lehre (CoRR, 2024)

Trees with few leaves in tournaments - Alistair Benford; Richard Montgomery (J. Comb. Theory B, 2022)