Martin S. Krejca

Theor. Comput. Sci., 2024

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation.

[BibT_eX]

[DOI]

CoRR, 2024

Proven Runtime Guarantees for How the MOEA/D: Computes the Pareto Front from the Subproblem Solutions.

[BibT_eX]

[DOI]

Noé Weeks

Proceedings of the Parallel Problem Solving from Nature - PPSN XVIII, 2024

A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2024

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics.

[BibT_eX]

[DOI]

Nguyen Vu

Proceedings of the Genetic and Evolutionary Computation Conference, 2024

From Market Saturation to Social Reinforcement: Understanding the Impact of Non-Linearity in Information Diffusion Models.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Evolutionary Minimization of Traffic Congestion.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., December, 2023

Run Time Analysis for Random Local Search on Generalized Majority Functions.

[BibT_eX]

[DOI]

Carola Doerr

IEEE Trans. Evol. Comput., October, 2023

Bivariate estimation-of-distribution algorithms can find an exponential number of optima.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

Polymer dynamics via cliques: New conditions for approximations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Synergizing Theory and Practice of Automated Algorithm Design for Optimization (Dagstuhl Seminar 23332).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

Lasting Diversity and Superior Runtime Guarantees for the (μ+1) Genetic Algorithm.

[BibT_eX]

[DOI]

CoRR, 2023

The impact of geometry on monochrome regions in the flip Schelling process.

[BibT_eX]

[DOI]

Comput. Geom., 2023

The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2023

2022

A Spectral Independence View on Hard Spheres via Block Dynamics.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials.

[BibT_eX]

[DOI]

CoRR, 2022

Accelerated Information Dissemination on Networks with Local and Global Edges.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2022

Escaping Local Optima with Local Search: A Theory-Driven Discussion.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022

Theory-inspired parameter control benchmarks for dynamic algorithm configuration.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Algorithms for Hard-Constraint Point Processes via Discretization.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis.

[BibT_eX]

[DOI]

Evol. Comput., 2021

Algorithms for general hard-constraint point processes via discretization.

[BibT_eX]

[DOI]

CoRR, 2021

The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Theory of Estimation-of-Distribution Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Computation, 2020

Significance-Based Estimation-of-Distribution Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2020

Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Polymer dynamics via cliques with applications to hard-sphere mixtures.

[BibT_eX]

[DOI]

CoRR, 2020

Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation.

[BibT_eX]

[DOI]

Tobias Friedrich

J. A. Gregor Lagodzinski

Manuel Rizzo

Arthur Zahn

Proceedings of the Neural Information Processing - 27th International Conference, 2020

2019

Theoretical analyses of univariate estimation-of-distribution algorithms

[BibT_eX]

[DOI]

PhD thesis, 2019

First-hitting times under drift.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Unbiasedness of estimation-of-distribution algorithms.

[BibT_eX]

[DOI]

Tobias Friedrich

Theor. Comput. Sci., 2019

Routing for on-street parking search using probabilistic data.

[BibT_eX]

[DOI]

AI Commun., 2019

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018

Escaping Local Optima Using Crossover With Emergent Diversity.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2018

Theory of Estimation-of-Distribution Algorithms.

[BibT_eX]

[DOI]

CoRR, 2018

Intuitive Analyses via Drift Theory.

[BibT_eX]

[DOI]

Andreas Göbel

CoRR, 2018

Memory-Restricted Routing with Tiled Map Data.

[BibT_eX]

[DOI]

J. A. Gregor Lagodzinski

Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2018

First-Hitting Times Under Additive Drift.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

First-Hitting Times for Finite State Spaces.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2017

The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2017

2016

Robustness of Ant Colony Optimization to Noise.

[BibT_eX]

[DOI]

Evol. Comput., 2016

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.

[BibT_eX]

[DOI]

CoRR, 2016

Graceful Scaling on Uniform Versus Steep-Tailed Noise.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

The Benefit of Recombination in Noisy Evolutionary Search.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Fast Building Block Assembly by Majority Vote Crossover.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

EDAs cannot be Balanced and Stable.

[BibT_eX]

[DOI]

Tobias Friedrich