| 2026 | GECCO | Hot off the Press: Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. | Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton |
| 2026 | PPSN | An Analysis of the Focused Jump-and-Repair EA on Parameterized Max-2-Sat. | Liam Gaeuman, Mahya Salimi Gamasaei, Andrew M. Sutton |
| 2026 | PPSN | Runtime Analysis of the (1+1) EA on Plateau Functions of Multi-valued Decision Variables. | Liam Gaeuman, Andrew M. Sutton |
| 2026 | PPSN | Evolutionary Algorithms and Multi-objective Minimum Spanning Trees with Limited Distinct Weight Values. | Narges Tavassoli Kejani, Andrew M. Sutton, Frank Neumann |
| 2025 | FOGA | Distributed Evolutionary Algorithms with Adversarial Corruption. | Brahim Aboutaib, Andrew M. Sutton |
| 2025 | FOGA | A Fixed-Parameter Tractable GA for Data Clustering. | Liam Gaeuman, Andrew M. Sutton |
| 2024 | GECCO | Mixed Binomial Distributions for Binary Mutation Operators. | Brahim Aboutaib, Andrew M. Sutton |
| 2024 | PPSN | Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem. | Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton |
| 2024 | PPSN | Evolving Populations of Solved Subgraphs with Crossover and Constraint Repair. | Jiwon Lee, Andrew M. Sutton |
| 2023 | FOGA | Finding Antimagic Labelings of Trees by Evolutionary Search. | Luke Branson, Andrew M. Sutton, Xiankun Yan |
| 2023 | FOGA | Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers. | Jack Kearney, Frank Neumann, Andrew M. Sutton |
| 2023 | GECCO | Runtime Analysis with Variable Cost. | Per Kristian Lehre, Andrew M. Sutton |
| 2022 | GECCO | The influence of noise on multi-parent crossover for an island model GA. | Brahim Aboutaib, Andrew M. Sutton |
| 2022 | GECCO | Evolving labelings of graceful graphs. | Luke Branson, Andrew M. Sutton |
| 2022 | PPSN | Runtime Analysis of Unbalanced Block-Parallel Evolutionary Algorithms. | Brahim Aboutaib, Andrew M. Sutton |
| 2021 | FOGA | Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems. | Luke Branson, Andrew M. Sutton |
| 2021 | GECCO | Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. | Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton |
| 2021 | SAT | Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. | Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton |
| 2020 | AAAI | Optimization of Chance-Constrained Submodular Functions. | Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton |
| 2020 | GECCO | Understanding transforms of pseudo-boolean functions. | L. Darrell Whitley, Hernn E. Aguirre, Andrew M. Sutton |
| 2020 | PPSN | Approximation Speed-Up by Quadratization on LeadingOnes. | Andrew M. Sutton, L. Darrell Whitley |
| 2019 | AAAI | Evolving Solutions to Community-Structured Satisfiability Formulas. | Frank Neumann, Andrew M. Sutton |
| 2019 | FOGA | Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. | Frank Neumann, Andrew M. Sutton |
| 2019 | GECCO | When resampling to cope with noise, use median, not mean. | Benjamin Doerr, Andrew M. Sutton |
| 2019 | GECCO | Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. | Andrew M. Sutton, Carsten Witt |
| 2019 | GECCO | Next generation genetic algorithms. | L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tins |
| 2019 | TACAS | On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. | Thomas Blsius, Tobias Friedrich, Andrew M. Sutton |
| 2018 | GECCO | Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. | Tobias Friedrich, Timo Ktzing, Francesco Quinzan, Andrew M. Sutton |
| 2018 | GECCO | On the runtime dynamics of the compact genetic algorithm on jump functions. | Vclav Hasenhrl, Andrew M. Sutton |
| 2018 | GECCO | Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem. | Andrew M. Sutton |
| 2018 | GECCO | Next generation genetic algorithms. | L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tins |
| 2018 | PPSN | Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. | Frank Neumann, Andrew M. Sutton |
| 2017 | AAAI | Phase Transitions for Scale-Free SAT Formulas. | Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton |
| 2017 | ESA | Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. | Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton |
| 2017 | FOGA | Resampling vs Recombination: a Statistical Run Time Estimation. | Tobias Friedrich, Timo Ktzing, Francesco Quinzan, Andrew M. Sutton |
| 2016 | GECCO | Escaping Local Optima with Diversity Mechanisms and Crossover. | Duc-Cuong Dang, Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton |
| 2016 | GECCO | The Benefit of Recombination in Noisy Evolutionary Search. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Andrew M. Sutton |
| 2016 | GECCO | Ant Colony Optimization Beats Resampling on Noisy Functions. | Tobias Friedrich, Timo Ktzing, Francesco Quinzan, Andrew M. Sutton |
| 2016 | PPSN | Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. | Duc-Cuong Dang, Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton |
| 2016 | PPSN | Graceful Scaling on Uniform Versus Steep-Tailed Noise. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Andrew M. Sutton |
| 2016 | PPSN | On the Robustness of Evolving Populations. | Tobias Friedrich, Timo Ktzing, Andrew M. Sutton |
| 2015 | GECCO | Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. | Benjamin Doerr, Frank Neumann, Andrew M. Sutton |
| 2015 | GECCO | Robustness of Ant Colony Optimization to Noise. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Andrew M. Sutton |
| 2015 | GECCO | Parameterized Complexity Analysis of Evolutionary Algorithms. | Frank Neumann, Andrew M. Sutton |
| 2015 | ISAAC | The Benefit of Recombination in Noisy Evolutionary Search. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Andrew M. Sutton |
| 2014 | GECCO | Efficient identification of improving moves in a ball for pseudo-boolean problems. | Francisco Chicano, L. Darrell Whitley, Andrew M. Sutton |
| 2014 | GECCO | Parameterized complexity analysis of evolutionary algorithms. | Frank Neumann, Andrew M. Sutton |
| 2014 | GECCO | Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems. | Andrew M. Sutton |
| 2014 | PPSN | Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. | Andrew M. Sutton, Frank Neumann |
| 2013 | CEC | Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. | Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann |
| 2013 | CEC | Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. | Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann |
| 2013 | GECCO | Population size matters: rigorous runtime results for maximizing the hypervolume indicator. | Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann |
| 2013 | GECCO | Elementary landscapes: theory and applications. | L. Darrell Whitley, Andrew M. Sutton |
| 2012 | AAAI | A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. | Andrew M. Sutton, Frank Neumann |
| 2012 | GECCO | The max problem revisited: the importance of mutation in genetic programming. | Timo Ktzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly |
| 2012 | GECCO | A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. | Andrew M. Sutton, Jareth Day, Frank Neumann |
| 2012 | GECCO | Elementary landscapes: theory and applications. | L. Darrell Whitley, Andrew M. Sutton |
| 2012 | PPSN | A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. | Andrew M. Sutton, Frank Neumann |
| 2011 | FOGA | Approximating the distribution of fitness over hamming regions. | Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe |
| 2011 | GECCO | Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. | Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe |
| 2011 | VISSOFT | MosaiCode: Visualizing large scale software: A tool demonstration. | Jonathan I. Maletic, Daniel J. Mosora, Christian D. Newman, Michael L. Collard, Andrew M. Sutton, Brian P. Robinson |
| 2010 | SoCS | Directed Plateau Search for MAX-k-SAT. | Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley |
| 2009 | GECCO | A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. | Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe |
| 2009 | GECCO | Partial neighborhoods of elementary landscapes. | L. Darrell Whitley, Andrew M. Sutton |
| 2009 | GECCO | Elementary landscape analysis. | L. Darrell Whitley, Andrew M. Sutton |
| 2008 | GECCO | Understanding elementary landscapes. | L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe |
| 2008 | PPSN | The Impact of Global Structure on Search. | Monte Lunacek, L. Darrell Whitley, Andrew M. Sutton |
| 2007 | GECCO | Differential evolution and non-separability: using selective pressure to focus search. | Andrew M. Sutton, Monte Lunacek, L. Darrell Whitley |
| 2006 | GECCO | PSO and multi-funnel landscapes: how cooperation might limit exploration. | Andrew M. Sutton, L. Darrell Whitley, Monte Lunacek, Adele E. Howe |
| 2005 | GECCO | Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones. | Andrew M. Sutton, Huzefa H. Kagdi, Jonathan I. Maletic, L. Gwenn Volkert |