Frank Neumann

Orcid: 0000-0002-2721-3618

Affiliations:
  • University of Adelaide, Australia
  • Max Planck Institute for Informatics, Saarbrücken, Germany


According to our database1, Frank Neumann authored at least 326 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Use of Quality Diversity Algorithms for the Travelling Thief Problem.
ACM Trans. Evol. Learn. Optim., June, 2024

Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization.
CoRR, 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

Sliding Window 3-Objective Pareto Optimization for Problems with Chance Constraints.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Archive-Based Single-Objective Evolutionary Algorithms for Submodular Optimization.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

Evolutionary Multi-objective Diversity Optimization.
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

Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions.
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

Runtime Analyses of NSGA-III on Many-Objective Problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Evolutionary Diversity Optimisation for Sparse Directed Communication Networks.
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

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis.
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

Evolutionary computation for stochastic problems.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2024

Enhanced Genetic Programming Models with Multiple Equations for Accurate Semi-Autogenous Grinding Mill Throughput Prediction.
Proceedings of the IEEE Congress on Evolutionary Computation, 2024

Limited Query Graph Connectivity Test.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
A Hybrid Intelligent Framework for Maximising SAG Mill Throughput: An Integration of Expert Knowledge, Machine Learning and Evolutionary Algorithms for Parameter Optimisation.
CoRR, 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

Evolutionary Diversity Optimisation in Constructing Satisfying Assignments.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Diversity Optimization for the Detection and Concealment of Spatially Defined Communication Networks.
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

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

3-Objective Pareto Optimization for Problems with Chance Constraints.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Analysis of (1+1) EA on LeadingOnes with Constraints.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers.
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax.
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2023

Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Fast Pareto Optimization Using Sliding Window Selection.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Improving Confidence in Evolutionary Mine Scheduling via Uncertainty Discounting.
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler.
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

A Study of Fitness Gains in Evolving Finite State Machines.
Proceedings of the AI 2023: Advances in Artificial Intelligence, 2023

Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Analysis of Evolutionary Diversity Optimization for Permutation Problems.
ACM Trans. Evol. Learn. Optim., 2022

Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints.
Theor. Comput. Sci., 2022

Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem.
CoRR, 2022

Editorial.
Algorithmica, 2022

Pareto optimization for subset selection with dynamic cost constraints.
Artif. Intell., 2022

Run-of-mine stockyard recovery scheduling and optimisation for multiple reclaimers.
Proceedings of the SAC '22: The 37th ACM/SIGAPP Symposium on Applied Computing, Virtual Event, April 25, 2022

Evolutionary Time-Use Optimization for Improving Children's Health Outcomes.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Runtime Analysis of Simple Evolutionary Algorithms for the Chance-Constrained Makespan Scheduling Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Co-evolutionary Diversity Optimisation for the Traveling Thief Problem.
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

Analysis of Quality Diversity Algorithms for the Knapsack Problem.
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

Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Theoretical Study of Optimizing Rugged Landscapes with the cGA.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

An optimization strategy for the complex large-scale stockpile blending problem.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Evolutionary diversity optimisation for the traveling thief problem.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

On the use of quality diversity algorithms for the traveling thief problem.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Coevolutionary Pareto diversity optimization.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Evolutionary submodular optimisation: tutorial.
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

Exploring the feature space of TSP instances using quality diversity.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

The compact genetic algorithm struggles on Cliff functions.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2022

Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization.
ACM Trans. Evol. Learn. Optim., 2021

Time complexity analysis of evolutionary algorithms for 2-hop (1, 2)-minimum spanning tree problem.
Theor. Comput. Sci., 2021

Amplifying influence through coordinated behaviour in social networks.
Soc. Netw. Anal. Min., 2021

Feature-Based Diversity Optimization for Problem Instance Classification.
Evol. Comput., 2021

A General Method to Find Highly Coordinating Communities in Social Media through Inferred Interaction Links.
CoRR, 2021

