Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise. - Chao Qian 001; Chao Bian 002; Wu Jiang; Ke Tang 001 (GECCO, 2017)

A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms. - Chao Bian 002; Chao Qian 001; Ke Tang 001 (IJCAI, 2018)

Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise Noise. - Chao Bian 002; Chao Qian 001; Ke Tang 001 (PPSN (2), 2018)

Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise. - Chao Qian 001; Chao Bian 002; Wu Jiang; Ke Tang 001 (Algorithmica, 2019)

Running Time Analysis of the (1+1)-EA for Robust Linear Optimization. - Chao Bian 002; Chao Qian 001; Ke Tang 001 (CoRR, 2019)

On the Robustness of Median Sampling in Noisy Evolutionary Optimization. - Chao Bian 002; Chao Qian 001; Yang Yu 001 (CoRR, 2019)

Subset Selection by Pareto Optimization with Recombination. - Chao Qian 001; Chao Bian 002; Chao Feng 006 (AAAI, 2020)

An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints. - Chao Bian 002; Chao Feng 006; Chao Qian 001; Yang Yu 001 (AAAI, 2020)

Running time analysis of the (1+1)-EA for robust linear optimization. - Chao Bian 002; Chao Qian 001; Ke Tang 001; Yang Yu 001 (Theor. Comput. Sci., 2020)

Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints. - Chao Bian 002; Chao Qian 001; Frank Neumann 001; Yang Yu 001 (IJCAI, 2021)

Analysis of Noisy Evolutionary Optimization When Sampling Fails. - Chao Qian 001; Chao Bian 002; Yang Yu 001; Ke Tang 001; Xin Yao 001 (Algorithmica, 2021)

On the robustness of median sampling in noisy evolutionary optimization. - Chao Bian 002; Chao Qian 001; Yang Yu 001; Ke Tang 001 (Sci. China Inf. Sci., 2021)

Robust Subset Selection by Greedy and Evolutionary Pareto Optimization. - Chao Bian 002; Yawen Zhou; Chao Qian 001 (IJCAI, 2022)

Better Running Time of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) by Using Stochastic Tournament Selection. - Chao Bian 002; Chao Qian 001 (PPSN (2), 2022)

Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnes. - Zi-An Zhang; Chao Bian 002; Chao Qian 001 (PPSN (2), 2022)

Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection. - Chao Bian 002; Chao Qian 001 (CoRR, 2022)

Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. - Yu-Ran Gu; Chao Bian 002; Chao Qian 001 (AAAI, 2023)

Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms. - Tianhao Lu; Chao Bian 002; Chao Qian 001 (AAAI, 2024)

Runtime Analysis of Population-based Evolutionary Neural Architecture Search for a Binary Classification Problem. - Zeqiong Lv; Chao Bian 002; Chao Qian 001; Yanan Sun 001 (GECCO, 2024)

An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms. - Chao Bian 002; Shengjie Ren; Miqing Li; Chao Qian 001 (IJCAI, 2024)

Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization. - Shengjie Ren; Zhijia Qiu; Chao Bian 002; Miqing Li; Chao Qian 001 (IJCAI, 2024)

A First Running Time Analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2). - Shengjie Ren; Chao Bian 002; Miqing Li; Chao Qian 001 (PPSN (3), 2024)

Subset Selection for Evolutionary Multiobjective Optimization. - Yu-Ran Gu; Chao Bian 002; Miqing Li; Chao Qian 001 (IEEE Trans. Evol. Comput., 2024)

Stochastic population update can provably be helpful in multi-objective evolutionary algorithms. - Chao Bian 002; Yawen Zhou; Miqing Li; Chao Qian 001 (Artif. Intell., 2025)