| Publication | Date of Publication | Type |
|---|
| On connectivity in random graph models with limited dependencies | 2025-01-14 | Paper |
Polynomial growth in degree-dependent first passage percolation on spatial random graphs
Electronic Journal of Probability | 2024-12-20 | Paper |
| Hardest monotone functions for evolutionary algorithms | 2024-11-12 | Paper |
Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions
Algorithmica | 2024-10-24 | Paper |
On connectivity in random graph models with limited dependencies
Random Structures & Algorithms | 2024-09-02 | Paper |
Analysing equilibrium states for population diversity
Algorithmica | 2024-08-02 | Paper |
OneMax is not the easiest function for fitness improvements
Evolutionary Computation in Combinatorial Optimization | 2024-01-12 | Paper |
| Hardest Monotone Functions for Evolutionary Algorithms | 2023-11-13 | Paper |
Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions
Theoretical Computer Science | 2023-10-26 | Paper |
| Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II | 2023-09-21 | Paper |
Two-dimensional drift analysis: optimizing two functions simultaneously can be hard
Theoretical Computer Science | 2023-08-18 | Paper |
| On Connectivity in Random Graph Models with Limited Dependencies | 2023-05-04 | Paper |
| The Maximum Label Propagation Algorithm on Sparse Random Graphs | 2023-02-03 | Paper |
Penalising transmission to hubs in scale-free spatial random graphs
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2022-02-25 | Paper |
Greedy routing and the algorithmic small-world phenomenon
Journal of Computer and System Sciences | 2022-01-31 | Paper |
Self-adjusting mutation rates with provably optimal success rules
Algorithmica | 2021-11-05 | Paper |
Self-adjusting mutation rates with provably optimal success rules
Algorithmica | 2021-11-05 | Paper |
Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function
(available as arXiv preprint) | 2021-10-18 | Paper |
Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions
Theoretical Computer Science | 2021-06-23 | Paper |
The complex parameter landscape of the compact genetic algorithm
Algorithmica | 2021-04-08 | Paper |
Random sampling with removal
Discrete & Computational Geometry | 2020-10-23 | Paper |
| Sampling geometric inhomogeneous random graphs in linear time | 2020-05-27 | Paper |
Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
Theoretical Computer Science | 2020-03-20 | Paper |
The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
Theoretical Computer Science | 2020-03-20 | Paper |
Bootstrap percolation with inhibition
Random Structures & Algorithms | 2020-02-14 | Paper |
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm
(available as arXiv preprint) | 2020-02-12 | Paper |
Exponential slowdown for larger populations. The \((\mu+1)\)-EA on monotone functions
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
Nearly-tight analysis for 2-choice and 3-majority consensus dynamics
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
When does hillclimbing fail on monotone functions: an entropy compression argument
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-18 | Paper |
The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates
Theoretical Computer Science | 2019-07-31 | Paper |
Sorting by swaps with noisy comparisons
Algorithmica | 2019-02-14 | Paper |
Geometric inhomogeneous random graphs
Theoretical Computer Science | 2019-01-25 | Paper |
Geometric inhomogeneous random graphs
Theoretical Computer Science | 2019-01-25 | Paper |
Asymptotically optimal amplifiers for the Moran process
Theoretical Computer Science | 2019-01-10 | Paper |
Asymptotically optimal amplifiers for the Moran process
Theoretical Computer Science | 2019-01-10 | Paper |
Drift analysis and evolutionary algorithms revisited
Combinatorics, Probability and Computing | 2018-07-24 | Paper |
The \((1+1)\) elitist black-box complexity of LeadingOnes
Algorithmica | 2018-05-18 | Paper |
| Random sampling with removal | 2018-01-30 | Paper |
Bootstrap percolation on geometric inhomogeneous random graphs
(available as arXiv preprint) | 2017-12-19 | Paper |
| Drift Analysis | 2017-12-04 | Paper |
| Existence of Small Separators Depends on Geometry for Geometric Inhomogeneous Random Graphs | 2017-11-10 | Paper |
Greedy routing and the algorithmic small-world phenomenon
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Note on the coefficient of variations of neuronal spike trains
Biological Cybernetics | 2017-09-12 | Paper |
\textsc{OneMax} in black-box models with several restrictions
Algorithmica | 2017-07-07 | Paper |
Fixed Budget Performance of the (1+1) EA on Linear Functions
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII | 2017-05-10 | Paper |
Connectivity thresholds for bounded size rules
The Annals of Applied Probability | 2016-12-09 | Paper |
Normalization phenomena in asynchronous networks
Automata, Languages, and Programming | 2015-11-04 | Paper |
Evolutionary algorithms for quantum computers
Algorithmica | 2014-03-25 | Paper |
Black-box complexities of combinatorial problems
Theoretical Computer Science | 2013-02-19 | Paper |
The global Cohen-Lenstra heuristic
Journal of Algebra | 2012-11-09 | Paper |
The Cohen-Lenstra heuristic: methodology and results
Journal of Algebra | 2010-06-08 | Paper |
A combinatorial interpretation of the probabilities of \(p\)-groups in the Cohen-Lenstra measure
Journal of Number Theory | 2008-12-08 | Paper |
The Interval Liar Game
Algorithms and Computation | 2008-04-24 | Paper |
The Interval Liar Game
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I
(available as arXiv preprint) | N/A | Paper |
Plus Strategies are Exponentially Slower for Planted Optima of Random Height
(available as arXiv preprint) | N/A | Paper |
Faster Optimization Through Genetic Drift
(available as arXiv preprint) | N/A | Paper |