Advanced Ore Mine Optimisation under Uncertainty Using Evolution.
CoRR, 2021

Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem.
Algorithmica, 2021

Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint.
Algorithmica, 2021

Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.
Algorithmica, 2021

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Modelling and optimization of run-of-mine stockpile recovery.
Proceedings of the SAC '21: The 36th ACM/SIGAPP Symposium on Applied Computing, 2021

Exact Counting and Sampling of Optima for the Knapsack Problem.
Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 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

Advanced mine optimisation under uncertainty using evolution.
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

Analysis of evolutionary diversity optimisation for permutation problems.
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

Evolutionary diversity optimization and the minimum spanning tree problem.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Novelty particle swarm optimisation for truss optimisation problems.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Evolutionary submodular optimisation.
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

Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Parameterized Complexity Analysis of Randomized Search Heuristics.
Proceedings of the Theory of Evolutionary Computation, 2020

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.
Proceedings of the Theory of Evolutionary Computation, 2020

Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem.
Theor. Comput. Sci., 2020

Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation.
Theor. Comput. Sci., 2020

Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints.
Theor. Comput. Sci., 2020

Robust Fitting in Computer Vision: Easy or Hard?
Int. J. Comput. Vis., 2020

Evolutionary Image Transition and Painting Using Random Walks.
Evol. Comput., 2020

Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems.
CoRR, 2020

Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem.
CoRR, 2020

Parameterized Complexity Analysis of Randomized Search Heuristics.
CoRR, 2020

Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions.
Appl. Soft Comput., 2020

Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
Algorithmica, 2020

Human Interactive EEG-Based Evolutionary Image Animation.
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020

Using Neural Networks and Diversifying Differential Evolution for Dynamic Optimisation.
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

Maximizing Submodular or Monotone Functions Under Partition Matroid Constraints by Multi-objective Evolutionary 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

Evolving Sampling Strategies for One-Shot Optimization Tasks.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms.
Proceedings of the Neural Information Processing - 27th International Conference, 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

Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Evolving diverse sets of tours for the travelling salesperson problem.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

More effective randomized search heuristics for graph coloring through dynamic optimization.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits.
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

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

Who's in the Gang? Revealing Coordinating Communities in Social Media.
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2020

Optimization of Chance-Constrained Submodular Functions.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
Evol. Comput., 2019

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem.
Evol. Comput., 2019

Automated Algorithm Selection: Survey and Perspectives.
Evol. Comput., 2019

Foreword.
Evol. Comput., 2019

One-Shot Decision-Making with and without Surrogates.
CoRR, 2019

On the Behaviour of Differential Evolution for Problems with Dynamic Linear Constraints.
CoRR, 2019

Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem.
CoRR, 2019

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints.
CoRR, 2019

Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
Algorithmica, 2019

Quasi-random Image Transition and Animation.
Aust. J. Intell. Inf. Process. Syst., 2019

On the Use of Diversity Mechanisms in Dynamic Constrained Continuous Optimization.
Proceedings of the Neural Information Processing - 26th International Conference, 2019

Evolutionary algorithms for the chance-constrained knapsack problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Evolutionary diversity optimization using multi-objective indicators.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Fast re-optimization via structural diversity.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Runtime analysis of randomized search heuristics for dynamic graph coloring.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Analysis of baseline evolutionary algorithms for the packing while travelling problem.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

Evolving diverse TSP instances by means of novel and creative mutation operators.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem.
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2019

Evolving Solutions to Community-Structured Satisfiability Formulas.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Evolutionary Computation for Multicomponent Problems: Opportunities and Future Directions.
Proceedings of the Optimization in Industry, Present Practices and Future Scopes., 2019

2018
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments.
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

A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Evolutionary computation for digital art.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Discrepancy-based evolutionary diversity optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Randomized greedy algorithms for covering problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

