The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation. - Aneta Neumann; Bradley Alexander; Frank Neumann 001 (ICONIP (3), 2016)

Evolutionary Image Transition Based on Theoretical Insights of Random Processes. - Aneta Neumann; Bradley Alexander; Frank Neumann 001 (CoRR, 2016)

A modified indicator-based evolutionary algorithm (mIBEA). - Wenwen Li 003; Ender Özcan; Robert I. John; John H. Drake; Aneta Neumann; Markus Wagner 007 (CEC, 2017)

Evolutionary Image Transition Using Random Walks. - Aneta Neumann; Bradley Alexander; Frank Neumann 001 (EvoMUSART, 2017)

Evolution of artistic image variants through feature based diversity optimisation. - Bradley Alexander; James Kortman; Aneta Neumann (GECCO, 2017)

Evolutionary image composition using feature covariance matrices. - Aneta Neumann; Zygmunt L. Szpak; Wojciech Chojnacki; Frank Neumann 001 (GECCO, 2017)

Multi-objectiveness in the single-objective traveling thief problem. - Mohamed El Yafrani; Shelvin Chand; Aneta Neumann; Belaïd Ahiod; Markus Wagner 007 (GECCO (Companion), 2017)

Quasi-random Agents for Image Transition and Animation. - Aneta Neumann; Frank Neumann 001; Tobias Friedrich 001 (CoRR, 2017)

On the Use of Colour-Based Segmentation in Evolutionary Image Composition. - Aneta Neumann; Frank Neumann 001 (CEC, 2018)

Discrepancy-based evolutionary diversity optimization. - Aneta Neumann; Wanru Gao; Carola Doerr; Frank Neumann 001; Markus Wagner 007 (GECCO, 2018)

Evolutionary computation for digital art. - Aneta Neumann; Frank Neumann 001 (GECCO (Companion), 2018)

Evolution of Images with Diversity and Constraints Using a Generative Adversarial Network. - Aneta Neumann; Christo Pyromallis; Bradley Alexander (ICONIP (6), 2018)

On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001 (PPSN (1), 2018)

Evolution of Images with Diversity and Constraints Using a Generator Network. - Aneta Neumann; Christo Pyromallis; Bradley Alexander (CoRR, 2018)

Evolving diverse TSP instances by means of novel and creative mutation operators. - Jakob Bossek; Pascal Kerschke; Aneta Neumann; Markus Wagner 007; Frank Neumann 001; Heike Trautmann (FOGA, 2019)

Evolutionary diversity optimization using multi-objective indicators. - Aneta Neumann; Wanru Gao; Markus Wagner 007; Frank Neumann 001 (GECCO, 2019)

Evolutionary algorithms for the chance-constrained knapsack problem. - Yue Xie; Oscar Harper; Hirad Assimi; Aneta Neumann; Frank Neumann 001 (GECCO, 2019)

Evolving Pictures in Image Transition Space. - Bradley Alexander; David Hin; Aneta Neumann; Safwan Ull-Karim (ICONIP (1), 2019)

Quasi-random Image Transition and Animation. - Aneta Neumann; Frank Neumann 001; Tobias Friedrich 001 (Aust. J. Intell. Inf. Process. Syst., 2019)

One-Shot Decision-Making with and without Surrogates. - Jakob Bossek; Pascal Kerschke; Aneta Neumann; Frank Neumann 001; Carola Doerr (CoRR, 2019)

Optimization of Chance-Constrained Submodular Functions. - Benjamin Doerr; Carola Doerr; Aneta Neumann; Frank Neumann 001; Andrew M. Sutton (AAAI, 2020)

Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. - Hirad Assimi; Oscar Harper; Yue Xie; Aneta Neumann; Frank Neumann 001 (ECAI, 2020)

Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. - Vanja Doskoc; Tobias Friedrich 001; Andreas Göbel 001; Aneta Neumann; Frank Neumann 001; Francesco Quinzan (ECAI, 2020)

Evolving diverse sets of tours for the travelling salesperson problem. - Anh Viet Do; Jakob Bossek; Aneta Neumann; Frank Neumann 001 (GECCO, 2020)

Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. - Yue Xie; Aneta Neumann; Frank Neumann 001 (GECCO, 2020)

