Aneta Neumann
Orcid: 0000-0002-0036-4782Affiliations:
- University of Adelaide, Australia
According to our database1,
Aneta Neumann
authored at least 98 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2024
ACM Trans. Evol. Learn. Optim., June, 2024
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem.
CoRR, 2024
Sliding Window Bi-objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Multi-objective Evolutionary Approaches for the Knapsack Problem with Stochastic Profits.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024
What Performance Indicators to Use for Self-Adaptation in Multi-Objective Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Effective 2- and 3-Objective MOEA/D Approaches for the Chance Constrained Knapsack Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2024
Proceedings of the IEEE Congress on Evolutionary Computation, 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Theor. Comput. Sci., March, 2023
On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.
CoRR, 2023
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits.
CoRR, 2023
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Diversity Optimization for the Detection and Concealment of Spatially Defined Communication Networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
Proceedings of the Genetic and Evolutionary Computation Conference, 2023
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023
Proceedings of the IEEE Congress on Evolutionary Computation, 2023
Proceedings of the IEEE Congress on Evolutionary Computation, 2023
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
ACM Trans. Evol. Learn. Optim., 2022
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints.
Theor. Comput. Sci., 2022
Artif. Intell., 2022
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022
Computing High-Quality Solutions for the Patient Admission Scheduling Problem Using Evolutionary Diversity Optimisation.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022
Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
Niching-based evolutionary diversity optimization for the traveling salesperson problem.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022
Evolutionary diversity optimization for combinatorial optimization: tutorial at GECCO'22, Boston, USA.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021
Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Heuristic strategies for solving complex interacting stockpile blending problem with chance constraints.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Entropy-based evolutionary diversity optimisation for the traveling salesperson problem.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation.
Proceedings of the FOGA '21: Foundations of Genetic Algorithms XVI, 2021
Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021
2020
CoRR, 2020
CoRR, 2020
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020
Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020
Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020
Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020
Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
Aust. J. Intell. Inf. Process. Syst., 2019
Proceedings of the Neural Information Processing - 26th International Conference, 2019
Proceedings of the Genetic and Evolutionary Computation Conference, 2019
Proceedings of the Genetic and Evolutionary Computation Conference, 2019
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019
2018
CoRR, 2018
On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018
Evolution of Images with Diversity and Constraints Using a Generative Adversarial Network.
Proceedings of the Neural Information Processing - 25th International Conference, 2018
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018
Proceedings of the Genetic and Evolutionary Computation Conference, 2018
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018
2017
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
Proceedings of the Computational Intelligence in Music, Sound, Art and Design, 2017
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017
2016
CoRR, 2016
The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation.
Proceedings of the Neural Information Processing - 23rd International Conference, 2016