Generation of tests for programming challenge tasks using evolution algorithms. - Maxim Buzdalov 001 (GECCO (Companion), 2011)

Choosing Best Fitness Function with Reinforcement Learning. - Arina Afanasyeva; Maxim Buzdalov 001 (ICMLA (2), 2011)

Evolving EFSMs solving a path-planning problem by genetic programming. - Maxim Buzdalov 001; Andrey Sokolov (GECCO (Companion), 2012)

Generation of Tests for Programming Challenge Tasks on Graph Theory Using Evolution Strategy. - Maxim Buzdalov 001 (ICMLA (2), 2012)

Increasing Efficiency of Evolutionary Algorithms by Choosing between Auxiliary Fitness Functions with Reinforcement Learning. - Arina Buzdalova; Maxim Buzdalov 001 (ICMLA (1), 2012)

Adaptive Selection of Helper-Objectives with Reinforcement Learning. - Arina Buzdalova; Maxim Buzdalov 001 (ICMLA (2), 2012)

Adaptive selection of helper-objectives for test case generation. - Maxim Buzdalov 001; Arina Buzdalova (IEEE Congress on Evolutionary Computation, 2013)

Generation of tests for programming challenge tasks using multi-objective optimization. - Maxim Buzdalov 001; Arina Buzdalova; Irina Petrova 001 (GECCO (Companion), 2013)

Worst-Case Execution Time Test Generation for Augmenting Path Maximum Flow Algorithms Using Genetic Algorithms. - Viktor Arkhipov; Maxim Buzdalov 001; Anatoly Shalyto 001 (ICMLA (2), 2013)

A First Step towards the Runtime Analysis of Evolutionary Algorithm Adjusted with Reinforcement Learning. - Maxim Buzdalov 001; Arina Buzdalova; Anatoly Shalyto 001 (ICMLA (1), 2013)

Improved Helper-Objective Optimization Strategy for Job-Shop Scheduling Problem. - Irina Petrova 001; Arina Buzdalova; Maxim Buzdalov 001 (ICMLA (2), 2013)

Generation of Tests for Programming Challenge Tasks Using Helper-Objectives. - Arina Buzdalova; Maxim Buzdalov 001; Vladimir Parfenov (SSBSE, 2013)

Worst-Case Execution Time Test Generation for Solutions of the Knapsack Problem Using a Genetic Algorithm. - Maxim Buzdalov 001; Anatoly Shalyto 001 (BIC-TA, 2014)

Onemax helps optimizing XdivK: : theoretical runtime analysis for RLS and EA+RL. - Maxim Buzdalov 001; Arina Buzdalova (GECCO (Companion), 2014)

NSGA-II implementation details may influence quality of solutions for the job-shop scheduling problem. - Maxim Buzdalov 001; Irina Petrova 001; Arina Buzdalova (GECCO (Companion), 2014)

Selecting evolutionary operators using reinforcement learning: initial explorations. - Arina Buzdalova; Vladislav Kononov; Maxim Buzdalov 001 (GECCO (Companion), 2014)

Formal Verification of 800 Genetically Constructed Automata Programs: A Case Study. - Mikhail Lukin; Maxim Buzdalov 001; Anatoly Shalyto 001 (Haifa Verification Conference, 2014)

A Switch-and-Restart Algorithm with Exponential Restart Strategy for Objective Selection and its Runtime Analysis. - Maxim Buzdalov 001 (ICMLA, 2014)

Protein Conformation Motion Modeling Using Sep-CMA-ES. - Maxim Buzdalov 001; Sergey Knyazev; Yuri Porozov (ICMLA, 2014)

A New Algorithm for Adaptive Online Selection of Auxiliary Objectives. - Arina Buzdalova; Maxim Buzdalov 001 (ICMLA, 2014)

Improved Selection of Auxiliary Objectives Using Reinforcement Learning in Non-stationary Environment. - Irina Petrova 001; Arina Buzdalova; Maxim Buzdalov 001 (ICMLA, 2014)

