| 2026 | GECCO | Never-Forgetting Genetic Algorithms: A Promising Architecture for Theory and Practice. | Maxim Buzdalov |
| 2026 | PPSN | Never-Forgetting Genetic Algorithms on OneMax: First Insights. | Maxim Buzdalov, Christine Zarges |
| 2025 | GECCO | Hot off the Press: First Steps Towards a Runtime Analysis When Starting With a Good Solution. | Denis Antipov, Maxim Buzdalov, Benjamin Doerr |
| 2025 | GECCO | In the Search of Optimal Tree Networks: Hardness and Heuristics. | Pavel Martynov, Maxim Buzdalov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid |
| 2023 | FOGA | Using Automated Algorithm Configuration for Parameter Control. | Deyao Chen, Maxim Buzdalov, Carola Doerr, Nguyen Dang |
| 2023 | GECCO | Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches. | Maxim Buzdalov |
| 2022 | CEC | The $(1+(\lambda, \lambda))$ Genetic Algorithm on the Vertex Cover Problem: Crossover Helps Leaving Plateaus. | Maxim Buzdalov |
| 2022 | GECCO | On optimal static and dynamic parameter choices for fixed-target optimization. | Dmitry Vinokurov, Maxim Buzdalov |
| 2022 | PPSN | Towards Fixed-Target Black-Box Complexity Analysis. | Dmitry Vinokurov, Maxim Buzdalov |
| 2021 | CEC | Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms. | Kirill Antonov, Maxim Buzdalov, Arina Buzdalova, Carola Doerr |
| 2021 | GECCO | Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. | Denis Antipov, Maxim Buzdalov, Benjamin Doerr |
| 2021 | GECCO | Optimal static mutation strength distributions for the (1 | Maxim Buzdalov, Carola Doerr |
| 2021 | GECCO | Labeling-oriented non-dominated sorting is Θ( | Sumit Mishra, Ved Prakash, Maxim Buzdalov |
| 2020 | GECCO | Fast mutation in crossover-based algorithms. | Denis Antipov, Maxim Buzdalov, Benjamin Doerr |
| 2020 | GECCO | The (1 + ( | Anton O. Bassin, Maxim Buzdalov |
| 2020 | GECCO | Fixed-target runtime analysis. | Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov |
| 2020 | GECCO | If unsure, shuffle: deductive sort is Θ( | Sumit Mishra, Maxim Buzdalov |
| 2020 | GECCO | Time complexity analysis of the dominance degree approach for non-dominated sorting. | Sumit Mishra, Maxim Buzdalov, Rakesh Senwar |
| 2020 | PPSN | First Steps Towards a Runtime Analysis When Starting with a Good Solution. | Denis Antipov, Maxim Buzdalov, Benjamin Doerr |
| 2020 | PPSN | Optimal Mutation Rates for the (1+λ ) EA on OneMax. | Maxim Buzdalov, Carola Doerr |
| 2020 | PPSN | Filter Sort Is $\varOmega (N^3)$ in the Worst Case. | Sumit Mishra, Maxim Buzdalov |
| 2019 | EMO | Make Evolutionary Multiobjective Algorithms Scale Better with Advanced Data Structures: Van Emde Boas Tree for Non-dominated Sorting. | Maxim Buzdalov |
| 2019 | ETFA | Permutation Encoding for Automatic Reconstruction of Connections in Closed-Loop Control System using Evolutionary Algorithm. | Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin |
| 2019 | GECCO | The 1/5-th rule with rollbacks: on self-adjustment of the population size in the (1 + ( | Anton O. Bassin, Maxim Buzdalov |
| 2019 | GECCO | Black-box complexity of the binary value function. | Nina Bulanova, Maxim Buzdalov |
| 2019 | GECCO | Limited memory, limited arity unbiased black-box complexity: first insights. | Nina Bulanova, Maxim Buzdalov |
| 2019 | GECCO | Generalized incremental orthant search: towards efficient steady-state evolutionary multiobjective algorithms. | Maxim Buzdalov |
| 2019 | GECCO | Towards better estimation of statistical significance when comparing evolutionary algorithms. | Maxim Buzdalov |
| 2019 | GECCO | Illustrating the trade-off between time, quality, and success probability in heuristic search: a discussion paper. | Ivan Ignashov, Arina Buzdalova, Maxim Buzdalov, Carola Doerr |
| 2019 | GECCO | Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks. | Artem Pavlenko, Maxim Buzdalov, Vladimir Ulyantsev |
| 2019 | GECCO | Fixed-target runtime analysis of the (1 + 1) EA with resampling. | Dmitry Vinokurov, Maxim Buzdalov, Arina Buzdalova, Benjamin Doerr, Carola Doerr |
| 2018 | ETFA | Automatic Plant-Controller Input/Output Matching using Evolutionary Algorithms. | Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin |
| 2018 | GECCO | Better fixed-arity unbiased black-box algorithms. | Nina Bulanova, Maxim Buzdalov |
| 2018 | GECCO | Generalized offline orthant search: one code for many problems in multiobjective optimization. | Maxim Buzdalov |
| 2018 | GECCO | From fitness landscape analysis to designing evolutionary algorithms: the case study in automatic generation of function block applications. | Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin |
| 2018 | GECCO | On asynchronous non-dominated sorting for steady-state multiobjective evolutionary algorithms. | Ilya Yakupov, Maxim Buzdalov |
| 2018 | PPSN | Towards Large-Scale Multiobjective Optimisation with a Hybrid Algorithm for Non-dominated Sorting. | Margarita Markina, Maxim Buzdalov |
| 2017 | GECCO | On binary unbiased operators returning multiple offspring. | Nina Bulanova, Maxim Buzdalov |
| 2017 | GECCO | Runtime analysis of the (1 + ( | Maxim Buzdalov, Benjamin Doerr |
| 2017 | GECCO | The unrestricted black-box complexity of jump functions. | Maxim Buzdalov, Benjamin Doerr, Mikhail Kever |
| 2017 | GECCO | Hybridizing non-dominated sorting algorithms: divide-and-conquer meets best order sort. | Margarita Markina, Maxim Buzdalov |
| 2017 | GECCO | Evaluation of heavy-tailed mutation operator on maximum flow test generation problem. | Vladimir Mironovich, Maxim Buzdalov |
| 2017 | GECCO | Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization. | Ilya Yakupov, Maxim Buzdalov |
| 2017 | INDIN | Automatic generation of function block applications using evolutionary algorithms: Initial explorations. | Vladimir Mironovich, Maxim Buzdalov, Valeriy Vyatkin |
| 2016 | GECCO | Fitness-Dependent Hybridization of Clonal Selection Algorithm and Random Local Search. | Nina Bulanova, Arina Buzdalova, Maxim Buzdalov |
| 2016 | GECCO | An Algorithm for Computing Lower Bounds for Unrestricted Black-Box Complexities. | Maxim Buzdalov |
| 2016 | GECCO | GECCO'16 Workshop on Algorithms and Data Structures for Evolutionary Computation Chairs' Welcome. | Maxim Buzdalov |
| 2016 | GECCO | Efficient Removal of Points with Smallest Crowding Distance in Two-dimensional Incremental Non-dominated Sorting. | Niyaz Nigmatullin, Maxim Buzdalov, Andrey Stankevich |
| 2016 | GECCO | A Faster Algorithm for the Binary Epsilon Indicator Based on Orthant Minimum Search. | Andrey Vasin, Maxim Buzdalov |
| 2015 | CEC | Analysis of Q-learning with random exploration for selection of auxiliary objectives in random local search. | Maxim Buzdalov, Arina Buzdalova |
| 2015 | CEC | Can OneMax help optimizing LeadingOnes using the EA+RL method? | Maxim Buzdalov, Arina Buzdalova |
| 2015 | CEC | Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited. | Maxim Buzdalov, Anatoly Shalyto |
| 2015 | CEC | Incremental non-dominated sorting with O(N) insertion for the two-dimensional case. | Ilya Yakupov, Maxim Buzdalov |
| 2015 | GECCO | Various Degrees of Steadiness in NSGA-II and Their Influence on the Quality of Results. | Maxim Buzdalov, Vladimir Parfenov |
| 2015 | GECCO | Fast Implementation of the Steady-State NSGA-II Algorithm for Two Dimensions Based on Incremental Non-Dominated Sorting. | Maxim Buzdalov, Ilya Yakupov, Andrey Stankevich |
| 2015 | GECCO | Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm. | Vladimir Mironovich, Maxim Buzdalov |
| 2015 | ICMLA | An Asynchronous Implementation of the Limited Memory CMA-ES. | Viktor Arkhipov, Maxim Buzdalov, Anatoly Shalyto |
| 2014 | GECCO | Selecting evolutionary operators using reinforcement learning: initial explorations. | Arina Buzdalova, Vladislav Kononov, Maxim Buzdalov |
| 2014 | GECCO | Onemax helps optimizing XdivK: : theoretical runtime analysis for RLS and EA+RL. | Maxim Buzdalov, Arina Buzdalova |
| 2014 | GECCO | NSGA-II implementation details may influence quality of solutions for the job-shop scheduling problem. | Maxim Buzdalov, Irina Petrova, Arina Buzdalova |
| 2014 | ICMLA | A Switch-and-Restart Algorithm with Exponential Restart Strategy for Objective Selection and its Runtime Analysis. | Maxim Buzdalov |
| 2014 | ICMLA | A New Algorithm for Adaptive Online Selection of Auxiliary Objectives. | Arina Buzdalova, Maxim Buzdalov |
| 2014 | ICMLA | Protein Conformation Motion Modeling Using Sep-CMA-ES. | Maxim Buzdalov, Sergey Knyazev, Yuri Porozov |
| 2014 | ICMLA | Improved Selection of Auxiliary Objectives Using Reinforcement Learning in Non-stationary Environment. | Irina Petrova, Arina Buzdalova, Maxim Buzdalov |
| 2014 | PPSN | A Provably Asymptotically Fast Version of the Generalized Jensen Algorithm for Non-dominated Sorting. | Maxim Buzdalov, Anatoly Shalyto |
| 2013 | CEC | Adaptive selection of helper-objectives for test case generation. | Maxim Buzdalov, Arina Buzdalova |
| 2013 | GECCO | Generation of tests for programming challenge tasks using multi-objective optimization. | Maxim Buzdalov, Arina Buzdalova, Irina Petrova |
| 2013 | ICMLA | Worst-Case Execution Time Test Generation for Augmenting Path Maximum Flow Algorithms Using Genetic Algorithms. | Viktor Arkhipov, Maxim Buzdalov, Anatoly Shalyto |
| 2013 | ICMLA | A First Step towards the Runtime Analysis of Evolutionary Algorithm Adjusted with Reinforcement Learning. | Maxim Buzdalov, Arina Buzdalova, Anatoly Shalyto |
| 2013 | ICMLA | Improved Helper-Objective Optimization Strategy for Job-Shop Scheduling Problem. | Irina Petrova, Arina Buzdalova, Maxim Buzdalov |
| 2013 | SSBSE | Generation of Tests for Programming Challenge Tasks Using Helper-Objectives. | Arina Buzdalova, Maxim Buzdalov, Vladimir Parfenov |
| 2012 | GECCO | Evolving EFSMs solving a path-planning problem by genetic programming. | Maxim Buzdalov, Andrey Sokolov |
| 2012 | ICMLA | Generation of Tests for Programming Challenge Tasks on Graph Theory Using Evolution Strategy. | Maxim Buzdalov |
| 2012 | ICMLA | Increasing Efficiency of Evolutionary Algorithms by Choosing between Auxiliary Fitness Functions with Reinforcement Learning. | Arina Buzdalova, Maxim Buzdalov |
| 2012 | ICMLA | Adaptive Selection of Helper-Objectives with Reinforcement Learning. | Arina Buzdalova, Maxim Buzdalov |
| 2011 | GECCO | Generation of tests for programming challenge tasks using evolution algorithms. | Maxim Buzdalov |
| 2011 | ICMLA | Choosing Best Fitness Function with Reinforcement Learning. | Arina Afanasyeva, Maxim Buzdalov |