Andrew M. Sutton

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Runtime analysis with variable cost Algorithmica	2025-08-29	Paper
Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms	2024-02-23	Paper
Finding Antimagic Labelings of Trees by Evolutionary Search Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms	2024-02-23	Paper
Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs Theoretical Computer Science	2023-03-10	Paper
Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms	2022-05-16	Paper
Solving non-uniform planted and filtered random SAT formulas greedily	2022-03-22	Paper
Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs Algorithmica	2021-11-05	Paper
Symmetry breaking for voting mechanisms	2021-10-18	Paper
Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem Algorithmica	2021-04-08	Paper
Bounds on the satisfiability threshold for power law distributed random SAT (available as arXiv preprint)	2020-05-27	Paper
Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms	2020-02-11	Paper
Approximating the distribution of fitness over Hamming regions Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms	2017-07-14	Paper
Time complexity analysis of evolutionary algorithms on random satisfiable k-CNF formulas Algorithmica	2017-07-07	Paper
Resampling vs recombination: a statistical run time estimation Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms	2017-06-13	Paper
Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems Algorithmica	2016-08-31	Paper
Toward a unifying framework for evolutionary processes Journal of Theoretical Biology	2016-08-18	Paper
The Benefit of Recombination in Noisy Evolutionary Search Algorithms and Computation	2016-01-11	Paper
Population size matters: rigorous runtime results for maximizing the hypervolume indicator Theoretical Computer Science	2014-12-02	Paper
The component model for elementary landscapes and partial neighborhoods Theoretical Computer Science	2014-07-10	Paper
The Max problem revisited: the importance of mutation in genetic programming Theoretical Computer Science	2014-07-10	Paper
Computing the moments k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time Theoretical Computer Science	2012-05-14	Paper

Research outcomes over time

This page was built for person: Andrew M. Sutton