A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting. - Maxim Buzdalov 001; Anatoly Shalyto 001 (PPSN, 2014)

Analysis of Q-learning with random exploration for selection of auxiliary objectives in random local search. - Maxim Buzdalov 001; Arina Buzdalova (CEC, 2015)

Can OneMax help optimizing LeadingOnes using the EA+RL method? - Maxim Buzdalov 001; Arina Buzdalova (CEC, 2015)

Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited. - Maxim Buzdalov 001; Anatoly Shalyto 001 (CEC, 2015)

Incremental non-dominated sorting with O(N) insertion for the two-dimensional case. - Ilya Yakupov; Maxim Buzdalov 001 (CEC, 2015)

Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem. - Denis Antipov; Maxim Buzdalov 001; Benjamin Doerr (EvoCOP, 2015)

Upper and Lower Bounds on Unrestricted Black-Box Complexity of Jump _n, ℓ. - Maxim Buzdalov 001; Mikhail Kever; Benjamin Doerr (EvoCOP, 2015)

Various Degrees of Steadiness in NSGA-II and Their Influence on the Quality of Results. - Maxim Buzdalov 001; Vladimir Parfenov (GECCO (Companion), 2015)

Fast Implementation of the Steady-State NSGA-II Algorithm for Two Dimensions Based on Incremental Non-Dominated Sorting. - Maxim Buzdalov 001; Ilya Yakupov; Andrey Stankevich (GECCO, 2015)

Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm. - Vladimir Mironovich; Maxim Buzdalov 001 (GECCO (Companion), 2015)

An Asynchronous Implementation of the Limited Memory CMA-ES. - Viktor Arkhipov; Maxim Buzdalov 001; Anatoly Shalyto 001 (ICMLA, 2015)

Fitness-Dependent Hybridization of Clonal Selection Algorithm and Random Local Search. - Nina Bulanova; Arina Buzdalova; Maxim Buzdalov 001 (GECCO (Companion), 2016)

An Algorithm for Computing Lower Bounds for Unrestricted Black-Box Complexities. - Maxim Buzdalov 001 (GECCO (Companion), 2016)

GECCO'16 Workshop on Algorithms and Data Structures for Evolutionary Computation Chairs' Welcome. - Maxim Buzdalov 001 (GECCO (Companion), 2016)

Efficient Removal of Points with Smallest Crowding Distance in Two-dimensional Incremental Non-dominated Sorting. - Niyaz Nigmatullin; Maxim Buzdalov 001; Andrey Stankevich (GECCO (Companion), 2016)

A Faster Algorithm for the Binary Epsilon Indicator Based on Orthant Minimum Search. - Andrey Vasin; Maxim Buzdalov 001 (GECCO, 2016)

Runtime analysis of different Approaches to select conflicting auxiliary objectives in the generalized OneMax problem. - Arina Buzdalova; Irina Petrova 001; Maxim Buzdalov 001 (SSCI, 2016)

Preserving diversity in auxiliary objectives provably speeds up crossing plateaus. - Tatyana Polevaya; Maxim Buzdalov 001 (SSCI, 2016)

The Unrestricted Black-Box Complexity of Jump Functions. - Maxim Buzdalov 001; Benjamin Doerr; Mikhail Kever (Evol. Comput., 2016)

On binary unbiased operators returning multiple offspring. - Nina Bulanova; Maxim Buzdalov 001 (GECCO (Companion), 2017)

Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas. - Maxim Buzdalov 001; Benjamin Doerr (GECCO, 2017)

Hybridizing non-dominated sorting algorithms: divide-and-conquer meets best order sort. - Margarita Markina; Maxim Buzdalov 001 (GECCO (Companion), 2017)

Evaluation of heavy-tailed mutation operator on maximum flow test generation problem. - Vladimir Mironovich; Maxim Buzdalov 001 (GECCO (Companion), 2017)

Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization. - Ilya Yakupov; Maxim Buzdalov 001 (GECCO, 2017)

