1. Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
2. Golnaz Badkobeh , Per Kristian Lehre, and Dirk Sudholt . 2015 . Black-box Complexity of Parallel Search with Distributed Populations. In Proceedings of the Foundations of Genetic Algorithms (FOGA'15). ACM Press , 3--15. Golnaz Badkobeh, Per Kristian Lehre, and Dirk Sudholt. 2015. Black-box Complexity of Parallel Search with Distributed Populations. In Proceedings of the Foundations of Genetic Algorithms (FOGA'15). ACM Press, 3--15.
3. Aharon Ben-Tal , Laurent El Ghaoui, and Arkadi Nemirovski . 2009 . Robust Optimization. Princeton University Press . Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski. 2009. Robust Optimization. Princeton University Press.
4. Better Running Time of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) by Using Stochastic Tournament Selection
5. Chao Bian , Chao Qian , Yang Yu , and Ke Tang . 2021. On the Robustness of Median Sampling in Noisy Evolutionary Optimization. Science China Information Sciences 64, 5 ( 2021 ). Chao Bian, Chao Qian, Yang Yu, and Ke Tang. 2021. On the Robustness of Median Sampling in Noisy Evolutionary Optimization. Science China Information Sciences 64, 5 (2021).