Andrew M. Sutton

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 63

Top Venues

Publications

Brahim Aboutaib, Andrew M. Sutton
The Influence of Noise on Multi-parent Crossover for an Island Model Genetic Algorithm. ACM Trans. Evol. Learn. Optim. 4 (2) (2024)
Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. CoRR (2024)
Brahim Aboutaib, Andrew M. Sutton
Mixed Binomial Distributions for Binary Mutation Operators. GECCO (2024)
Jack Kearney, Frank Neumann, Andrew M. Sutton
Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers. FOGA (2023)
Luke Branson, Andrew M. Sutton, Xiankun Yan
Finding Antimagic Labelings of Trees by Evolutionary Search. FOGA (2023)
Preethi Sankineni, Andrew M. Sutton
Symmetry Breaking for Voting Mechanisms. Evol. Comput. 31 (3) (2023)
Luke Branson, Andrew M. Sutton
Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs. Theor. Comput. Sci. 951 (2023)
Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. CoRR (2023)
Per Kristian Lehre, Andrew M. Sutton
Runtime Analysis with Variable Cost. GECCO (2023)
Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. NeurIPS (2023)
Brahim Aboutaib, Andrew M. Sutton
Runtime Analysis of Unbalanced Block-Parallel Evolutionary Algorithms. PPSN (2) (2022)
Brahim Aboutaib, Andrew M. Sutton
The influence of noise on multi-parent crossover for an island model GA. GECCO (2022)
Luke Branson, Andrew M. Sutton
Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems. CoRR (2022)
Luke Branson, Andrew M. Sutton
Evolving labelings of graceful graphs. GECCO (2022)
Preethi Sankineni, Andrew M. Sutton
Symmetry Breaking for Voting Mechanisms. EvoCOP (2021)
Andrew M. Sutton
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem. Algorithmica 83 (4) (2021)
Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights. CoRR (2021)
Luke Branson, Andrew M. Sutton
Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems. FOGA (2021)
Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. GECCO (2021)
Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT (2021)
Andrew M. Sutton, Carsten Witt
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. Algorithmica 83 (10) (2021)
Andrew M. Sutton, L. Darrell Whitley
Approximation Speed-Up by Quadratization on LeadingOnes. PPSN (2) (2020)
L. Darrell Whitley, Hernán E. Aguirre, Andrew M. Sutton
Understanding transforms of pseudo-boolean functions. GECCO (2020)
Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Optimization of Chance-Constrained Submodular Functions. AAAI (2020)
Pietro S. Oliveto, Andrew M. Sutton
Theory of evolutionary computation - Special Issue Editorial. Theor. Comput. Sci. 832 (2020)
Frank Neumann, Andrew M. Sutton
Parameterized Complexity Analysis of Randomized Search Heuristics. CoRR (2020)
L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tinós
Next generation genetic algorithms. GECCO (Companion) (2019)
Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Optimization of Chance-Constrained Submodular Functions. CoRR (2019)
Frank Neumann, Andrew M. Sutton
Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. FOGA (2019)
Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton
On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. TACAS (1) (2019)
Frank Neumann, Andrew M. Sutton
Evolving Solutions to Community-Structured Satisfiability Formulas. AAAI (2019)
Benjamin Doerr, Andrew M. Sutton
When resampling to cope with noise, use median, not mean. GECCO (2019)
Andrew M. Sutton, Carsten Witt
Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. GECCO (2019)
Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evol. Comput. 22 (3) (2018)
Václav Hasenöhrl, Andrew M. Sutton
On the runtime dynamics of the compact genetic algorithm on jump functions. GECCO (2018)
Frank Neumann, Andrew M. Sutton
Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. PPSN (2) (2018)
Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. GECCO (2018)
L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tinós
Next generation genetic algorithms. GECCO (Companion) (2018)
Andrew M. Sutton
Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem. GECCO (2018)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR (2017)
Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
Resampling vs Recombination: a Statistical Run Time Estimation. FOGA (2017)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton
Phase Transitions for Scale-Free SAT Formulas. AAAI (2017)
Benjamin Doerr, Frank Neumann, Andrew M. Sutton
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 78 (2) (2017)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA (2017)
Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. IEEE Trans. Evol. Comput. 21 (3) (2017)
Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) (2016)
Andrew M. Sutton
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. Algorithmica 75 (3) (2016)
Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
Robustness of Ant Colony Optimization to Noise. Evol. Comput. 24 (2) (2016)
Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
Graceful Scaling on Uniform Versus Steep-Tailed Noise. PPSN (2016)
Mohsen Amini Salehi, Jay Smith, Anthony A. Maciejewski, Howard Jay Siegel, Edwin K. P. Chong, Jonathan Apodaca, Luis Diego Briceno, Timothy Renner, Vladimir Shestak, Joshua Ladd, Andrew M. Sutton, David L. Janovy, Sudha Govindasamy, Amin Alqudah, Rinku Dewri, Puneet Prakash
Stochastic-based robust dynamic resource allocation for independent tasks in a heterogeneous computing system. J. Parallel Distributed Comput. 97 (2016)
Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN (2016)
Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO (2016)
Tobias Friedrich, Timo Kötzing, Andrew M. Sutton
On the Robustness of Evolving Populations. PPSN (2016)
Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR (2016)
Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
The Benefit of Recombination in Noisy Evolutionary Search. GECCO (Companion) (2016)
Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
Robustness of Ant Colony Optimization to Noise. GECCO (2015)
Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba
Fitness Probability Distribution of Bit-Flip Mutation. Evol. Comput. 23 (2) (2015)
Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
The Benefit of Recombination in Noisy Evolutionary Search. ISAAC (2015)
Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
The Benefit of Sex in Noisy Evolutionary Search. CoRR (2015)
Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann
Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theor. Comput. Sci. 561 (2015)
Benjamin Doerr, Frank Neumann, Andrew M. Sutton
Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. GECCO (2015)
Pietro S. Oliveto, Andrew M. Sutton
Editorial for the Special Issue on Theory of Evolutionary Algorithms 2014. Evol. Comput. 23 (4) (2015)
Frank Neumann, Andrew M. Sutton
Parameterized Complexity Analysis of Evolutionary Algorithms. GECCO (Companion) (2015)
Frank Neumann, Andrew M. Sutton
Parameterized complexity analysis of evolutionary algorithms. GECCO (Companion) (2014)
Andrew M. Sutton, Frank Neumann, Samadhi Nallaperuma
Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evol. Comput. 22 (4) (2014)
Francisco Chicano, L. Darrell Whitley, Andrew M. Sutton
Efficient identification of improving moves in a ball for pseudo-boolean problems. GECCO (2014)
L. Darrell Whitley, Andrew M. Sutton, Gabriela Ochoa, Francisco Chicano
The component model for elementary landscapes and partial neighborhoods. Theor. Comput. Sci. 545 (2014)
Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly
The Max problem revisited: The importance of mutation in genetic programming. Theor. Comput. Sci. 545 (2014)
Andrew M. Sutton, Frank Neumann
Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. PPSN (2014)
Andrew M. Sutton
Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems. GECCO (2014)
Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba
Fitness Probability Distribution of Bit-Flip Mutation. CoRR (2013)
Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann
Population size matters: rigorous runtime results for maximizing the hypervolume indicator. GECCO (2013)
Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann
Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. IEEE Congress on Evolutionary Computation (2013)
Andrew M. Sutton, Jonathan I. Maletic
Emulating C++0x concepts. Sci. Comput. Program. 78 (9) (2013)
L. Darrell Whitley, Andrew M. Sutton
Elementary landscapes: theory and applications. GECCO (Companion) (2013)
Andrew M. Sutton, Francisco Chicano, L. Darrell Whitley
-ary Hypercube. Evol. Comput. 21 (4) (2013)
Andrew M. Sutton
Thomas Jansen: Analyzing Evolutionary Algorithms: The Computer Science Perspective - Springer, 2013, 255 pp, ISBN: 978-3-642-17338-7. Genet. Program. Evolvable Mach. 14 (4) (2013)
Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann
Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. IEEE Congress on Evolutionary Computation (2013)
Andrew M. Sutton, Jareth Day, Frank Neumann
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. GECCO (2012)
Andrew M. Sutton, Frank Neumann
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. AAAI (2012)
Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly
The max problem revisited: the importance of mutation in genetic programming. GECCO (2012)
L. Darrell Whitley, Andrew M. Sutton
Elementary landscapes: theory and applications. GECCO (Companion) (2012)
Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theor. Comput. Sci. 425 (2012)
Andrew M. Sutton, Frank Neumann
A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem CoRR (2012)
Andrew M. Sutton, Frank Neumann
A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. PPSN (1) (2012)
Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. GECCO (2011)
Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
Approximating the distribution of fitness over hamming regions. FOGA (2011)
Jonathan I. Maletic, Daniel J. Mosora, Christian D. Newman, Michael L. Collard, Andrew M. Sutton, Brian P. Robinson
MosaiCode: Visualizing large scale software: A tool demonstration. VISSOFT (2011)
Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic
Identification of Idiom Usage in C++ Generic Libraries. ICPC (2010)
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
Directed Plateau Search for MAX-k-SAT. SOCS (2010)
Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic
Abstracting the template instantiation relation in C++. ICSM (2009)
Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. GECCO (2009)
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
A Theoretical Analysis of the k-Satisfiability Search Space. SLS (2009)
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
Estimating Bounds on Expected Plateau Size in MAXSAT Problems. SLS (2009)
L. Darrell Whitley, Andrew M. Sutton
Elementary landscape analysis. GECCO (Companion) (2009)
David C. Matthews, Andrew M. Sutton, Doug Hains, L. Darrell Whitley
Improved Robustness through Population Variance in Ant Colony Optimization. SLS (2009)
L. Darrell Whitley, Andrew M. Sutton
Partial neighborhoods of elementary landscapes. GECCO (2009)
Monte Lunacek, L. Darrell Whitley, Andrew M. Sutton
The Impact of Global Structure on Search. PPSN (2008)
Andrew M. Sutton, Jonathan I. Maletic
Automatically identifying C++0x concepts in function templates. ICSM (2008)
L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe
Understanding elementary landscapes. GECCO (2008)

Andrew M. Sutton.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andrew M. Sutton