Automatic generation of function block applications using evolutionary algorithms: Initial explorations. - Vladimir Mironovich; Maxim Buzdalov 001; Valeriy Vyatkin (INDIN, 2017)

Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas. - Maxim Buzdalov 001; Benjamin Doerr (CoRR, 2017)

Automatic Plant-Controller Input/Output Matching using Evolutionary Algorithms. - Vladimir Mironovich; Maxim Buzdalov 001; Valeriy Vyatkin (ETFA, 2018)

Better fixed-arity unbiased black-box algorithms. - Nina Bulanova; Maxim Buzdalov 001 (GECCO (Companion), 2018)

Generalized offline orthant search: one code for many problems in multiobjective optimization. - Maxim Buzdalov 001 (GECCO, 2018)

From fitness landscape analysis to designing evolutionary algorithms: the case study in automatic generation of function block applications. - Vladimir Mironovich; Maxim Buzdalov 001; Valeriy Vyatkin (GECCO (Companion), 2018)

On asynchronous non-dominated sorting for steady-state multiobjective evolutionary algorithms. - Ilya Yakupov; Maxim Buzdalov 001 (GECCO (Companion), 2018)

Towards Large-Scale Multiobjective Optimisation with a Hybrid Algorithm for Non-dominated Sorting. - Margarita Markina; Maxim Buzdalov 001 (PPSN (1), 2018)

Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-dominated Sorting. - Maxim Buzdalov 001 (EMO, 2019)

Permutation Encoding for Automatic Reconstruction of Connections in Closed-Loop Control System using Evolutionary Algorithm. - Vladimir Mironovich; Maxim Buzdalov 001; Valeriy Vyatkin (ETFA, 2019)

The 1/5-th rule with rollbacks: on self-adjustment of the population size in the (1 + (λ, λ)) GA. - Anton O. Bassin; Maxim Buzdalov 001 (GECCO (Companion), 2019)

Black-box complexity of the binary value function. - Nina Bulanova; Maxim Buzdalov 001 (GECCO (Companion), 2019)

Limited memory, limited arity unbiased black-box complexity: first insights. - Nina Bulanova; Maxim Buzdalov 001 (GECCO (Companion), 2019)

Generalized incremental orthant search: towards efficient steady-state evolutionary multiobjective algorithms. - Maxim Buzdalov 001 (GECCO (Companion), 2019)

Towards better estimation of statistical significance when comparing evolutionary algorithms. - Maxim Buzdalov 001 (GECCO (Companion), 2019)

Illustrating the trade-off between time, quality, and success probability in heuristic search: a discussion paper. - Ivan Ignashov; Arina Buzdalova; Maxim Buzdalov 001; Carola Doerr (GECCO (Companion), 2019)

Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks. - Artem Pavlenko; Maxim Buzdalov 001; Vladimir Ulyantsev (GECCO, 2019)

Fixed-target runtime analysis of the (1 + 1) EA with resampling. - Dmitry Vinokurov; Maxim Buzdalov 001; Arina Buzdalova; Benjamin Doerr; Carola Doerr (GECCO (Companion), 2019)

The 1/5-th Rule with Rollbacks: On Self-Adjustment of the Population Size in the (1+(λ, λ)) GA. - Anton O. Bassin; Maxim Buzdalov 001 (CoRR, 2019)

Optimizing Robotic Cheetah Leg Parameters Using Evolutionary Algorithms. - Maxim Buzdalov 001; Sergey A. Kolyubin; Artem A. Egorov; Ivan I. Borisov (BIOMA, 2020)

The (1 + (λ, λ)) genetic algorithm for permutations. - Anton O. Bassin; Maxim Buzdalov 001 (GECCO Companion, 2020)

If unsure, shuffle: deductive sort is Θ(MN3), but O(MN2) in expectation over input permutations. - Sumit Mishra; Maxim Buzdalov 001 (GECCO, 2020)

