* denotes a theory paper (authors are listed in alphabetical order in theory papers, following the tradition of the theory community of computer science).

Conferences (peer reviewed)

2026

GECCO

A Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples

Joshua Knowles, Per Kristian Lehre, Shishen Lin, and 3 more authors

In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2026

Bib

@inproceedings{knowles2026gecco,
  author = {Knowles, Joshua and Lehre, Per Kristian and Lin, Shishen and Neumann, Frank and Schreiber, Janina and Zarges, Christine},
  title = {A Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples},
  booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)},
  year = {2026},
  address = {San José, Costa Rica},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}

2025

IJCAI (Oral)

Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback

Shishen Lin

In Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI), 2025

Bib

@inproceedings{lin2025ijcai,
  presentation = {Oral},
  author = {Lin, Shishen},
  title = {Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback},
  booktitle = {Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI)},
  year = {2025},
  address = {Montreal, Canada},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}

AAAI (Oral)

Towards Runtime Analysis of Population-Based Co-evolutionary Algorithms on Sparse Binary Zero-Sum Game

Per Kristian Lehre, and Shishen Lin

In Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI), 2025

Bib

@inproceedings{lin2025aaai,
  presentation = {Oral},
  author = {Lehre, Per Kristian and Lin, Shishen},
  title = {Towards Runtime Analysis of Population-Based Co-evolutionary Algorithms on Sparse Binary Zero-Sum Game},
  booktitle = {Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  address = {Philadelphia, Pennsylvania, USA},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}

2024

NeurIPS

No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation

Per Kristian Lehre, and Shishen Lin

In Proceedings of the 38th Annual Conference on Neural Information Processing Systems (NeurIPS), 2024

Bib

@inproceedings{lin2024neurips,
  author = {Lehre, Per Kristian and Lin, Shishen},
  title = {No Free Lunch Theorem and Black-Box Complexity Analysis for Adversarial Optimisation},
  booktitle = {Proceedings of the 38th Annual Conference on Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  address = {Vancouver, Canada},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}

PPSN

Overcoming Binary Adversarial Optimisation with Competitive Coevolution

Per Kristian Lehre, and Shishen Lin

In Proceedings of the 18th International Conference on Parallel Problem Solving From Nature (PPSN), 2024

Bib

@inproceedings{lin2024ppsn,
  author = {Lehre, Per Kristian and Lin, Shishen},
  title = {Overcoming Binary Adversarial Optimisation with Competitive Coevolution},
  booktitle = {Proceedings of the 18th International Conference on Parallel Problem Solving From Nature (PPSN)},
  year = {2024},
  address = {Hagenberg, Austria},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}

IJCAI (Oral)

Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms

Per Kristian Lehre, and Shishen Lin

In Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI), 2024

Bib

@inproceedings{lin2024ijcai,
  presentation = {Oral},
  author = {Lehre, Per Kristian and Lin, Shishen},
  title = {Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms},
  booktitle = {Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI)},
  year = {2024},
  address = {Jeju, South Korea},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}

2023

FOGA

Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation

Mario Alejandro Hevia Fajardo, Per Kristian Lehre, and Shishen Lin

In Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA), 2023

Bib

@inproceedings{lin2023foga,
  author = {Hevia Fajardo, Mario Alejandro and Lehre, Per Kristian and Lin, Shishen},
  title = {Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation},
  booktitle = {Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA)},
  year = {2023},
  address = {Potsdam, Germany},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}

GECCO

Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation

Mario Alejandro Hevia Fajardo, Per Kristian Lehre, and Shishen Lin

In Proceedings of the Companion Conference on Genetic and Evolutionary Computation (GECCO Companion), 2023

Bib

@inproceedings{lin2023gecco,
  author = {Hevia Fajardo, Mario Alejandro and Lehre, Per Kristian and Lin, Shishen},
  title = {Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation},
  booktitle = {Proceedings of the Companion Conference on Genetic and Evolutionary Computation (GECCO Companion)},
  year = {2023},
  address = {Lisbon, Portugal},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}

CEC

Is CC-(1+1) EA more efficient than (1+1) EA on either separable or inseparable problems?

Per Kristian Lehre, and Shishen Lin

In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 2023

Bib

@inproceedings{lin2023cec,
  author = {Lehre, Per Kristian and Lin, Shishen},
  title = {Is CC-(1+1) EA more efficient than (1+1) EA on either separable or inseparable problems?},
  booktitle = {Proceedings of the IEEE Congress on Evolutionary Computation (CEC)},
  year = {2023},
  address = {Chicago, USA},
  is_book = {false},
  is_journal = {false},
  is_conference = {true},
  theory = {true}
}