Evolving Sampling Strategies for One-Shot Optimization Tasks. - Jakob Bossek; Carola Doerr; Pascal Kerschke; Aneta Neumann; Frank Neumann 001 (PPSN (1), 2020)

Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. - Jakob Bossek; Aneta Neumann; Frank Neumann 001 (PPSN (1), 2020)

Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. - Aneta Neumann; Frank Neumann 001 (PPSN (1), 2020)

Human Interactive EEG-Based Evolutionary Image Animation. - Aneta Neumann; Frank Neumann 001 (SSCI, 2020)

Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001 (CoRR, 2020)

Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems. - Aneta Neumann; Jakob Bossek; Frank Neumann 001 (CoRR, 2020)

Evolutionary Image Transition and Painting Using Random Walks. - Aneta Neumann; Bradley Alexander; Frank Neumann 001 (Evol. Comput., 2020)

Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems. - Yue Xie; Aneta Neumann; Frank Neumann 001 (CEC, 2021)

Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. - Adel Nikfarjam; Jakob Bossek; Aneta Neumann; Frank Neumann 001 (FOGA, 2021)

Evolutionary submodular optimisation. - Aneta Neumann; Frank Neumann 001; Chao Qian 001 (GECCO Companion, 2021)

Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. - Jakob Bossek; Aneta Neumann; Frank Neumann 001 (GECCO, 2021)

Analysis of evolutionary diversity optimisation for permutation problems. - Anh Viet Do; Mingyu Guo; Aneta Neumann; Frank Neumann 001 (GECCO, 2021)

Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. - Aneta Neumann; Jakob Bossek; Frank Neumann 001 (GECCO, 2021)

Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. - Adel Nikfarjam; Jakob Bossek; Aneta Neumann; Frank Neumann 001 (GECCO, 2021)

Advanced mine optimisation under uncertainty using evolution. - William Reid; Aneta Neumann; Simon Ratcliffe; Frank Neumann 001 (GECCO Companion, 2021)

Heuristic strategies for solving complex interacting stockpile blending problem with chance constraints. - Yue Xie; Aneta Neumann; Frank Neumann 001 (GECCO, 2021)

Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. - Yue Xie; Aneta Neumann; Frank Neumann 001; Andrew M. Sutton (GECCO, 2021)

Exact Counting and Sampling of Optima for the Knapsack Problem. - Jakob Bossek; Aneta Neumann; Frank Neumann 001 (LION, 2021)

Advanced Ore Mine Optimisation under Uncertainty Using Evolution. - William Reid; Aneta Neumann; Simon Ratcliffe; Frank Neumann 001 (CoRR, 2021)

Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. - Mingyu Guo; Jialiang Li 002; Aneta Neumann; Frank Neumann 001; Hung Nguyen 004 (AAAI, 2022)

Evolutionary diversity optimization for combinatorial optimization: tutorial at GECCO'22, Boston, USA. - Jakob Bossek; Aneta Neumann; Frank Neumann 001 (GECCO Companion, 2022)

Niching-based evolutionary diversity optimization for the traveling salesperson problem. - Anh Viet Do; Mingyu Guo; Aneta Neumann; Frank Neumann 001 (GECCO, 2022)

Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation. - Diksha Goel; Max Hector Ward-Graham; Aneta Neumann; Frank Neumann 001; Hung Nguyen 004; Mingyu Guo (GECCO, 2022)

Evolutionary submodular optimisation: tutorial. - Aneta Neumann; Frank Neumann 001; Chao Qian 001 (GECCO Companion, 2022)

Coevolutionary Pareto diversity optimization. - Aneta Neumann; Denis Antipov; Frank Neumann 001 (GECCO, 2022)

On the use of quality diversity algorithms for the traveling thief problem. - Adel Nikfarjam; Aneta Neumann; Frank Neumann 001 (GECCO, 2022)

Evolutionary diversity optimisation for the traveling thief problem. - Adel Nikfarjam; Aneta Neumann; Frank Neumann 001 (GECCO, 2022)

An optimization strategy for the complex large-scale stockpile blending problem. - Yue Xie; Aneta Neumann; Frank Neumann 001 (GECCO Companion, 2022)

Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. - Aneta Neumann; Yue Xie; Frank Neumann 001 (PPSN (1), 2022)

Computing High-Quality Solutions for the Patient Admission Scheduling Problem Using Evolutionary Diversity Optimisation. - Adel Nikfarjam; Amirhossein Moosavi; Aneta Neumann; Frank Neumann 001 (PPSN (1), 2022)

