| Publication | Date of Publication | Type |
|---|
| OneMax is not the easiest function for fitness improvements | 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 | 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 | 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 | 2022-02-25 | Paper |
| Greedy routing and the algorithmic small-world phenomenon | 2022-01-31 | Paper |
| Self-adjusting mutation rates with provably optimal success rules | 2021-11-05 | Paper |
| Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function | 2021-10-18 | Paper |
| Exponential slowdown for larger populations: the \(( \mu + 1)\)-EA on monotone functions | 2021-06-23 | Paper |
| The complex parameter landscape of the compact genetic algorithm | 2021-04-08 | Paper |
| Random sampling with removal | 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 | 2020-03-20 | Paper |
| The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time | 2020-03-20 | Paper |
| Bootstrap percolation with inhibition | 2020-02-14 | Paper |
| An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm | 2020-02-12 | Paper |
| Exponential slowdown for larger populations | 2020-02-11 | Paper |
| Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics | 2019-09-19 | Paper |
| When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument | 2019-09-18 | Paper |
| The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates | 2019-07-31 | Paper |
| Sorting by swaps with noisy comparisons | 2019-02-14 | Paper |
| Geometric inhomogeneous random graphs | 2019-01-25 | Paper |
| Asymptotically optimal amplifiers for the Moran process | 2019-01-10 | Paper |
| Drift Analysis and Evolutionary Algorithms Revisited | 2018-07-24 | Paper |
| The \((1+1)\) elitist black-box complexity of LeadingOnes | 2018-05-18 | Paper |
| Random Sampling with Removal. | 2018-01-30 | Paper |
| Bootstrap percolation on geometric inhomogeneous random graphs | 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 | 2017-10-11 | Paper |
| Note on the coefficient of variations of neuronal spike trains | 2017-09-12 | Paper |
| \textsc{OneMax} in black-box models with several restrictions | 2017-07-07 | Paper |
| Fixed Budget Performance of the (1+1) EA on Linear Functions | 2017-05-10 | Paper |
| Connectivity thresholds for bounded size rules | 2016-12-09 | Paper |
| Normalization Phenomena in Asynchronous Networks | 2015-11-04 | Paper |
| Evolutionary algorithms for quantum computers | 2014-03-25 | Paper |
| Black-box complexities of combinatorial problems | 2013-02-19 | Paper |
| The global Cohen-Lenstra heuristic | 2012-11-09 | Paper |
| The Cohen-Lenstra heuristic: methodology and results | 2010-06-08 | Paper |
| A combinatorial interpretation of the probabilities of \(p\)-groups in the Cohen-Lenstra measure | 2008-12-08 | Paper |
| The Interval Liar Game | 2008-04-24 | Paper |
| The Interval Liar Game | 2007-05-29 | Paper |