Time complexity analysis of the dominance degree approach for non-dominated sorting. - Sumit Mishra; Maxim Buzdalov 001; Rakesh Senwar (GECCO Companion, 2020)

First Steps Towards a Runtime Analysis When Starting with a Good Solution. - Denis Antipov; Maxim Buzdalov 001; Benjamin Doerr (PPSN (2), 2020)

Optimal Mutation Rates for the (1+λ ) EA on OneMax. - Maxim Buzdalov 001; Carola Doerr (PPSN (2), 2020)

Filter Sort Is $ varOmega (N^3)$ in the Worst Case. - Sumit Mishra; Maxim Buzdalov 001 (PPSN (2), 2020)

The $(1+(λ, λ))$ Genetic Algorithm for Permutations. - Anton O. Bassin; Maxim Buzdalov 001 (CoRR, 2020)

Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms. - Kirill Antonov; Maxim Buzdalov 001; Arina Buzdalova; Carola Doerr (CEC, 2021)

Optimal static mutation strength distributions for the (1 + λ) evolutionary algorithm on OneMax. - Maxim Buzdalov 001; Carola Doerr (GECCO, 2021)

Labeling-oriented non-dominated sorting is Θ(MN3). - Sumit Mishra; Ved Prakash; Maxim Buzdalov 001 (GECCO Companion, 2021)

The "One-Fifth Rule" with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ, λ)) Genetic Algorithm. - Anton O. Bassin; Maxim V. Buzdalov; Anatoly A. Shalyto (Autom. Control. Comput. Sci., 2021)

Optimal Static Mutation Strength Distributions for the (1+λ) Evolutionary Algorithm on OneMax. - Maxim Buzdalov 001; Carola Doerr (CoRR, 2021)

The $(1+( lambda, lambda))$ Genetic Algorithm on the Vertex Cover Problem: Crossover Helps Leaving Plateaus. - Maxim Buzdalov 001 (CEC, 2022)

On optimal static and dynamic parameter choices for fixed-target optimization. - Dmitry Vinokurov; Maxim Buzdalov 001 (GECCO, 2022)

Towards Fixed-Target Black-Box Complexity Analysis. - Dmitry Vinokurov; Maxim Buzdalov 001 (PPSN (2), 2022)

Fast Mutation in Crossover-Based Algorithms. - Denis Antipov; Maxim Buzdalov 001; Benjamin Doerr (Algorithmica, 2022)

Fixed-Target Runtime Analysis. - Maxim Buzdalov 001; Benjamin Doerr; Carola Doerr; Dmitry Vinokurov (Algorithmica, 2022)

Using Automated Algorithm Configuration for Parameter Control. - Deyao Chen; Maxim Buzdalov 001; Carola Doerr; Nguyen Dang 001 (FOGA, 2023)

Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches. - Maxim Buzdalov 001 (GECCO Companion, 2023)

A Simple Statistical Test Against Origin-Biased Metaheuristics. - Aidan Walden; Maxim Buzdalov 001 (EvoApplications@EvoStar, 2024)

Lazy Parameter Tuning and Control: Choosing All Parameters Randomly from a Power-Law Distribution. - Denis Antipov; Maxim Buzdalov 001; Benjamin Doerr (Algorithmica, 2024)

Code and data for "First Steps Towards a Runtime Analysis When Starting With a Good Solution". - Denis Antipov; Maxim Buzdalov 001; Benjamin Doerr (Zenodo, 2024)

In the Search of Optimal Tree Networks: Hardness and Heuristics. - Pavel Martynov; Maxim Buzdalov 001; Sergey Pankratov; Vitaly Aksenov; Stefan Schmid 001 (GECCO, 2025)

First Steps Toward a Runtime Analysis When Starting With a Good Solution. - Denis Antipov; Maxim Buzdalov 001; Benjamin Doerr (ACM Trans. Evol. Learn. Optim., 2025)