| Publication | Date of Publication | Type |
|---|
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 | 2024-02-23 | Paper |
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax
Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2024-02-23 | Paper |
| Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem | 2023-03-20 | Paper |
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
Theoretical Computer Science | 2022-06-13 | Paper |
Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2022-05-16 | Paper |
| Solving non-uniform planted and filtered random SAT formulas greedily | 2022-03-22 | Paper |
Pareto optimization for subset selection with dynamic cost constraints
Artificial Intelligence | 2021-12-13 | Paper |
Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
Algorithmica | 2021-11-05 | Paper |
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
Algorithmica | 2021-11-05 | Paper |
Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
Algorithmica | 2021-11-05 | Paper |
Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
Theoretical Computer Science | 2021-11-01 | Paper |
Non-monotone submodular maximization with multiple knapsacks in static and dynamic settings
(available as arXiv preprint) | 2021-07-06 | Paper |
Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives
(available as arXiv preprint) | 2021-07-06 | Paper |
Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem
Algorithmica | 2021-04-08 | Paper |
Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Algorithmica | 2020-10-12 | Paper |
Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints
Theoretical Computer Science | 2020-05-26 | Paper |
Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem
Theoretical Computer Science | 2020-05-26 | Paper |
Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
Theoretical Computer Science | 2020-05-26 | Paper |
Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
Theoretical Computer Science | 2020-05-26 | Paper |
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 | 2020-02-11 | Paper |
Evolving diverse TSP instances by means of novel and creative mutation operators
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
Analysis of baseline evolutionary algorithms for the packing while travelling problem
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
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 | 2020-02-11 | Paper |
Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Algorithmica | 2019-02-14 | Paper |
Optimizing spatial and tonal data for PDE-based inpainting
(available as arXiv preprint) | 2018-11-23 | Paper |
The packing while traveling problem
European Journal of Operational Research | 2018-05-25 | Paper |
| A relation-algebraic view on evolutionary algorithms for some graph problems | 2018-04-12 | Paper |
Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms | 2017-07-14 | Paper |
Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms | 2017-07-14 | Paper |
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
A feature-based comparison of local search and the Christofides algorithm for the travelling salesperson problem
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII | 2017-07-14 | Paper |
Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas
Algorithmica | 2017-07-07 | Paper |
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-06-13 | Paper |
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-06-13 | Paper |
Solving hard control problems in voting systems via integer programming
European Journal of Operational Research | 2016-10-07 | Paper |
Efficient optimization of many objectives by approximation-guided evolution
European Journal of Operational Research | 2016-10-06 | Paper |
Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems
Integration of AI and OR Techniques in Constraint Programming | 2016-07-25 | Paper |
Population size matters: rigorous runtime results for maximizing the hypervolume indicator
Theoretical Computer Science | 2014-12-02 | Paper |
The Max problem revisited: the importance of mutation in genetic programming
Theoretical Computer Science | 2014-07-10 | Paper |
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
Annals of Mathematics and Artificial Intelligence | 2014-06-26 | Paper |
Fixed-parameter evolutionary algorithms and the vertex cover problem
Algorithmica | 2013-05-16 | Paper |
More effective crossover operators for the all-pairs shortest path problem
Theoretical Computer Science | 2013-02-19 | Paper |
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles
Theoretical Computer Science | 2012-10-11 | Paper |
Evolutionary algorithms and dynamic programming
Theoretical Computer Science | 2011-12-19 | Paper |
Computing minimum cuts by randomized search heuristics
Algorithmica | 2011-03-30 | Paper |
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science | 2011-03-29 | Paper |
Illustration of fairness in evolutionary multi-objective optimization
Theoretical Computer Science | 2011-03-29 | Paper |
Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
Natural Computing Series | 2010-11-18 | Paper |
In memoriam: Ingo Wegener
Algorithmica | 2010-09-27 | Paper |
Approximating Pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization
Advances in Multi-Objective Nature Inspired Computing | 2010-05-28 | Paper |
Ant colony optimization and the minimum spanning tree problem
Theoretical Computer Science | 2010-05-27 | Paper |
When to use bit-wise neutrality
Natural Computing | 2010-05-05 | Paper |
Plateaus can be harder in multi-objective optimization
Theoretical Computer Science | 2010-02-19 | Paper |
Comparison of simple diversity mechanisms on plateau functions
Theoretical Computer Science | 2009-07-10 | Paper |
Runtime analysis of a simple ant colony optimization algorithm
Algorithmica | 2009-06-22 | Paper |
Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Multi-objective Problems in Terms of Relational Algebra
Relations and Kleene Algebra in Computer Science | 2008-05-15 | Paper |
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Algorithms and Computation | 2008-04-24 | Paper |
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
Computers & Operations Research | 2008-03-11 | Paper |
Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Theoretical Computer Science | 2007-06-06 | Paper |
Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
European Journal of Operational Research | 2007-05-03 | Paper |
Relational Methods in Computer Science
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Minimum spanning trees made easier via multi-objective optimization
Natural Computing | 2007-01-25 | Paper |
Computer Algebra in Scientific Computing
Lecture Notes in Computer Science | 2006-07-07 | Paper |
