default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAneta Neumann
Person information
- affiliation: University of Adelaide, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j7]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): 12 (2024)- [c84]Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung X. Nguyen:
Limited Query Graph Connectivity Test. AAAI 2024: 20718-20725 - [c83]Ishara Hewa Pathiranage, Aneta Neumann:
Multi-Objective Evolutionary Optimization for Large-Scale Open Pit Mine Scheduling. CEC 2024: 1-8 - [c82]Frank Neumann, Aneta Neumann, Hemant Kumar Singh:
Evolutionary computation for stochastic problems. GECCO Companion 2024: 1352-1368 - [c81]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 - [c80]Denis Antipov, Aneta Neumann, Frank Neumann:
A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax. GECCO 2024 - [c79]Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann:
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. GECCO 2024 - [c78]Thilina Pathirage Don, Aneta Neumann, Frank Neumann:
The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms. GECCO 2024 - [c77]Sharlotte Gounder, Frank Neumann, Aneta Neumann:
Evolutionary Diversity Optimisation for Sparse Directed Communication Networks. GECCO 2024 - [c76]Adel Nikfarjam, Ty Stanford, Aneta Neumann, Dorothea Dumuid, Frank Neumann:
Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes. GECCO 2024 - [c75]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 - [c74]Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann:
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem. GECCO 2024 - [c73]Kokila Kasuni Perera, Aneta Neumann:
Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. GECCO 2024 - [c72]Xiankun Yan, Aneta Neumann, Frank Neumann:
Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. GECCO 2024 - [c71]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 - [c70]Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem. PPSN (3) 2024: 19-35 - [c69]Xiankun Yan, Aneta Neumann, Frank Neumann:
Sliding Window Bi-objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions. PPSN (1) 2024: 20-35 - [c68]Kokila Kasuni Perera, Frank Neumann, Aneta Neumann:
Multi-objective Evolutionary Approaches for the Knapsack Problem with Stochastic Profits. PPSN (1) 2024: 116-132 - [c67]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Evolutionary Multi-objective Diversity Optimization. PPSN (4) 2024: 117-134 - [c66]Jonathan Gadea Harder, Aneta Neumann, Frank Neumann:
Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem. PPSN (3) 2024: 149-165 - [c65]Denis Antipov, Aneta Neumann, Frank Neumann:
Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential. PPSN (3) 2024: 181-196 - [i62]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Evolutionary Multi-Objective Diversity Optimization. CoRR abs/2401.07454 (2024) - [i61]Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann:
A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. CoRR abs/2404.03838 (2024) - [i60]Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann:
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem. CoRR abs/2404.06014 (2024) - [i59]Kokila Perera, Aneta Neumann:
Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem. CoRR abs/2404.08219 (2024) - [i58]Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. CoRR abs/2404.11496 (2024) - [i57]Jonathan Gadea Harder, Aneta Neumann, Frank Neumann:
Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem. CoRR abs/2404.11784 (2024) - [i56]Xiankun Yan, Aneta Neumann, Frank Neumann:
Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. CoRR abs/2404.11907 (2024) - [i55]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 abs/2405.18772 (2024) - [i54]Denis Antipov, Aneta Neumann, Frank Neumann:
Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential. CoRR abs/2407.08963 (2024) - [i53]Xiankun Yan, Aneta Neumann, Frank Neumann:
Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions. CoRR abs/2407.09731 (2024) - [i52]Maria Laura Santoni, Elena Raponi, Aneta Neumann, Frank Neumann, Mike Preuss, Carola Doerr:
Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization. CoRR abs/2408.16393 (2024) - 2023
- [j6]Per Kristian Lehre, Aneta Neumann, Chao Qian:
Special Issue on Theoretical Foundations of Evolutionary Computation. Theor. Comput. Sci. 950: 113785 (2023) - [c64]Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen:
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. AAAI 2023: 5649-5656 - [c63]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: 1-9 - [c62]Michael Stimson, William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann:
Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. CEC 2023: 1-10 - [c61]Denis Antipov, Aneta Neumann, Frank Neumann:
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax. FOGA 2023: 3-14 - [c60]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: 248-256 - [c59]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: 312-320 - [c58]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: 1348-1356 - [c57]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: 1436-1444 - [c56]Frank Neumann, Aneta Neumann, Hemant K. Singh:
Evolutionary computation for stochastic problems. GECCO Companion 2023: 1463-1476 - [c55]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: 1537-1545 - [c54]Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan:
Analysis of (1+1) EA on LeadingOnes with Constraints. GECCO 2023: 1584-1592 - [c53]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. IJCAI 2023: 5558-5566 - [c52]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 - [i51]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 abs/2302.01464 (2023) - [i50]Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen:
Limited Query Graph Connectivity Test. CoRR abs/2302.13036 (2023) - [i49]Kokila Perera, Aneta Neumann, Frank Neumann:
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits. CoRR abs/2303.01695 (2023) - [i48]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 abs/2303.04611 (2023) - [i47]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 abs/2304.03998 (2023) - [i46]Michael Stimson, William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann:
Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. CoRR abs/2305.17957 (2023) - [i45]Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan:
Analysis of the (1+1) EA on LeadingOnes with Constraints. CoRR abs/2305.18267 (2023) - [i44]Jakob Bossek, Aneta Neumann, Frank Neumann:
On the Impact of Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. CoRR abs/2305.18955 (2023) - [i43]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 abs/2306.03409 (2023) - [i42]Denis Antipov, Aneta Neumann, Frank Neumann:
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax. CoRR abs/2307.07248 (2023) - [i41]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. CoRR abs/2307.07567 (2023) - 2022
- [j5]Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302: 103597 (2022) - [j4]Vahid Roostapour, Aneta Neumann, Frank Neumann:
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. Theor. Comput. Sci. 924: 129-147 (2022) - [j3]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Analysis of Evolutionary Diversity Optimization for Permutation Problems. ACM Trans. Evol. Learn. Optim. 2(3): 11:1-11:27 (2022) - [c51]Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen:
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. AAAI 2022: 9360-9367 - [c50]Adel Nikfarjam, Aneta Neumann, Frank Neumann:
On the use of quality diversity algorithms for the traveling thief problem. GECCO 2022: 260-268 - [c49]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Niching-based evolutionary diversity optimization for the traveling salesperson problem. GECCO 2022: 684-693 - [c48]Adel Nikfarjam, Aneta Neumann, Frank Neumann:
Evolutionary diversity optimisation for the traveling thief problem. GECCO 2022: 749-756 - [c47]Yue Xie, Aneta Neumann, Frank Neumann:
An optimization strategy for the complex large-scale stockpile blending problem. GECCO Companion 2022: 770-773 - [c46]Jakob Bossek, Aneta Neumann, Frank Neumann:
Evolutionary diversity optimization for combinatorial optimization: tutorial at GECCO'22, Boston, USA. GECCO Companion 2022: 824-842 - [c45]Aneta Neumann, Denis Antipov, Frank Neumann:
Coevolutionary Pareto diversity optimization. GECCO 2022: 832-839 - [c44]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: 1191-1199 - [c43]Aneta Neumann, Frank Neumann, Chao Qian:
Evolutionary submodular optimisation: tutorial. GECCO Companion 2022: 1427-1449 - [c42]Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann:
Co-evolutionary Diversity Optimisation for the Traveling Thief Problem. PPSN (1) 2022: 237-249 - [c41]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: 250-264 - [c40]Aneta Neumann, Yue Xie, Frank Neumann:
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. PPSN (1) 2022: 294-307 - [c39]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: 323-337 - [i40]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem. CoRR abs/2201.10316 (2022) - [i39]Adel Nikfarjam, Aneta Neumann, Frank Neumann:
Evolutionary Diversity Optimisation for The Traveling Thief Problem. CoRR abs/2204.02709 (2022) - [i38]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 abs/2204.03397 (2022) - [i37]Aneta Neumann, Denis Antipov, Frank Neumann:
Coevolutionary Pareto Diversity Optimization. CoRR abs/2204.05457 (2022) - [i36]Aneta Neumann, Yue Xie, Frank Neumann:
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. CoRR abs/2204.05597 (2022) - [i35]Yue Xie, Aneta Neumann, Ty Stanford, Charlotte Lund Rasmussen, Dorothea Dumuid, Frank Neumann:
Evolutionary Time-Use Optimization for Improving Children's Health Outcomes. CoRR abs/2206.11505 (2022) - [i34]Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann:
Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. CoRR abs/2207.14036 (2022) - [i33]Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann, Frank Neumann:
Computing High-Quality Solutions for the Patient Admission Scheduling Problem using Evolutionary Diversity Optimisation. CoRR abs/2207.14112 (2022) - [i32]Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen:
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. CoRR abs/2212.04326 (2022) - 2021
- [c38]Yue Xie, Aneta Neumann, Frank Neumann:
Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems. CEC 2021: 1288-1295 - [c37]Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann:
Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. FOGA 2021: 9:1-9:11 - [c36]Aneta Neumann, Jakob Bossek, Frank Neumann:
Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. GECCO 2021: 261-269 - [c35]Jakob Bossek, Aneta Neumann, Frank Neumann:
Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. GECCO 2021: 556-564 - [c34]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Analysis of evolutionary diversity optimisation for permutation problems. GECCO 2021: 574-582 - [c33]Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann:
Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. GECCO 2021: 600-608 - [c32]Aneta Neumann, Frank Neumann, Chao Qian:
Evolutionary submodular optimisation. GECCO Companion 2021: 918-940 - [c31]Yue Xie, Aneta Neumann, Frank Neumann:
Heuristic strategies for solving complex interacting stockpile blending problem with chance constraints. GECCO 2021: 1079-1087 - [c30]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: 1187-1194 - [c29]William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann:
Advanced mine optimisation under uncertainty using evolution. GECCO Companion 2021: 1605-1613 - [c28]Jakob Bossek, Aneta Neumann, Frank Neumann:
Exact Counting and Sampling of Optima for the Knapsack Problem. LION 2021: 40-54 - [i31]William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann:
Advanced Ore Mine Optimisation under Uncertainty Using Evolution. CoRR abs/2102.05235 (2021) - [i30]Yue Xie, Aneta Neumann, Frank Neumann:
Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraints. CoRR abs/2102.05303 (2021) - [i29]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 abs/2102.05778 (2021) - [i28]Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann:
Analysis of Evolutionary Diversity Optimisation for Permutation Problems. CoRR abs/2102.11469 (2021) - [i27]Yue Xie, Aneta Neumann, Frank Neumann:
Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems. CoRR abs/2104.03440 (2021) - [i26]Jakob Bossek, Aneta Neumann, Frank Neumann:
Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. CoRR abs/2104.13133 (2021) - [i25]Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann:
Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. CoRR abs/2104.13538 (2021) - [i24]Jakob Bossek, Aneta Neumann, Frank Neumann:
Exact Counting and Sampling of Optima for the Knapsack Problem. CoRR abs/2106.07412 (2021) - [i23]Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann:
Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation. CoRR abs/2108.05005 (2021) - [i22]Adel Nikfarjam, Aneta Neumann, Frank Neumann:
On the Use of Quality Diversity Algorithms for The Traveling Thief Problem. CoRR abs/2112.08627 (2021) - [i21]Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen:
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. CoRR abs/2112.13175 (2021) - 2020
- [j2]Aneta Neumann, Bradley Alexander, Frank Neumann:
Evolutionary Image Transition and Painting Using Random Walks. Evol. Comput. 28(4): 643-675 (2020) - [c27]Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Optimization of Chance-Constrained Submodular Functions. AAAI 2020: 1460-1467 - [c26]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: 307-314 - [c25]Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Aneta Neumann, Frank Neumann, Francesco Quinzan:
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. ECAI 2020: 435-442 - [c24]Yue Xie, Aneta Neumann, Frank Neumann:
Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. GECCO 2020: 271-279 - [c23]Anh Viet Do, Jakob Bossek, Aneta Neumann, Frank Neumann:
Evolving diverse sets of tours for the travelling salesperson problem. GECCO 2020: 681-689 - [c22]Aneta Neumann, Frank Neumann:
Evolutionary computation for digital art. GECCO Companion 2020: 901-926 - [c21]Jakob Bossek, Carola Doerr, Pascal Kerschke, Aneta Neumann, Frank Neumann:
Evolving Sampling Strategies for One-Shot Optimization Tasks. PPSN (1) 2020: 111-124 - [c20]Jakob Bossek, Aneta Neumann, Frank Neumann:
Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. PPSN (1) 2020: 346-359 - [c19]Aneta Neumann, Frank Neumann:
Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. PPSN (1) 2020: 404-417 - [c18]Aneta Neumann, Frank Neumann:
Human Interactive EEG-Based Evolutionary Image Animation. SSCI 2020: 678-685 - [i20]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. CoRR abs/2002.06766 (2020) - [i19]Aneta Neumann, Bradley Alexander, Frank Neumann:
Evolutionary Image Transition and Painting Using Random Walks. CoRR abs/2003.01517 (2020) - [i18]Yue Xie, Aneta Neumann, Frank Neumann:
Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR abs/2004.03205 (2020) - [i17]Anh Viet Do, Jakob Bossek, Aneta Neumann, Frank Neumann:
Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. CoRR abs/2004.09188 (2020) - [i16]Vahid Roostapour, Aneta Neumann, Frank Neumann:
Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem. CoRR abs/2004.12574 (2020) - [i15]Jakob Bossek, Aneta Neumann, Frank Neumann:
Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. CoRR abs/2006.03260 (2020) - [i14]Aneta Neumann, Frank Neumann:
Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-Objective Algorithms. CoRR abs/2006.11444 (2020) - [i13]Aneta Neumann, Jakob Bossek, Frank Neumann:
Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems. CoRR abs/2010.11486 (2020)
2010 – 2019
- 2019
- [j1]Aneta Neumann, Frank Neumann, Tobias Friedrich:
Quasi-random Image Transition and Animation. Aust. J. Intell. Inf. Process. Syst. 16(1): 10-18 (2019) - [c17]Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto Optimization for Subset Selection with Dynamic Cost Constraints. AAAI 2019: 2354-2361 - [c16]Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, Heike Trautmann:
Evolving diverse TSP instances by means of novel and creative mutation operators. FOGA 2019: 58-71 - [c15]Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann:
Evolutionary algorithms for the chance-constrained knapsack problem. GECCO 2019: 338-346 - [c14]Aneta Neumann, Wanru Gao, Markus Wagner, Frank Neumann:
Evolutionary diversity optimization using multi-objective indicators. GECCO 2019: 837-845 - [c13]Aneta Neumann, Frank Neumann:
Evolutionary computation for digital art. GECCO (Companion) 2019: 1056-1076 - [c12]Bradley Alexander, David Hin, Aneta Neumann, Safwan Ull-Karim:
Evolving Pictures in Image Transition Space. ICONIP (1) 2019: 679-690 - [i12]Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann:
Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR abs/1902.04767 (2019) - [i11]Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Frank Neumann, Aneta Neumann, Francesco Quinzan:
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. CoRR abs/1911.06791 (2019) - [i10]Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton:
Optimization of Chance-Constrained Submodular Functions. CoRR abs/1911.11451 (2019) - [i9]Jakob Bossek, Pascal Kerschke, Aneta Neumann, Frank Neumann, Carola Doerr:
One-Shot Decision-Making with and without Surrogates. CoRR abs/1912.08956 (2019) - 2018
- [c11]Aneta Neumann, Frank Neumann:
On the Use of Colour-Based Segmentation in Evolutionary Image Composition. CEC 2018: 1-8 - [c10]Aneta Neumann, Frank Neumann:
Evolutionary computation for digital art. GECCO (Companion) 2018: 937-955 - [c9]Aneta Neumann, Wanru Gao, Carola Doerr, Frank Neumann, Markus Wagner:
Discrepancy-based evolutionary diversity optimization. GECCO 2018: 991-998 - [c8]Aneta Neumann, Christo Pyromallis, Bradley Alexander:
Evolution of Images with Diversity and Constraints Using a Generative Adversarial Network. ICONIP (6) 2018: 452-465 - [c7]Vahid Roostapour, Aneta Neumann, Frank Neumann:
On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. PPSN (1) 2018: 158-169 - [i8]Aneta Neumann, Wanru Gao, Carola Doerr, Frank Neumann, Markus Wagner:
Discrepancy-based Evolutionary Diversity Optimization. CoRR abs/1802.05448 (2018) - [i7]Aneta Neumann, Christo Pyromallis, Bradley Alexander:
Evolution of Images with Diversity and Constraints Using a Generator Network. CoRR abs/1802.05480 (2018) - [i6]Aneta Neumann, Wanru Gao, Markus Wagner, Frank Neumann:
Evolutionary Diversity Optimization Using Multi-Objective Indicators. CoRR abs/1811.06804 (2018) - [i5]Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs/1811.07806 (2018) - 2017
- [c6]Wenwen Li, Ender Özcan, Robert I. John, John H. Drake, Aneta Neumann, Markus Wagner:
A modified indicator-based evolutionary algorithm (mIBEA). CEC 2017: 1047-1054 - [c5]Aneta Neumann, Bradley Alexander, Frank Neumann:
Evolutionary Image Transition Using Random Walks. EvoMUSART 2017: 230-245 - [c4]Mohamed El Yafrani, Shelvin Chand, Aneta Neumann, Belaïd Ahiod, Markus Wagner:
Multi-objectiveness in the single-objective traveling thief problem. GECCO (Companion) 2017: 107-108 - [c3]Bradley Alexander, James Kortman, Aneta Neumann:
Evolution of artistic image variants through feature based diversity optimisation. GECCO 2017: 171-178 - [c2]Aneta Neumann, Zygmunt L. Szpak, Wojciech Chojnacki, Frank Neumann:
Evolutionary image composition using feature covariance matrices. GECCO 2017: 817-824 - [i4]Aneta Neumann, Zygmunt L. Szpak, Wojciech Chojnacki, Frank Neumann:
Evolutionary Image Composition Using Feature Covariance Matrices. CoRR abs/1703.03773 (2017) - [i3]Aneta Neumann, Frank Neumann, Tobias Friedrich:
Quasi-random Agents for Image Transition and Animation. CoRR abs/1710.07421 (2017) - 2016
- [c1]Aneta Neumann, Bradley Alexander, Frank Neumann:
The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation. ICONIP (3) 2016: 261-268 - [i2]Aneta Neumann, Bradley Alexander, Frank Neumann:
Evolutionary Image Transition Based on Theoretical Insights of Random Processes. CoRR abs/1604.06187 (2016) - [i1]Aneta Neumann, Bradley Alexander, Frank Neumann:
The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation. CoRR abs/1608.01783 (2016)
Coauthor Index
[j7] [c84] [c82] [c81] [c80] [c79] [c78] [c77] [c76] [c75] [c74] [c72] [c71] [c70] [c69] [c68] [c67] [c66] [c65] [i62] [i61] [i60] [i58] [i57] [i56] [i55] [i54] [i53] [i52] [c64] [c63] [c62] [c61] [c60] [c58] [c57] [c56] [c55] [c54] [c53] [c52] [i51] [i50] [i49] [i48] [i47] [i46] [i45] [i44] [i43] [i42] [i41] [j5] [j4] [j3] [c51] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [i40] [i39] [i38] [i37] [i36] [i35] [i34] [i33] [i32] [c38] [c37] [c36] [c35] [c34] [c33] [c32] [c31] [c30] [c29] [c28] [i31] [i30] [i29] [i28] [i27] [i26] [i25] [i24] [i23] [i22] [i21] [j2] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [i20] [i19] [i18] [i17] [i16] [i15] [i14] [i13] [j1] [c17] [c16] [c15] [c14] [c13] [i12] [i11] [i10] [i9] [c11] [c10] [c9] [c7] [i8] [i6] [i5] [c5] [c2] [i4] [i3] [c1] [i2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
