Is CC-(1+1) EA More Efficient than (1+1) EA on Separable and Inseparable Problems? - Per Kristian Lehre; Shishen Lin (CEC, 2023)

Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation. - Mario Alejandro Hevia Fajardo; Per Kristian Lehre; Shishen Lin (FOGA, 2023)

Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms. - Per Kristian Lehre; Shishen Lin (IJCAI, 2024)

No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation. - Per Kristian Lehre; Shishen Lin (NeurIPS, 2024)

Overcoming Binary Adversarial Optimisation with Competitive Coevolution. - Per Kristian Lehre; Shishen Lin (PPSN (3), 2024)

Towards Runtime Analysis of Population-Based Co-evolutionary Algorithms on Sparse Binary Zero-Sum Game. - Per Kristian Lehre; Shishen Lin (AAAI, 2025)

Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback. - Shishen Lin (CoRR, 2025)