On the Use of Repair Methods in Differential Evolution for Dynamic Constrained Optimization.
Proceedings of the Applications of Evolutionary Computation, 2018

A Comparison of Constraint Handling Techniques for Dynamic Constrained Optimization Problems.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

On the Use of Colour-Based Segmentation in Evolutionary Image Composition.
Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

A Fully Polynomial Time Approximation Scheme for Packing While Traveling.
Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

2017
Ahura: A Heuristic-Based Racer for the Open Racing Car Simulator.
IEEE Trans. Comput. Intell. AI Games, 2017

The Packing While Traveling Problem.
Eur. J. Oper. Res., 2017

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
Evol. Comput., 2017

Quasi-random Agents for Image Transition and Animation.
CoRR, 2017

Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas.
Algorithmica, 2017

Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem.
Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

Parameterized analysis of bio-inspired computing.
Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

Exact Approaches for the Travelling Thief Problem.
Proceedings of the Simulated Evolution and Learning - 11th International Conference, 2017

Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Speeding up evolutionary multi-objective optimisation through diversity-based parent selection.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Evolutionary image composition using feature covariance matrices.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Evolutionary Image Transition Using Random Walks.
Proceedings of the Computational Intelligence in Music, Sound, Art and Design, 2017

Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization.
Proceedings of the AI 2017: Advances in Artificial Intelligence, 2017

What's Hot in Evolutionary Computation.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Solving hard control problems in voting systems via integer programming.
Eur. J. Oper. Res., 2016

A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
Evol. Comput., 2016

Automated Algorithm Selection and Configuration (Dagstuhl Seminar 16412).
Dagstuhl Reports, 2016

A Feature-Based Prediction Model of Algorithm Selection for Constrained Continuous Optimisation.
CoRR, 2016

Evolutionary Image Transition Based on Theoretical Insights of Random Processes.
CoRR, 2016

Evolutionary computation for multicomponent problems: opportunities and future directions.
CoRR, 2016

Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

The Evolutionary Process of Image Transition in Conjunction with Box and Strip Mutation.
Proceedings of the Neural Information Processing - 23rd International Conference, 2016

Fast and Effective Optimisation of Arrays of Submerged Wave Energy Converters.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Fast Building Block Assembly by Majority Vote Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Guaranteed Outlier Removal with Mixed Integer Linear Programs.
Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition, 2016

Feature-based algorithm selection for constrained continuous optimisation.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2015
Population size matters: Rigorous runtime results for maximizing the hypervolume indicator.
Theor. Comput. Sci., 2015

Analyzing the Effects of Instance Features and Algorithm Parameters for Max-Min Ant System and the Traveling Salesperson Problem.
Frontiers Robotics AI, 2015

Efficient optimization of many objectives by approximation-guided evolution.
Eur. J. Oper. Res., 2015

Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point.
Evol. Comput., 2015

Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
Evol. Comput., 2015

On the Performance of Different Genetic Programming Approaches for the SORTING Problem.
Evol. Comput., 2015

A Feature-Based Analysis on the Impact of Set of Constraints for e-Constrained Differential Evolution.
CoRR, 2015

Optimising Spatial and Tonal Data for PDE-based Inpainting.
CoRR, 2015

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

A Feature-Based Analysis on the Impact of Set of Constraints for \varepsilon -Constrained Differential Evolution.
Proceedings of the Neural Information Processing - 22nd International Conference, 2015

A Feature-Based Comparison of Evolutionary Computing Techniques for Constrained Continuous Optimisation.
Proceedings of the Neural Information Processing - 22nd International Conference, 2015

On the Impact of Local Search Operators and Variable Neighbourhood Search for the Generalized Travelling Salesperson Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Parameterized Complexity Analysis of Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Runtime Analysis of Evolutionary Diversity Optimization and the Vertex Cover Problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014
Editorial for the Special Issue on Theoretical Foundations of Evolutionary Computation.
IEEE Trans. Evol. Comput., 2014

