| Publication | Date of Publication | Type |
|---|
| Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers | 2024-02-23 | Paper |
| Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax | 2024-02-23 | Paper |
| Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints | 2022-06-13 | Paper |
| Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation | 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 | 2021-12-13 | Paper |
| Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem | 2021-11-05 | Paper |
| Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint | 2021-11-05 | Paper |
| Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem | 2021-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999246 | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999249 | 2021-07-06 | Paper |
| Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem | 2021-04-08 | Paper |
| Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints | 2020-10-12 | Paper |
| Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints | 2020-05-26 | Paper |
| Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem | 2020-05-26 | Paper |
| Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation | 2020-05-26 | Paper |
| Evolving diverse TSP instances by means of novel and creative mutation operators | 2020-02-11 | Paper |
| Analysis of baseline evolutionary algorithms for the packing while travelling problem | 2020-02-11 | Paper |
| Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem | 2020-02-11 | Paper |
| Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem | 2020-02-11 | Paper |
| Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints | 2019-02-14 | Paper |
| Optimising Spatial and Tonal Data for PDE-based Inpainting | 2018-11-23 | Paper |
| The packing while traveling problem | 2018-05-25 | Paper |
| A relation-algebraic view on evolutionary algorithms for some graph problems | 2018-04-12 | Paper |
| Computing single source shortest paths using single-objective fitness | 2017-07-14 | Paper |
| Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms | 2017-07-14 | Paper |
| Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics | 2017-07-14 | Paper |
| Simple max-min ant systems and the optimization of linear pseudo-boolean functions | 2017-07-14 | Paper |
| A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem | 2017-07-14 | Paper |
| Time complexity analysis of evolutionary algorithms on random satisfiable \(k\)-CNF formulas | 2017-07-07 | Paper |
| On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms | 2017-06-13 | Paper |
| Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints | 2017-06-13 | Paper |
| Solving hard control problems in voting systems via integer programming | 2016-10-07 | Paper |
| Efficient optimization of many objectives by approximation-guided evolution | 2016-10-06 | Paper |
| Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems | 2016-07-25 | Paper |
| Population size matters: rigorous runtime results for maximizing the hypervolume indicator | 2014-12-02 | Paper |
| The Max problem revisited: the importance of mutation in genetic programming | 2014-07-10 | Paper |
| A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem | 2014-06-26 | Paper |
| Fixed-parameter evolutionary algorithms and the vertex cover problem | 2013-05-16 | Paper |
| More effective crossover operators for the all-pairs shortest path problem | 2013-02-19 | Paper |
| Convergence of set-based multi-objective optimization, indicators and deteriorative cycles | 2012-10-11 | Paper |
| Evolutionary algorithms and dynamic programming | 2011-12-19 | Paper |
| Computing minimum cuts by randomized search heuristics | 2011-03-30 | Paper |
| Illustration of fairness in evolutionary multi-objective optimization | 2011-03-29 | Paper |
| Runtime analysis of the 1-ANT ant colony optimizer | 2011-03-29 | Paper |
| Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity | 2010-11-18 | Paper |
| In memoriam: Ingo Wegener | 2010-09-27 | Paper |
| Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization | 2010-05-28 | Paper |
| Ant colony optimization and the minimum spanning tree problem | 2010-05-27 | Paper |
| When to use bit-wise neutrality | 2010-05-05 | Paper |
| Plateaus can be harder in multi-objective optimization | 2010-02-19 | Paper |
| Comparison of simple diversity mechanisms on plateau functions | 2009-07-10 | Paper |
| Runtime analysis of a simple ant colony optimization algorithm | 2009-06-22 | Paper |
| Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization | 2008-09-18 | Paper |
| Multi-objective Problems in Terms of Relational Algebra | 2008-05-15 | Paper |
| Runtime Analysis of a Simple Ant Colony Optimization Algorithm | 2008-04-24 | Paper |
| Expected runtimes of evolutionary algorithms for the Eulerian cycle problem | 2008-03-11 | Paper |
| Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions | 2007-11-29 | Paper |
| Randomized local search, evolutionary algorithms, and the minimum spanning tree problem | 2007-06-06 | Paper |
| Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem | 2007-05-03 | Paper |
| Relational Methods in Computer Science | 2007-05-02 | Paper |
| Minimum spanning trees made easier via multi-objective optimization | 2007-01-25 | Paper |
| Computer Algebra in Scientific Computing | 2006-07-07 | Paper |
