| 2026 | GECCO | Hot off the Press: Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. | Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton |
| 2026 | GECCO | Hot of the Press: Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem. | Duc-Cuong Dang, Aneta Neumann, Frank Neumann, Andre Opris, Dirk Sudholt |
| 2026 | GECCO | A Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples. | Joshua D. Knowles, Per Kristian Lehre, Shishen Lin, Frank Neumann, Janina Schreiber, Christine Zarges |
| 2026 | GECCO | Evolutionary Algorithms for Generating Graphs Matching Desired Laplacian Spectra. | Hendrik Richter, Frank Neumann |
| 2026 | GECCO | Block-Bench: A Framework for Controllable and Transparent Discrete Optimization Benchmarking. | Furong Ye, Frank Neumann, Thomas Bck, Niki van Stein |
| 2026 | PPSN | The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics. | Helen Yuliana Angmalisang, Frank Neumann |
| 2026 | PPSN | Effective Traveling for Metric Instances of the Traveling Thief Problem. | Jan Eube, Kelin Luo, Aneta Neumann, Frank Neumann, Heiko Rglin |
| 2026 | PPSN | Evolutionary Algorithms and Multi-objective Minimum Spanning Trees with Limited Distinct Weight Values. | Narges Tavassoli Kejani, Andrew M. Sutton, Frank Neumann |
| 2026 | PPSN | Multitask Pareto Optimization for Monotone Submodular Problems with Dynamic Constraints. | Liam Wigney, Frank Neumann |
| 2026 | PPSN | Insights from Multi-tasking the EAX Algorithm for the Travelling Salesperson Problem. | Liam Wigney, Aneta Neumann, Yew Soon Ong, Frank Neumann |
| 2025 | CEC | Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem. | Thilina Pathirage Don, Aneta Neumann, Frank Neumann |
| 2025 | EvoCOP | Feature-Based Evolutionary Diversity Optimization of Discriminating Instances for Chance-Constrained Optimization Problems. | Saba Sadeghi Ahouei, Denis Antipov, Aneta Neumann, Frank Neumann |
| 2025 | FOGA | Population Dynamics and Improved Runtime Guarantees for the (μ+1) EA on BinVal. | Martin S. Krejca, Frank Neumann, Carsten Witt |
| 2025 | FOGA | Trust Region-Based Bayesian Optimisation to Discover Diverse Solutions. | Kokila Kasuni Perera, Frank Neumann, Aneta Neumann |
| 2025 | GECCO | Evolutionary computation for stochastic problems. | Frank Neumann, Aneta Neumann, Hemant K. Singh |
| 2025 | GECCO | Evolving Diverse Differentiating Stochastic Constraints Using Multi-objective Indicators. | Saba Sadeghi Ahouei, Aneta Neumann, Frank Neumann |
| 2025 | GECCO | Evolutionary Multitasking for the Scenario-based Travelling Thief Problem. | Thilina Pathirage Don, Aneta Neumann, Frank Neumann |
| 2025 | GECCO | Runtime Analysis of Evolutionary Multitasking for Classical Benchmark Problems. | Johannes Lengler, Aneta Neumann, Frank Neumann |
| 2025 | GECCO | Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms. | Shuaiqun Pan, Yash J. Patel, Aneta Neumann, Frank Neumann, Thomas Bck, Hao Wang |
| 2025 | GECCO | On the Use of Matching Algorithms to Transfer Solutions for the Travelling Salesperson Problem. | Liam Wigney, Aneta Neumann, Yew-Soon Ong, Frank Neumann |
| 2025 | GECCO | Quality Diversity Genetic Programming for Learning Scheduling Heuristics. | Meng Xu, Frank Neumann, Aneta Neumann, Yew Soon Ong |
| 2025 | IJCAI | Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem. | Duc-Cuong Dang, Aneta Neumann, Frank Neumann, Andre Opris, Dirk Sudholt |
| 2024 | AAAI | Limited Query Graph Connectivity Test. | Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung X. Nguyen |
| 2024 | CEC | Enhanced Genetic Programming Models with Multiple Equations for Accurate Semi-Autogenous Grinding Mill Throughput Prediction. | Zahra Ghasemi, Mehdi Neshat, Chris Aldrich, John Karageorgos, Max Zanin, Frank Neumann, Lei Chen |
| 2024 | GECCO | Evolutionary computation for stochastic problems. | Frank Neumann, Aneta Neumann, Hemant Kumar Singh |
| 2024 | GECCO | Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem. | Saba Sadeghi Ahouei, Jacob de Nobel, Aneta Neumann, Thomas Bck, Frank Neumann |
| 2024 | GECCO | A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax. | Denis Antipov, Aneta Neumann, Frank Neumann |
| 2024 | GECCO | A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis. | Benjamin Doerr, Joshua D. Knowles, Aneta Neumann, Frank Neumann |
| 2024 | GECCO | The Chance Constrained Travelling Thief Problem: Problem Formulations and Algorithms. | Thilina Pathirage Don, Aneta Neumann, Frank Neumann |
| 2024 | GECCO | Evolutionary Diversity Optimisation for Sparse Directed Communication Networks. | Sharlotte Gounder, Frank Neumann, Aneta Neumann |
| 2024 | GECCO | Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes. | Adel Nikfarjam, Ty Stanford, Aneta Neumann, Dorothea Dumuid, Frank Neumann |
| 2024 | GECCO | Runtime Analyses of NSGA-III on Many-Objective Problems. | Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt |
| 2024 | GECCO | Effective 2- and 3-Objective MOEA/D Approaches for the Chance Constrained Knapsack Problem. | Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann |
| 2024 | GECCO | Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem. | Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov, Aneta Neumann |
| 2024 | GECCO | Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions. | Marcus Schmidbauer, Andre Opris, Jakob Bossek, Frank Neumann, Dirk Sudholt |
| 2024 | GECCO | Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems. | Xiankun Yan, Aneta Neumann, Frank Neumann |
| 2024 | GECCO | What Performance Indicators to Use for Self-Adaptation in Multi-Objective Evolutionary Algorithms. | Furong Ye, Frank Neumann, Jacob de Nobel, Aneta Neumann, Thomas Bck |
| 2024 | PPSN | Local Optima in Diversity Optimization: Non-trivial Offspring Population is Essential. | Denis Antipov, Aneta Neumann, Frank Neumann |
| 2024 | PPSN | Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem. | Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton |
| 2024 | PPSN | Evolutionary Multi-objective Diversity Optimization. | Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann |
| 2024 | PPSN | Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem. | Jonathan Gadea Harder, Aneta Neumann, Frank Neumann |
| 2024 | PPSN | Archive-Based Single-Objective Evolutionary Algorithms for Submodular Optimization. | Frank Neumann, Gnter Rudolph |
| 2024 | PPSN | Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints. | Frank Neumann, Carsten Witt |
| 2024 | PPSN | Multi-objective Evolutionary Approaches for the Knapsack Problem with Stochastic Profits. | Kokila Kasuni Perera, Frank Neumann, Aneta Neumann |
| 2024 | PPSN | Sliding Window Bi-objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions. | Xiankun Yan, Aneta Neumann, Frank Neumann |
| 2023 | AAAI | Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs. | Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen |
| 2023 | CEC | Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler. | Frank Neumann, Aneta Neumann, Chao Qian, Anh Viet Do, Jacob de Nobel, Diederick Vermetten, Saba Sadeghi Ahouei, Furong Ye, Hao Wang, Thomas Bck |
| 2023 | CEC | Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting. | Michael Stimson, William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann |
| 2023 | ECAI | Fast Pareto Optimization Using Sliding Window Selection. | Frank Neumann, Carsten Witt |
| 2023 | ECAI | Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties. | Xiankun Yan, Anh Viet Do, Feng Shi, Xiaoyu Qin, Frank Neumann |
| 2023 | FOGA | Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax. | Denis Antipov, Aneta Neumann, Frank Neumann |
| 2023 | FOGA | Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers. | Jack Kearney, Frank Neumann, Andrew M. Sutton |
| 2023 | GECCO | Analysis of (1+1) EA on LeadingOnes with Constraints. | Tobias Friedrich, Timo Ktzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan |
| 2023 | GECCO | Evolutionary computation for stochastic problems. | Frank Neumann, Aneta Neumann, Hemant K. Singh |
| 2023 | GECCO | 3-Objective Pareto Optimization for Problems with Chance Constraints. | Frank Neumann, Carsten Witt |
| 2023 | GECCO | Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. | Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif |
| 2023 | GECCO | 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 |
| 2023 | GECCO | Evolving Reinforcement Learning Environment to Minimize Learner's Achievable Reward: An Application on Hardening Active Directory Systems. | Diksha Goel, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo |
| 2023 | GECCO | 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 |
| 2023 | GECCO | Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. | Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich |
| 2023 | GI | Agilitt, Praxisbezug und Teamarbeit im Softwareentwicklungsprojekt der Ingenieurinformatik. | Frank Neumann, Christina Kratsch |
| 2023 | GI | Foundations for applied artificial intelligence: enabling and supporting AI teaching and research. | Ricardo Knauer, Raphael Wallsberger, Marvin Grimm, Marian Bookhahn, Frank Neumann, Stephan Matzka, Erik Rodner |
| 2023 | IJCAI | Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint. | Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann |
| 2022 | AAAI | Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs. | Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen |
| 2022 | GECCO | The compact genetic algorithm struggles on Cliff functions. | Frank Neumann, Dirk Sudholt, Carsten Witt |
| 2022 | GECCO | Exploring the feature space of TSP instances using quality diversity. | Jakob Bossek, Frank Neumann |
| 2022 | GECCO | Evolutionary diversity optimization for combinatorial optimization: tutorial at GECCO'22, Boston, USA. | Jakob Bossek, Aneta Neumann, Frank Neumann |
| 2022 | GECCO | Niching-based evolutionary diversity optimization for the traveling salesperson problem. | Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann |
| 2022 | GECCO | Defending active directory by combining neural network based dynamic program and evolutionary diversity optimisation. | Diksha Goel, Max Hector Ward-Graham, Aneta Neumann, Frank Neumann, Hung Nguyen, Mingyu Guo |
| 2022 | GECCO | Evolutionary submodular optimisation: tutorial. | Aneta Neumann, Frank Neumann, Chao Qian |
| 2022 | GECCO | Coevolutionary Pareto diversity optimization. | Aneta Neumann, Denis Antipov, Frank Neumann |
| 2022 | GECCO | On the use of quality diversity algorithms for the traveling thief problem. | Adel Nikfarjam, Aneta Neumann, Frank Neumann |
| 2022 | GECCO | Evolutionary diversity optimisation for the traveling thief problem. | Adel Nikfarjam, Aneta Neumann, Frank Neumann |
| 2022 | GECCO | An optimization strategy for the complex large-scale stockpile blending problem. | Yue Xie, Aneta Neumann, Frank Neumann |
| 2022 | GI | Concept, Implementation and Evaluation of a Virtual Learning Environment for Acquiring Competences in Android App Development. | Frank Neumann, Juan Carlos Rodrguez-del-Pino, Sebastian Homer |
| 2022 | IJCAI | Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables. | Frank Neumann, Carsten Witt |
| 2022 | PPSN | Theoretical Study of Optimizing Rugged Landscapes with the cGA. | Tobias Friedrich, Timo Ktzing, Frank Neumann, Aishwarya Radhakrishnan |
| 2022 | PPSN | Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions. | Frank Neumann, Carsten Witt |
| 2022 | PPSN | Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. | Aneta Neumann, Yue Xie, Frank Neumann |
| 2022 | PPSN | Analysis of Quality Diversity Algorithms for the Knapsack Problem. | Adel Nikfarjam, Anh Viet Do, Frank Neumann |
| 2022 | PPSN | Computing High-Quality Solutions for the Patient Admission Scheduling Problem Using Evolutionary Diversity Optimisation. | Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann, Frank Neumann |
| 2022 | PPSN | Co-evolutionary Diversity Optimisation for the Traveling Thief Problem. | Adel Nikfarjam, Aneta Neumann, Jakob Bossek, Frank Neumann |
| 2022 | PPSN | Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem. | Feng Shi, Xiankun Yan, Frank Neumann |
| 2022 | PPSN | Evolutionary Time-Use Optimization for Improving Children's Health Outcomes. | Yue Xie, Aneta Neumann, Ty Stanford, Charlotte Lund Rasmussen, Dorothea Dumuid, Frank Neumann |
| 2022 | SAC | Run-of-mine stockyard recovery scheduling and optimisation for multiple reclaimers. | Hirad Assimi, Ben Koch, Chris Garcia, Markus Wagner, Frank Neumann |
| 2021 | AAAI | Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints. | Anh Viet Do, Frank Neumann |
| 2021 | CEC | Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems. | Yue Xie, Aneta Neumann, Frank Neumann |
| 2021 | FOGA | Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. | Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann |
| 2021 | GECCO | Evolutionary submodular optimisation. | Aneta Neumann, Frank Neumann, Chao Qian |
| 2021 | GECCO | Novelty particle swarm optimisation for truss optimisation problems. | Hirad Assimi, Frank Neumann, Markus Wagner, Xiaodong Li |
| 2021 | GECCO | Evolutionary diversity optimization and the minimum spanning tree problem. | Jakob Bossek, Frank Neumann |
| 2021 | GECCO | Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. | Jakob Bossek, Aneta Neumann, Frank Neumann |
| 2021 | GECCO | Analysis of evolutionary diversity optimisation for permutation problems. | Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann |
| 2021 | GECCO | Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. | Aneta Neumann, Jakob Bossek, Frank Neumann |
| 2021 | GECCO | Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. | Adel Nikfarjam, Jakob Bossek, Aneta Neumann, Frank Neumann |
| 2021 | GECCO | Advanced mine optimisation under uncertainty using evolution. | William Reid, Aneta Neumann, Simon Ratcliffe, Frank Neumann |
| 2021 | GECCO | Heuristic strategies for solving complex interacting stockpile blending problem with chance constraints. | Yue Xie, Aneta Neumann, Frank Neumann |
| 2021 | GECCO | 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, Andrew M. Sutton |
| 2021 | IJCAI | Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints. | Chao Bian, Chao Qian, Frank Neumann, Yang Yu |
| 2021 | SAC | Modelling and optimization of run-of-mine stockpile recovery. | Hirad Assimi, Ben Koch, Chris Garcia, Markus Wagner, Frank Neumann |
| 2021 | SAT | Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. | Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton |
| 2020 | AAAI | Optimization of Chance-Constrained Submodular Functions. | Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton |
| 2020 | ECAI | 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 |
| 2020 | ECAI | Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. | Vanja Doskoc, Tobias Friedrich, Andreas Gbel, Aneta Neumann, Frank Neumann, Francesco Quinzan |
| 2020 | ECAI | Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits. | Maryam Hasani-Shoreh, Renato Hermoza Aragons, Frank Neumann |
| 2020 | GECCO | Evolutionary computation for digital art. | Aneta Neumann, Frank Neumann |
| 2020 | GECCO | More effective randomized search heuristics for graph coloring through dynamic optimization. | Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt |
| 2020 | GECCO | The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics. | Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann |
| 2020 | GECCO | Evolving diverse sets of tours for the travelling salesperson problem. | Anh Viet Do, Jakob Bossek, Aneta Neumann, Frank Neumann |
| 2020 | GECCO | Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem. | Vahid Roostapour, Jakob Bossek, Frank Neumann |
| 2020 | GECCO | Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. | Yue Xie, Aneta Neumann, Frank Neumann |
| 2020 | ICONIP | The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms. | Ragav Sachdeva, Frank Neumann, Markus Wagner |
| 2020 | PPSN | Evolving Sampling Strategies for One-Shot Optimization Tasks. | Jakob Bossek, Carola Doerr, Pascal Kerschke, Aneta Neumann, Frank Neumann |
| 2020 | PPSN | Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. | Jakob Bossek, Aneta Neumann, Frank Neumann |
| 2020 | PPSN | Maximizing Submodular or Monotone Functions Under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms. | Anh Viet Do, Frank Neumann |
| 2020 | PPSN | Optimising Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-objective Algorithms. | Aneta Neumann, Frank Neumann |
| 2019 | AAAI | Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. | Tobias Friedrich, Andreas Gbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger |
| 2019 | AAAI | Evolving Solutions to Community-Structured Satisfiability Formulas. | Frank Neumann, Andrew M. Sutton |
| 2019 | AAAI | Pareto Optimization for Subset Selection with Dynamic Cost Constraints. | Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich |
| 2019 | EMO | Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees. | Wanru Gao, Mojgan Pourhassan, Vahid Roostapour, Frank Neumann |
| 2019 | FOGA | Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. | Frank Neumann, Andrew M. Sutton |
| 2019 | FOGA | Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem. | Feng Shi, Frank Neumann, Jianxin Wang |
| 2019 | FOGA | Evolving diverse TSP instances by means of novel and creative mutation operators. | Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, Heike Trautmann |
| 2019 | FOGA | Analysis of baseline evolutionary algorithms for the packing while travelling problem. | Vahid Roostapour, Mojgan Pourhassan, Frank Neumann |
| 2019 | GECCO | Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint. | Frank Neumann, Mojgan Pourhassan, Carsten Witt |
| 2019 | GECCO | Runtime analysis of randomized search heuristics for dynamic graph coloring. | Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt |
| 2019 | GECCO | On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problem. | Jakob Bossek, Christian Grimme, Frank Neumann |
| 2019 | GECCO | Fast re-optimization via structural diversity. | Benjamin Doerr, Carola Doerr, Frank Neumann |
| 2019 | GECCO | Evolutionary computation for digital art. | Aneta Neumann, Frank Neumann |
| 2019 | GECCO | Evolutionary diversity optimization using multi-objective indicators. | Aneta Neumann, Wanru Gao, Markus Wagner, Frank Neumann |
| 2019 | GECCO | Evolutionary algorithms for the chance-constrained knapsack problem. | Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann |
| 2019 | ICONIP | On the Use of Diversity Mechanisms in Dynamic Constrained Continuous Optimization. | Maryam Hasani-Shoreh, Frank Neumann |
| 2018 | CEC | On the Use of Colour-Based Segmentation in Evolutionary Image Composition. | Aneta Neumann, Frank Neumann |
| 2018 | CEC | A Comparison of Constraint Handling Techniques for Dynamic Constrained Optimization Problems. | Maria Yaneli Ameca-Alducin, Maryam Hasani-Shoreh, Wilson Blaikie, Frank Neumann, Efrn Mezura-Montes |
| 2018 | ECCV | Robust Fitting in Computer Vision: Easy or Hard? | Tat-Jun Chin, Zhipeng Cai, Frank Neumann |
| 2018 | GECCO | Randomized greedy algorithms for covering problems. | Wanru Gao, Tobias Friedrich, Frank Neumann, Christian Hercher |
| 2018 | GECCO | Discrepancy-based evolutionary diversity optimization. | Aneta Neumann, Wanru Gao, Carola Doerr, Frank Neumann, Markus Wagner |
| 2018 | GECCO | Evolutionary computation for digital art. | Aneta Neumann, Frank Neumann |
| 2018 | GECCO | Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem. | Feng Shi, Frank Neumann, Jianxin Wang |
| 2018 | GECCO | Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. | Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann |
| 2018 | PPSN | Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. | Frank Neumann, Andrew M. Sutton |
| 2018 | PPSN | A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems. | Behrooz Ghasemishabankareh, Melih Ozlen, Frank Neumann, Xiaodong Li |
| 2018 | PPSN | On the Performance of Baseline Evolutionary Algorithms on the Dynamic Knapsack Problem. | Vahid Roostapour, Aneta Neumann, Frank Neumann |
| 2017 | AAAI | What's Hot in Evolutionary Computation. | Tobias Friedrich, Frank Neumann |
| 2017 | FOGA | Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. | Tobias Friedrich, Timo Ktzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck |
| 2017 | FOGA | On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. | Mojgan Pourhassan, Tobias Friedrich, Frank Neumann |
| 2017 | GECCO | Evolutionary image composition using feature covariance matrices. | Aneta Neumann, Zygmunt L. Szpak, Wojciech Chojnacki, Frank Neumann |
| 2017 | GECCO | Speeding up evolutionary multi-objective optimisation through diversity-based parent selection. | Edgar Covantes Osuna, Wanru Gao, Frank Neumann, Dirk Sudholt |
| 2017 | GECCO | Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. | Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Ktzing, Frank Neumann |
| 2016 | CEC | Feature-based algorithm selection for constrained continuous optimisation. | Frank Neumann, Shayan Poursoltan |
| 2016 | CVPR | Guaranteed Outlier Removal with Mixed Integer Linear Programs. | Tat-Jun Chin, Yang Heng Kee, Anders P. Eriksson, Frank Neumann |
| 2016 | GECCO | Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax. | Benjamin Doerr, Wanru Gao, Frank Neumann |
| 2016 | GECCO | Fast Building Block Assembly by Majority Vote Crossover. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann, Martin Schirneck |
| 2016 | GECCO | On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem. | Junhua Wu, Sergey Polyakovskiy, Frank Neumann |
| 2016 | GECCO | Fast and Effective Optimisation of Arrays of Submerged Wave Energy Converters. | Junhua Wu, Slava Shekh, Nataliia Y. Sergiienko, Benjamin S. Cazzolato, Boyin Ding, Frank Neumann, Markus Wagner |
| 2016 | ICONIP | The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation. | Aneta Neumann, Bradley Alexander, Frank Neumann |
| 2016 | PPSN | Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. | Wanru Gao, Tobias Friedrich, Frank Neumann |
| 2016 | PPSN | Feature-Based Diversity Optimization for Problem Instance Classification. | Wanru Gao, Samadhi Nallaperuma, Frank Neumann |
| 2016 | PPSN | Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. | Mojgan Pourhassan, Feng Shi, Frank Neumann |
| 2015 | CPAIOR | Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. | Sergey Polyakovskiy, Frank Neumann |
| 2015 | GECCO | Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. | Benjamin Doerr, Frank Neumann, Andrew M. Sutton |
| 2015 | GECCO | Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem. | Wanru Gao, Mojgan Pourhassan, Frank Neumann |
| 2015 | GECCO | Parameterized Complexity Analysis of Evolutionary Algorithms. | Frank Neumann, Andrew M. Sutton |
| 2015 | GECCO | Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms. | Mojgan Pourhassan, Wanru Gao, Frank Neumann |
| 2015 | GECCO | On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem. | Mojgan Pourhassan, Frank Neumann |
| 2015 | ICONIP | A Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation. | Shayan Poursoltan, Frank Neumann |
| 2015 | ICONIP | A Feature-Based Analysis on the Impact of Set of Constraints for \varepsilon -Constrained Differential Evolution. | Shayan Poursoltan, Frank Neumann |
| 2015 | IJCAI | On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling. | Frank Neumann, Carsten Witt |
| 2014 | CEC | Single- and multi-objective genetic programming: New runtime results for sorting. | Markus Wagner, Frank Neumann |
| 2014 | CEC | A Feature-based analysis on the impact of linear constraints for ε-constrained differential evolution. | Shayan Poursoltan, Frank Neumann |
| 2014 | GECCO | Runtime analysis for maximizing population diversity in single-objective optimization. | Wanru Gao, Frank Neumann |
| 2014 | GECCO | EVOR: an online evolutionary algorithm for car racing games. | Samadhi Nallaperuma, Frank Neumann, Mohammad Reza Bonyadi, Zbigniew Michalewicz |
| 2014 | GECCO | A fixed budget analysis of randomized search heuristics for the traveling salesperson problem. | Samadhi Nallaperuma, Frank Neumann, Dirk Sudholt |
| 2014 | GECCO | Parameterized complexity analysis of evolutionary algorithms. | Frank Neumann, Andrew M. Sutton |
| 2014 | GECCO | A comprehensive benchmark set and heuristics for the traveling thief problem. | Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, Frank Neumann |
| 2014 | PPSN | Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. | Tobias Friedrich, Frank Neumann |
| 2014 | PPSN | Parameter Prediction Based on Features of Evolved Instances for Ant Colony Optimization and the Traveling Salesperson Problem. | Samadhi Nallaperuma, Markus Wagner, Frank Neumann |
| 2014 | PPSN | Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. | Andrew M. Sutton, Frank Neumann |
| 2013 | CEC | Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. | Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann |
| 2013 | CEC | Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. | Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann |
| 2013 | FOGA | A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem. | Samadhi Nallaperuma, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf Mersmann, Heike Trautmann |
| 2013 | GECCO | A fast approximation-guided evolutionary multi-objective algorithm. | Markus Wagner, Frank Neumann |
| 2013 | GECCO | The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation. | Dogan Corus, Per Kristian Lehre, Frank Neumann |
| 2013 | GECCO | Ant colony optimisation and the traveling salesperson problem: hardness, features and parameter settings. | Samadhi Nallaperuma, Markus Wagner, Frank Neumann |
| 2013 | GECCO | Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. | Frank Neumann, Carsten Witt |
| 2013 | GECCO | Population size matters: rigorous runtime results for maximizing the hypervolume indicator. | Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann |
| 2013 | GECCO | Fast and effective multi-objective optimisation of wind turbine placement. | Raymond Tran, Junhua Wu, Christopher Denison, Thomas Ackling, Markus Wagner, Frank Neumann |
| 2012 | AAAI | A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. | Andrew M. Sutton, Frank Neumann |
| 2012 | CEC | Optimizing energy output and layout costs for large wind farms using particle swarm optimization. | Kalyan Veeramachaneni, Markus Wagner, Una-May O'Reilly, Frank Neumann |
| 2012 | CEC | An adaptive data structure for evolutionary multi-objective algorithms with unbounded archives. | Joseph Yuen, Sophia Gao, Markus Wagner, Frank Neumann |
| 2012 | GECCO | The max problem revisited: the importance of mutation in genetic programming. | Timo Ktzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly |
| 2012 | GECCO | Computational complexity analysis of multi-objective genetic programming. | Frank Neumann |
| 2012 | GECCO | Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. | Frank Neumann, Carsten Witt |
| 2012 | GECCO | A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. | Andrew M. Sutton, Jareth Day, Frank Neumann |
| 2012 | PPSN | A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. | Andrew M. Sutton, Frank Neumann |
| 2012 | PPSN | Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics. | Tommaso Urli, Markus Wagner, Frank Neumann |
| 2012 | PPSN | Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations. | Markus Wagner, Frank Neumann |
| 2011 | FOGA | Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. | Greg Durrett, Frank Neumann, Una-May O'Reilly |
| 2011 | FOGA | Simple max-min ant systems and the optimization of linear pseudo-boolean functions. | Timo Ktzing, Frank Neumann, Dirk Sudholt, Markus Wagner |
| 2011 | GECCO | Foundations of evolutionary multi-objective optimization. | Tobias Friedrich, Frank Neumann |
| 2011 | GECCO | Computational complexity and evolutionary computation. | Thomas Jansen, Frank Neumann |
| 2011 | GECCO | PAC learning and genetic programming. | Timo Ktzing, Frank Neumann, Reto Sphel |
| 2011 | GECCO | On the effectiveness of crossover for migration in parallel evolutionary algorithms. | Frank Neumann, Pietro S. Oliveto, Gnter Rudolph, Dirk Sudholt |
| 2011 | IJCAI | Approximation-Guided Evolutionary Multi-Objective Optimization. | Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner |
| 2010 | GECCO | Set-based multi-objective optimization, indicators, and deteriorative cycles. | Rudolf Berghammer, Tobias Friedrich, Frank Neumann |
| 2010 | GECCO | Foundations of evolutionary multi-objective optimization. | Tobias Friedrich, Frank Neumann |
| 2010 | GECCO | Computational complexity and evolutionary computation. | Thomas Jansen, Frank Neumann |
| 2010 | GECCO | Ant colony optimization and the minimum cut problem. | Timo Ktzing, Per Kristian Lehre, Frank Neumann, Pietro S. Oliveto |
| 2010 | GECCO | A few ants are enough: ACO with iteration-best update. | Frank Neumann, Dirk Sudholt, Carsten Witt |
| 2010 | PPSN | Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. | Sntje Bttcher, Benjamin Doerr, Frank Neumann |
| 2010 | PPSN | More Effective Crossover Operators for the All-Pairs Shortest Path Problem. | Benjamin Doerr, Daniel Johannsen, Timo Ktzing, Frank Neumann, Madeleine Theile |
| 2010 | PPSN | Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. | Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto |
| 2010 | PPSN | How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem. | Frank Neumann, Madeleine Theile |
| 2009 | CEC | Theoretical analysis of rank-based mutation - combining exploration and exploitation. | Pietro S. Oliveto, Per Kristian Lehre, Frank Neumann |
| 2009 | FOGA | Computing single source shortest paths using single-objective fitness. | Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann |
| 2009 | FOGA | Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. | Christian Horoba, Frank Neumann |
| 2009 | GECCO | Evolutionary algorithms and dynamic programming. | Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile |
| 2009 | GECCO | Multiplicative approximations and the hypervolume indicator. | Tobias Friedrich, Christian Horoba, Frank Neumann |
| 2009 | GECCO | Computational complexity and evolutionary computation. | Thomas Jansen, Frank Neumann |
| 2009 | GECCO | Fixed-parameter evolutionary algorithms and the vertex cover problem. | Stefan Kratsch, Frank Neumann |
| 2009 | GECCO | Theoretical analysis of fitness-proportional selection: landscapes and efficiency. | Frank Neumann, Pietro S. Oliveto, Carsten Witt |
| 2008 | CEC | Using fast matrix multiplication in bio-inspired computation for complex optimization problems. | Florian Diedrich, Frank Neumann |
| 2008 | CEC | When to use bit-wise neutrality. | Tobias Friedrich, Frank Neumann |
| 2008 | GECCO | Rigorous analyses of fitness-proportional selection for optimizing linear functions. | Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann |
| 2008 | GECCO | Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. | Christian Horoba, Frank Neumann |
| 2008 | GECCO | Computational complexity and evolutionary computation. | Thomas Jansen, Frank Neumann |
| 2008 | GECCO | Computing minimum cuts by randomized search heuristics. | Frank Neumann, Joachim Reichel, Martin Skutella |
| 2008 | PPSN | Analyzing Hypervolume Indicator Based Algorithms. | Dimo Brockhoff, Tobias Friedrich, Frank Neumann |
| 2008 | PPSN | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. | Tobias Friedrich, Christian Horoba, Frank Neumann |
| 2008 | PPSN | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach. | Jens Kroeske, Adam Ghandar, Zbigniew Michalewicz, Frank Neumann |
| 2008 | PPSN | Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms. | Frank Neumann, Joachim Reichel |
| 2007 | CEC | A rigorous view on neutrality. | Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann |
| 2007 | CEC | On improving approximate solutions by evolutionary algorithms. | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt |
| 2007 | CEC | Plateaus can be harder in multi-objective optimization. | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann |
| 2007 | GECCO | Do additional objectives make a problem harder? | Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler |
| 2007 | GECCO | On the runtime analysis of the 1-ANT ACO algorithm. | Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt |
| 2007 | GECCO | Rigorous analyses of simple diversity mechanisms. | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann |
| 2007 | GECCO | Approximating covering problems by randomized search heuristics using multi-objective models. | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt |
| 2007 | GECCO | Computational complexity and evolutionary computation. | Thomas Jansen, Frank Neumann |
| 2006 | ISAAC | Runtime Analysis of a Simple Ant Colony Optimization Algorithm. | Frank Neumann, Carsten Witt |
| 2006 | LATIN | Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. | Frank Neumann, Marco Laumanns |
| 2006 | PPSN | Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. | Benjamin Doerr, Nils Hebbinghaus, Frank Neumann |
| 2005 | CASC | RelView - An OBDD-Based Computer Algebra System for Relations. | Rudolf Berghammer, Frank Neumann |
| 2005 | GECCO | Minimum spanning trees made easier via multi-objective optimization. | Frank Neumann, Ingo Wegener |
| 2004 | CEC | Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. | Frank Neumann |
| 2004 | GECCO | Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. | Frank Neumann, Ingo Wegener |
| 2004 | PPSN | Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem. | Frank Neumann |