The Max problem revisited: The importance of mutation in genetic programming.
Theor. Comput. Sci., 2014

Computational Intelligence for Software Engineering (NII Shonan Meeting 2014-13).
NII Shonan Meet. Rep., 2014

Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem.
Evol. Comput., 2014

A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
CoRR, 2014

User Preferences for Approximation-Guided Multi-objective Evolution.
Proceedings of the Simulated Evolution and Learning - 10th International Conference, 2014

On the Impact of Utility Functions in Interactive Evolutionary Multi-objective Optimization.
Proceedings of the Simulated Evolution and Learning - 10th International Conference, 2014

Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Parameter Prediction Based on Features of Evolved Instances for Ant Colony Optimization and the Traveling Salesperson Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

A comprehensive benchmark set and heuristics for the traveling thief problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

A fixed budget analysis of randomized search heuristics for the traveling salesperson problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

EVOR: an online evolutionary algorithm for car racing games.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Runtime analysis for maximizing population diversity in single-objective optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

A Feature-based analysis on the impact of linear constraints for ε-constrained differential evolution.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

Single- and multi-objective genetic programming: New runtime results for sorting.
Proceedings of the IEEE Congress on Evolutionary Computation, 2014

2013
More effective crossover operators for the all-pairs shortest path problem.
Theor. Comput. Sci., 2013

Weighted preferences in evolutionary multi-objective optimization.
Int. J. Mach. Learn. Cybern., 2013

A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem.
Ann. Math. Artif. Intell., 2013

Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem.
Algorithmica, 2013

Fast and effective multi-objective optimisation of wind turbine placement.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Ant colony optimisation and the traveling salesperson problem: hardness, features and parameter settings.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

A fast approximation-guided evolutionary multi-objective algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem.
Proceedings of the Foundations of Genetic Algorithms XII, 2013

Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation".
Theor. Comput. Sci., 2012

Convergence of set-based multi-objective optimization, indicators and deteriorative cycles.
Theor. Comput. Sci., 2012

Theoretical analysis of two ACO approaches for the traveling salesman problem.
Swarm Intell., 2012

A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem
CoRR, 2012

A Fast and Effective Local Search Algorithm for Optimizing the Placement of Wind Turbines
CoRR, 2012

Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012

Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Computational complexity analysis of multi-objective genetic programming.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

An adaptive data structure for evolutionary multi-objective algorithms with unbounded archives.
Proceedings of the IEEE Congress on Evolutionary Computation, 2012

Optimizing energy output and layout costs for large wind farms using particle swarm optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2012

A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Illustration of fairness in evolutionary multi-objective optimization.
Theor. Comput. Sci., 2011

Runtime analysis of the 1-ANT ant colony optimizer.
Theor. Comput. Sci., 2011

Evolutionary algorithms and dynamic programming.
Theor. Comput. Sci., 2011

Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation
CoRR, 2011

Evolving Pacing Strategies for Team Pursuit Track Cycling
CoRR, 2011

Computational Complexity Results for Genetic Programming and the Sorting Problem
CoRR, 2011

Computing Minimum Cuts by Randomized Search Heuristics.
Algorithmica, 2011

Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2011

Approximation-Guided Evolutionary Multi-Objective Optimization.
Proceedings of the IJCAI 2011, 2011

On the effectiveness of crossover for migration in parallel evolutionary algorithms.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

PAC learning and genetic programming.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Computational complexity and evolutionary computation.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Foundations of evolutionary multi-objective optimization.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Simple max-min ant systems and the optimization of linear pseudo-boolean functions.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

2010
Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization.
Proceedings of the Advances in Multi-Objective Nature Inspired Computing, 2010

Ant Colony Optimization and the minimum spanning tree problem.
Theor. Comput. Sci., 2010

Plateaus can be harder in multi-objective optimization.
Theor. Comput. Sci., 2010

