Aneta Neumann

ORCID

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 146

Top Venues

Publications

Benjamin Doerr, Joshua Knowles, Aneta Neumann, Frank Neumann
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. GECCO (2024)
Benjamin Doerr, Joshua Knowles, Aneta Neumann, Frank Neumann
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. CoRR (2024)
Adel Nikfarjam, Aneta Neumann, Frank Neumann
On the Use of Quality Diversity Algorithms for the Travelling Thief Problem. ACM Trans. Evol. Learn. Optim. 4 (2) (2024)
Furong Ye, Frank Neumann, Jacob de Nobel, Aneta Neumann, Thomas Bäck
What Performance Indicators to Use for Self-Adaptation in Multi-Objective Evolutionary Algorithms. GECCO (2024)
Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem. GECCO (2024)
Denis Antipov, Aneta Neumann, Frank Neumann
A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax. GECCO (2024)
Jonathan Gadea Harder, Aneta Neumann, Frank Neumann
Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem. CoRR (2024)
Xiankun Yan, Aneta Neumann, Frank Neumann
Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions. CoRR (2024)
Kokila Kasuni Perera, Aneta Neumann
Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. GECCO (2024)
Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
Evolutionary Multi-Objective Diversity Optimization. CoRR (2024)
Saba Sadeghi Ahouei, Jacob de Nobel, Aneta Neumann, Thomas Bäck, Frank Neumann
Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem. GECCO (2024)
Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann
Effective 2- and 3-Objective MOEA/D Approaches for the Chance Constrained Knapsack Problem. GECCO (2024)
Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. CoRR (2024)
Kokila Perera, Aneta Neumann
Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. CoRR (2024)
Xiankun Yan, Aneta Neumann, Frank Neumann
Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. CoRR (2024)
Sharlotte Gounder, Frank Neumann, Aneta Neumann
Evolutionary Diversity Optimisation for Sparse Directed Communication Networks. GECCO (2024)
Denis Antipov, Aneta Neumann, Frank Neumann
Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential. CoRR (2024)
Saba Sadeghi Ahouei, Jacob de Nobel, Aneta Neumann, Thomas Bäck, Frank Neumann
Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem. CoRR (2024)
Xiankun Yan, Aneta Neumann, Frank Neumann
Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. GECCO (2024)
Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem. CoRR (2024)
Frank Neumann, Aneta Neumann, Hemant Kumar Singh
Evolutionary computation for stochastic problems. GECCO Companion (2024)
Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung X. Nguyen
Limited Query Graph Connectivity Test. AAAI (2024)
Thilina Pathirage Don, Aneta Neumann, Frank Neumann
The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms. GECCO (2024)
Adel Nikfarjam, Ty Stanford, Aneta Neumann, Dorothea Dumuid, Frank Neumann
Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes. GECCO (2024)
Ishara Hewa Pathiranage, Aneta Neumann
Multi-Objective Evolutionary Optimization for Large-Scale Open Pit Mine Scheduling. CEC (2024)
Denis Antipov, Aneta Neumann, Frank Neumann
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax. CoRR (2023)
Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. AAAI (2023)
Diksha Goel, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo
Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems. CoRR (2023)
Frank Neumann, Aneta Neumann, Chao Qian, Anh Viet Do, Jacob de Nobel, Diederick Vermetten, Saba Sadeghi Ahouei, Furong Ye, Hao Wang, Thomas Bäck
Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. CEC (2023)
Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
Analysis of the (1+1) EA on LeadingOnes with Constraints. CoRR (2023)
Alejandro Marrero, Eduardo Segredo, Emma Hart, Jakob Bossek, Aneta Neumann
Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space. GECCO (2023)
Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. GECCO (2023)
Denis Antipov, Aneta Neumann, Frank Neumann
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax. FOGA (2023)
Diksha Goel, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo
Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems. GECCO (2023)
Frank Neumann, Aneta Neumann, Hemant K. Singh
Evolutionary computation for stochastic problems. GECCO Companion (2023)
Jakob Bossek, Aneta Neumann, Frank Neumann
On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. CoRR (2023)
Michael Stimson, William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann
Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. CoRR (2023)
Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. IJCAI (2023)
Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen
Limited Query Graph Connectivity Test. CoRR (2023)
Aneta Neumann, Sharlotte Gounder, Xiankun Yan, Gregory Sherman, Benjamin Campbell, Mingyu Guo, Frank Neumann
Diversity Optimization for the Detection and Concealment of Spatially Defined Communication Networks. GECCO (2023)
Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. CoRR (2023)
Per Kristian Lehre, Aneta Neumann, Chao Qian
Special Issue on Theoretical Foundations of Evolutionary Computation. Theor. Comput. Sci. 950 (2023)
Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. CoRR (2023)
Furong Ye, Frank Neumann, Jacob de Nobel, Aneta Neumann, Thomas Bäck
What Performance Indicators to Use for Self-Adaptation in Multi-Objective Evolutionary Algorithms. CoRR (2023)
Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
Analysis of (1+1) EA on LeadingOnes with Constraints. GECCO (2023)
Kokila Perera, Aneta Neumann, Frank Neumann
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits. CoRR (2023)
Michael Stimson, William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann
Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. CEC (2023)
Frank Neumann, Aneta Neumann, Chao Qian, Anh Viet Do, Jacob de Nobel, Diederick Vermetten, Saba Sadeghi Ahouei, Furong Ye, Hao Wang, Thomas Bäck
Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. CoRR (2023)
Jakob Bossek, Aneta Neumann, Frank Neumann
On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. GECCO (2023)
Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. NeurIPS (2023)
Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann, Frank Neumann
Computing High-Quality Solutions for the Patient Admission Scheduling Problem using Evolutionary Diversity Optimisation. CoRR (2022)
Adel Nikfarjam, Aneta Neumann, Frank Neumann
Evolutionary diversity optimisation for the traveling thief problem. GECCO (2022)
Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
Niching-based evolutionary diversity optimization for the traveling salesperson problem. GECCO (2022)
Aneta Neumann, Denis Antipov, Frank Neumann
Coevolutionary Pareto diversity optimization. GECCO (2022)
Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann, Frank Neumann
Computing High-Quality Solutions for the Patient Admission Scheduling Problem Using Evolutionary Diversity Optimisation. PPSN (1) (2022)
Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. CoRR (2022)
Adel Nikfarjam, Aneta Neumann, Frank Neumann
On the use of quality diversity algorithms for the traveling thief problem. GECCO (2022)
Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. AAAI (2022)
Aneta Neumann, Yue Xie, Frank Neumann
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. CoRR (2022)
Jakob Bossek, Aneta Neumann, Frank Neumann
Evolutionary diversity optimization for combinatorial optimization: tutorial at GECCO'22, Boston, USA. GECCO Companion (2022)
Diksha Goel, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo
Defending Active Directory by Combining Neural Network based Dynamic Program and Evolutionary Diversity Optimisation. CoRR (2022)
Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
Analysis of Evolutionary Diversity Optimization for Permutation Problems. ACM Trans. Evol. Learn. Optim. 2 (3) (2022)
Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem. CoRR (2022)
Yue Xie, Aneta Neumann, Ty Stanford, Charlotte Lund Rasmussen, Dorothea Dumuid, Frank Neumann
Evolutionary Time-Use Optimization for Improving Children's Health Outcomes. PPSN (2) (2022)
Adel Nikfarjam, Aneta Neumann, Frank Neumann
Evolutionary Diversity Optimisation for The Traveling Thief Problem. CoRR (2022)
Diksha Goel, Max Hector Ward-Graham, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo
Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation. GECCO (2022)
Aneta Neumann, Yue Xie, Frank Neumann
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. PPSN (1) (2022)
Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann
Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. CoRR (2022)
Yue Xie, Aneta Neumann, Ty Stanford, Charlotte Lund Rasmussen, Dorothea Dumuid, Frank Neumann
Evolutionary Time-Use Optimization for Improving Children's Health Outcomes. CoRR (2022)
Vahid Roostapour, Aneta Neumann, Frank Neumann
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. Theor. Comput. Sci. 924 (2022)
Aneta Neumann, Denis Antipov, Frank Neumann
Coevolutionary Pareto Diversity Optimization. CoRR (2022)
Aneta Neumann, Frank Neumann, Chao Qian
Evolutionary submodular optimisation: tutorial. GECCO Companion (2022)
Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann
Co-evolutionary Diversity Optimisation for the Traveling Thief Problem. PPSN (1) (2022)
Yue Xie, Aneta Neumann, Frank Neumann
An optimization strategy for the complex large-scale stockpile blending problem. GECCO Companion (2022)
Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302 (2022)
Adel Nikfarjam, Aneta Neumann, Frank Neumann
On the Use of Quality Diversity Algorithms for The Traveling Thief Problem. CoRR (2021)
Jakob Bossek, Aneta Neumann, Frank Neumann
Exact Counting and Sampling of Optima for the Knapsack Problem. CoRR (2021)
Yue Xie, Aneta Neumann, Frank Neumann
Heuristic strategies for solving complex interacting stockpile blending problem with chance constraints. GECCO (2021)
Aneta Neumann, Jakob Bossek, Frank Neumann
Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. GECCO (2021)
Jakob Bossek, Aneta Neumann, Frank Neumann
Exact Counting and Sampling of Optima for the Knapsack Problem. LION (2021)
Yue Xie, Aneta Neumann, Frank Neumann
Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems. CoRR (2021)
Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. CoRR (2021)
Jakob Bossek, Aneta Neumann, Frank Neumann
Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. GECCO (2021)
Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. FOGA (2021)
Yue Xie, Aneta Neumann, Frank Neumann
Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraints. CoRR (2021)
Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
Analysis of Evolutionary Diversity Optimisation for Permutation Problems. CoRR (2021)
William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann
Advanced Ore Mine Optimisation under Uncertainty Using Evolution. CoRR (2021)
Yue Xie, Aneta Neumann, Frank Neumann
Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems. CEC (2021)
Jakob Bossek, Aneta Neumann, Frank Neumann
Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. CoRR (2021)
Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights. CoRR (2021)
Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
Analysis of evolutionary diversity optimisation for permutation problems. GECCO (2021)
Aneta Neumann, Frank Neumann, Chao Qian
Evolutionary submodular optimisation. GECCO Companion (2021)
Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation. CoRR (2021)
William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann
Advanced mine optimisation under uncertainty using evolution. GECCO Companion (2021)
Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. GECCO (2021)
Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann
Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. GECCO (2021)
Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. CoRR (2021)
Yue Xie, Aneta Neumann, Frank Neumann
Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR (2020)
Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann
Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. ECAI (2020)
Aneta Neumann, Frank Neumann
Evolutionary computation for digital art. GECCO Companion (2020)

Aneta Neumann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Aneta Neumann