Co-evolutionary Diversity Optimisation for the Traveling Thief Problem. - Adel Nikfarjam; Aneta Neumann; Jakob Bossek; Frank Neumann 001 (PPSN (1), 2022)

Evolutionary Time-Use Optimization for Improving Children's Health Outcomes. - Yue Xie; Aneta Neumann; Ty Stanford; Charlotte Lund Rasmussen; Dorothea Dumuid; Frank Neumann 001 (PPSN (2), 2022)

Pareto optimization for subset selection with dynamic cost constraints. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001; Tobias Friedrich 001 (Artif. Intell., 2022)

Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001 (Theor. Comput. Sci., 2022)

Analysis of Evolutionary Diversity Optimization for Permutation Problems. - Anh Viet Do; Mingyu Guo; Aneta Neumann; Frank Neumann 001 (ACM Trans. Evol. Learn. Optim., 2022)

Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. - Mingyu Guo; Max Ward 001; Aneta Neumann; Frank Neumann 001; Hung Nguyen 004 (AAAI, 2023)

Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. - Frank Neumann 001; Aneta Neumann; Chao Qian 001; Anh Viet Do; Jacob de Nobel; Diederick Vermetten; Saba Sadeghi Ahouei; Furong Ye; Hao Wang 025; Thomas Bäck (CEC, 2023)

Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. - Michael Stimson; William Reid; Aneta Neumann; Simon Ratcliffe; Frank Neumann 001 (CEC, 2023)

Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax. - Denis Antipov; Aneta Neumann; Frank Neumann 001 (FOGA, 2023)

On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. - Jakob Bossek; Aneta Neumann; Frank Neumann 001 (GECCO, 2023)

Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems. - Diksha Goel; Aneta Neumann; Frank Neumann 001; Hung Nguyen 004; Mingyu Guo (GECCO, 2023)

Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space. - Alejandro Marrero; Eduardo Segredo; Emma Hart; Jakob Bossek; Aneta Neumann (GECCO, 2023)

Diversity Optimization for the Detection and Concealment of Spatially Defined Communication Networks. - Aneta Neumann; Sharlotte Gounder; Xiankun Yan; Gregory Sherman; Benjamin Campbell; Mingyu Guo; Frank Neumann 001 (GECCO, 2023)

Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. - Anh Viet Do; Mingyu Guo; Aneta Neumann; Frank Neumann 001 (IJCAI, 2023)

Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. - Anh Viet Do; Aneta Neumann; Frank Neumann 001; Andrew M. Sutton (NeurIPS, 2023)

Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits. - Kokila Perera; Aneta Neumann; Frank Neumann 001 (CoRR, 2023)

On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. - Jakob Bossek; Aneta Neumann; Frank Neumann 001 (CoRR, 2023)

Special Issue on Theoretical Foundations of Evolutionary Computation. - Per Kristian Lehre; Aneta Neumann; Chao Qian 001 (Theor. Comput. Sci., 2023)

Limited Query Graph Connectivity Test. - Mingyu Guo; Jialiang Li 002; Aneta Neumann; Frank Neumann 001; Hung X. Nguyen (AAAI, 2024)

Multi-Objective Evolutionary Optimization for Large-Scale Open Pit Mine Scheduling. - Ishara Hewa Pathiranage; Aneta Neumann (CEC, 2024)

Evolutionary computation for stochastic problems. - Frank Neumann 001; Aneta Neumann; Hemant Kumar Singh (GECCO Companion, 2024)

Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem. - Saba Sadeghi Ahouei; Jacob de Nobel; Aneta Neumann; Thomas Bäck; Frank Neumann 001 (GECCO, 2024)

A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax. - Denis Antipov; Aneta Neumann; Frank Neumann 001 (GECCO, 2024)

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. - Benjamin Doerr; Joshua D. Knowles; Aneta Neumann; Frank Neumann 001 (GECCO, 2024)

The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms. - Thilina Pathirage Don; Aneta Neumann; Frank Neumann 001 (GECCO, 2024)

Evolutionary Diversity Optimisation for Sparse Directed Communication Networks. - Sharlotte Gounder; Frank Neumann 001; Aneta Neumann (GECCO, 2024)

Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes. - Adel Nikfarjam; Ty Stanford; Aneta Neumann; Dorothea Dumuid; Frank Neumann 001 (GECCO, 2024)