When to use bit-wise neutrality.
Nat. Comput., 2010

Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization.
Evol. Comput., 2010

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models.
Evol. Comput., 2010

Editorial.
Algorithmica, 2010

In Memoriam: Ingo Wegener.
Algorithmica, 2010

Evolving Fuzzy Rules: Evaluation of a New Approach.
Proceedings of the Simulated Evolution and Learning - 8th International Conference, 2010

How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem.
Proceedings of the Parallel Problem Solving from Nature, 2010

Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation.
Proceedings of the Parallel Problem Solving from Nature, 2010

Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem.
Proceedings of the Parallel Problem Solving from Nature, 2010

A few ants are enough: ACO with iteration-best update.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Ant colony optimization and the minimum cut problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Set-based multi-objective optimization, indicators, and deteriorative cycles.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem.
Proceedings of the Swarm Intelligence - 7th International Conference, 2010

Bioinspired Computation in Combinatorial Optimization
Natural Computing Series, Springer, ISBN: 978-3-642-16543-6, 2010

2009
Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search.
Proceedings of the Innovations in Swarm Intelligence, 2009

On the Effects of Adding Objectives to Plateau Functions.
IEEE Trans. Evol. Comput., 2009

Comparison of simple diversity mechanisms on plateau functions.
Theor. Comput. Sci., 2009

Analysis of different MMAS ACO algorithms on unimodal functions and plateaus.
Swarm Intell., 2009

Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem.
Evol. Comput., 2009

Theoretical analysis of fitness-proportional selection: landscapes and efficiency.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Multiplicative approximations and the hypervolume indicator.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms.
Proceedings of the Foundations of Genetic Algorithms, 2009

Computing single source shortest paths using single-objective fitness.
Proceedings of the Foundations of Genetic Algorithms, 2009

Theoretical analysis of rank-based mutation - combining exploration and exploitation.
Proceedings of the IEEE Congress on Evolutionary Computation, 2009

2008
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem.
Comput. Oper. Res., 2008

Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms.
Proceedings of the Parallel Problem Solving from Nature, 2008

Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach.
Proceedings of the Parallel Problem Solving from Nature, 2008

Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization.
Proceedings of the Parallel Problem Solving from Nature, 2008

Analyzing Hypervolume Indicator Based Algorithms.
Proceedings of the Parallel Problem Solving from Nature, 2008

Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Rigorous analyses of fitness-proportional selection for optimizing linear functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Using fast matrix multiplication in bio-inspired computation for complex optimization problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2008

Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008

Multi-objective Problems in Terms of Relational Algebra.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

Can Single-Objective Optimization Profit from Multiobjective Optimization?
Proceedings of the Multiobjective Problem Solving from Nature, 2008

2007
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem.
Theor. Comput. Sci., 2007

Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem.
Eur. J. Oper. Res., 2007

Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators.
Evol. Comput., 2007

Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

Rigorous analyses of simple diversity mechanisms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

On the runtime analysis of the 1-ANT ACO algorithm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Do additional objectives make a problem harder?
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

On improving approximate solutions by evolutionary algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

A rigorous view on neutrality.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006
Minimum spanning trees made easier via multi-objective optimization.
Nat. Comput., 2006

Runtime Analysis of a Simple Ant Colony Optimization Algorithm.
Electron. Colloquium Comput. Complex., 2006

Speeding up Evolutionary Algorithms by Restricted Mutation Operators.
Electron. Colloquium Comput. Complex., 2006

Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators.
Proceedings of the Parallel Problem Solving from Nature, 2006

A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005
Combinatorial optimization and the analysis of randomized search heuristics.
PhD thesis, 2005

Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization
Electron. Colloquium Comput. Complex., 2005

RelView - An OBDD-Based Computer Algebra System for Relations.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

Relational Implementation of Simple Parallel Evolutionary Algorithms.
Proceedings of the Relational Methods in Computer Science, 2005


  Loading...