| Publication | Date of Publication | Type |
|---|
| A spectral independence view on hard spheres via block dynamics | 2026-05-12 | Paper |
Sampling repulsive Gibbs point processes using random graphs
Combinatorics, Probability and Computing | 2025-12-29 | Paper |
A flexible evolutionary algorithm with dynamic mutation rate archive
Algorithmica | 2025-11-25 | Paper |
Understanding the impact of non-linearity in the SIS model
Physica A | 2024-12-16 | Paper |
Analysis of the survival time of the SIRS process via expansion
Electronic Journal of Probability | 2024-08-30 | Paper |
Estimation-of-distribution algorithms for multi-valued decision variables
Theoretical Computer Science | 2024-06-04 | Paper |
| scientific article; zbMATH DE number 7788602 (Why is no real title available?) | 2024-01-15 | Paper |
Bivariate estimation-of-distribution algorithms can find an exponential number of optima
Theoretical Computer Science | 2023-08-18 | Paper |
Algorithms for hard-constraint point processes via discretization
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Polymer dynamics via cliques: new conditions for approximations
Theoretical Computer Science | 2022-12-21 | Paper |
| Accelerated information dissemination on networks with local and global edges | 2022-11-11 | Paper |
The impact of geometry on monochrome regions in the flip Schelling process
Computational Geometry | 2022-10-06 | Paper |
A spectral independence view on hard spheres via block dynamics
SIAM Journal on Discrete Mathematics | 2022-10-06 | Paper |
| Analysis of the survival time of the SIRS process via expansion | 2022-05-05 | Paper |
| Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials | 2022-04-04 | Paper |
The univariate marginal distribution algorithm copes well with deception and epistasis
(available as arXiv preprint) | 2021-12-08 | Paper |
| The Flip Schelling Process on Random Geometric and Erd\"os-R\'enyi Graphs | 2021-02-19 | Paper |
A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes
Theoretical Computer Science | 2021-01-25 | Paper |
Polymer Dynamics via Cliques: New Conditions for Approximations
(available as arXiv preprint) | 2020-07-16 | Paper |
Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax
Theoretical Computer Science | 2020-05-26 | Paper |
First-hitting times under drift
Theoretical Computer Science | 2019-11-13 | Paper |
Unbiasedness of estimation-of-distribution algorithms
Theoretical Computer Science | 2019-07-31 | Paper |
| Intuitive Analyses via Drift Theory | 2018-05-22 | Paper |
| Probabilistic routing for on-street parking search | 2018-03-02 | Paper |
Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
The Benefit of Recombination in Noisy Evolutionary Search
Algorithms and Computation | 2016-01-11 | Paper |
From Market Saturation to Social Reinforcement: Understanding the Impact of Non-Linearity in Information Diffusion Models
(available as arXiv preprint) | N/A | Paper |