Effective 2- and 3-Objective MOEA/D Approaches for the Chance Constrained Knapsack Problem. - Ishara Hewa Pathiranage; Frank Neumann 001; Denis Antipov; Aneta Neumann (GECCO, 2024)

Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem. - Ishara Hewa Pathiranage; Frank Neumann 001; Denis Antipov; Aneta Neumann (GECCO, 2024)

Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. - Kokila Kasuni Perera; Aneta Neumann (GECCO, 2024)

Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. - Xiankun Yan; Aneta Neumann; Frank Neumann 001 (GECCO, 2024)

What Performance Indicators to Use for Self-Adaptation in Multi-Objective Evolutionary Algorithms. - Furong Ye; Frank Neumann 001; Jacob de Nobel; Aneta Neumann; Thomas Bäck (GECCO, 2024)

Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential. - Denis Antipov; Aneta Neumann; Frank Neumann 001 (PPSN (3), 2024)

Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem. - Denis Antipov; Aneta Neumann; Frank Neumann 001; Andrew M. Sutton (PPSN (3), 2024)

Evolutionary Multi-objective Diversity Optimization. - Anh Viet Do; Mingyu Guo; Aneta Neumann; Frank Neumann 001 (PPSN (4), 2024)

Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem. - Jonathan Gadea Harder; Aneta Neumann; Frank Neumann 001 (PPSN (3), 2024)

Multi-objective Evolutionary Approaches for the Knapsack Problem with Stochastic Profits. - Kokila Kasuni Perera; Frank Neumann 001; Aneta Neumann (PPSN (1), 2024)

Sliding Window Bi-objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions. - Xiankun Yan; Aneta Neumann; Frank Neumann 001 (PPSN (1), 2024)

Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. - Denis Antipov; Aneta Neumann; Frank Neumann 001; Andrew M. Sutton (CoRR, 2024)

Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization. - Maria Laura Santoni; Elena Raponi; Aneta Neumann; Frank Neumann 001; Mike Preuss; Carola Doerr (CoRR, 2024)

Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem. - Duc-Cuong Dang; Aneta Neumann; Frank Neumann 001; Andre Opris; Dirk Sudholt (CoRR, 2024)

On the Use of Quality Diversity Algorithms for the Travelling Thief Problem. - Adel Nikfarjam; Aneta Neumann; Frank Neumann 001 (ACM Trans. Evol. Learn. Optim., 2024)

Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem. - Thilina Pathirage Don; Aneta Neumann; Frank Neumann 001 (CEC, 2025)

Feature-Based Evolutionary Diversity Optimization of Discriminating Instances for Chance-Constrained Optimization Problems. - Saba Sadeghi Ahouei; Denis Antipov; Aneta Neumann; Frank Neumann 001 (EvoCOP@EvoStar, 2025)

Evolving Diverse Differentiating Stochastic Constraints Using Multi-objective Indicators. - Saba Sadeghi Ahouei; Aneta Neumann; Frank Neumann 001 (GECCO, 2025)

Evolutionary Multitasking for the Scenario-based Travelling Thief Problem. - Thilina Pathirage Don; Aneta Neumann; Frank Neumann 001 (GECCO, 2025)

Runtime Analysis of Evolutionary Multitasking for Classical Benchmark Problems. - Johannes Lengler; Aneta Neumann; Frank Neumann 001 (GECCO, 2025)

Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms. - Shuaiqun Pan; Yash J. Patel; Aneta Neumann; Frank Neumann 001; Thomas Bäck; Hao Wang 025 (GECCO, 2025)

On the Use of Matching Algorithms to Transfer Solutions for the Travelling Salesperson Problem. - Liam Wigney; Aneta Neumann; Yew-Soon Ong; Frank Neumann 001 (GECCO, 2025)

Quality Diversity Genetic Programming for Learning Scheduling Heuristics. - Meng Xu 008; Frank Neumann 001; Aneta Neumann; Yew Soon Ong (GECCO, 2025)

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. - Samuel Baguley; Tobias Friedrich 001; Aneta Neumann; Frank Neumann 001; Marcus Pappik; Ziena Zeif (Algorithmica, 2025)

Analysis of the (1+1) EA on LeadingOnes with Constraints. - Tobias Friedrich 001; Timo Kötzing; Aneta Neumann; Frank Neumann 001; Aishwarya Radhakrishnan (Algorithmica, 2025)