Andrew M. Sutton

121 papers A* 7A 44B 6Journal 36Unranked 24

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Fixed-Parameter Tractable GA for Data Clustering. FOGA Liam Gaeuman, Andrew M. Sutton
2025	A	`conf`	Distributed Evolutionary Algorithms with Adversarial Corruption. FOGA Brahim Aboutaib, Andrew M. Sutton
2025	J	`jnl`	Runtime Analysis with Variable Cost. Algorithmica Per Kristian Lehre, Andrew M. Sutton
2024	—	`conf`	Evolving Populations of Solved Subgraphs with Crossover and Constraint Repair. PPSN (3) Jiwon Lee, Andrew M. Sutton
2024	J	`jnl`	Fixed-Parameter Tractability of the (1+1) Evolutionary Algorithm on Random Planted Vertex Covers. CoRR Jack Kearney, Frank Neumann, Andrew M. Sutton
2024	A	`conf`	Mixed Binomial Distributions for Binary Mutation Operators. GECCO Brahim Aboutaib, Andrew M. Sutton
2024	—	`conf`	Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem. PPSN (3) Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2024	J	`jnl`	Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem. CoRR Denis Antipov, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2024	J	`jnl`	The Influence of Noise on Multi-parent Crossover for an Island Model Genetic Algorithm. ACM Trans. Evol. Learn. Optim. Brahim Aboutaib, Andrew M. Sutton
2023	A	`conf`	Finding Antimagic Labelings of Trees by Evolutionary Search. FOGA Luke Branson, Andrew M. Sutton, Xiankun Yan
2023	A	`conf`	Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers. FOGA Jack Kearney, Frank Neumann, Andrew M. Sutton
2023	J	`jnl`	Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs. Theor. Comput. Sci. Luke Branson, Andrew M. Sutton
2023	A*	`conf`	Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. NeurIPS Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2023	J	`jnl`	Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems. CoRR Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2023	A	`conf`	Runtime Analysis with Variable Cost. GECCO Per Kristian Lehre, Andrew M. Sutton
2023	J	`jnl`	Symmetry Breaking for Voting Mechanisms. Evol. Comput. Preethi Sankineni, Andrew M. Sutton
2022	A	`conf`	Evolving labelings of graceful graphs. GECCO Luke Branson, Andrew M. Sutton
2022	J	`jnl`	Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems. CoRR Luke Branson, Andrew M. Sutton
2022	—	`conf`	Runtime Analysis of Unbalanced Block-Parallel Evolutionary Algorithms. PPSN (2) Brahim Aboutaib, Andrew M. Sutton
2022	A	`conf`	The influence of noise on multi-parent crossover for an island model GA. GECCO Brahim Aboutaib, Andrew M. Sutton
2021	J	`jnl`	Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem. Algorithmica Andrew M. Sutton
2021	A	`conf`	Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems. FOGA Luke Branson, Andrew M. Sutton
2021	J	`jnl`	Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs. Algorithmica Andrew M. Sutton, Carsten Witt
2021	J	`jnl`	Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights. CoRR Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2021	A	`conf`	Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights. GECCO Yue Xie, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2021	A	`conf`	Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton
2021	B	`conf`	Symmetry Breaking for Voting Mechanisms. EvoCOP Preethi Sankineni, Andrew M. Sutton
2020	—	`conf`	Approximation Speed-Up by Quadratization on LeadingOnes. PPSN (2) Andrew M. Sutton, L. Darrell Whitley
2020	A*	`conf`	Optimization of Chance-Constrained Submodular Functions. AAAI Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2020	J	`jnl`	Parameterized Complexity Analysis of Randomized Search Heuristics. CoRR Frank Neumann, Andrew M. Sutton
2020	—	`ch.`	Parameterized Complexity Analysis of Randomized Search Heuristics. Theory of Evolutionary Computation Frank Neumann, Andrew M. Sutton
2020	J	`jnl`	Theory of evolutionary computation - Special Issue Editorial. Theor. Comput. Sci. Pietro S. Oliveto, Andrew M. Sutton
2020	A	`conf`	Understanding transforms of pseudo-boolean functions. GECCO L. Darrell Whitley, Hernán E. Aguirre, Andrew M. Sutton
2019	A*	`conf`	Evolving Solutions to Community-Structured Satisfiability Formulas. AAAI Frank Neumann, Andrew M. Sutton
2019	A	`conf`	Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs. GECCO Andrew M. Sutton, Carsten Witt
2019	—	`conf`	Next generation genetic algorithms. GECCO (Companion) L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tinós
2019	—	`conf`	On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. TACAS (1) Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton
2019	J	`jnl`	Optimization of Chance-Constrained Submodular Functions. CoRR Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
2019	A	`conf`	Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. FOGA Frank Neumann, Andrew M. Sutton
2019	A	`conf`	When resampling to cope with noise, use median, not mean. GECCO Benjamin Doerr, Andrew M. Sutton
2018	A	`conf`	Crossover can simulate bounded tree search on a fixed-parameter tractable optimization problem. GECCO Andrew M. Sutton
2018	J	`jnl`	Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evol. Comput. Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2018	A	`conf`	Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. GECCO Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2018	—	`conf`	Next generation genetic algorithms. GECCO (Companion) L. Darrell Whitley, Francisco Chicano, Gabriela Ochoa, Andrew M. Sutton, Renato Tinós
2018	A	`conf`	On the runtime dynamics of the compact genetic algorithm on jump functions. GECCO Václav Hasenöhrl, Andrew M. Sutton
2018	—	`conf`	Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. PPSN (2) Frank Neumann, Andrew M. Sutton
2017	A	`conf`	Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
2017	J	`jnl`	Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
2017	A*	`conf`	Phase Transitions for Scale-Free SAT Formulas. AAAI Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton
2017	A	`conf`	Resampling vs Recombination: a Statistical Run Time Estimation. FOGA Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2017	J	`jnl`	The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. IEEE Trans. Evol. Comput. Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2017	J	`jnl`	Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica Benjamin Doerr, Frank Neumann, Andrew M. Sutton
2016	—	`conf`	Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2016	A	`conf`	Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	J	`jnl`	Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	A	`conf`	Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	—	`ed.`	Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings GECCO (Companion) Tobias Friedrich, Frank Neumann, Andrew M. Sutton
2016	A	`conf`	Graceful Scaling on Uniform Versus Steep-Tailed Noise. PPSN Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2016	A	`conf`	On the Robustness of Evolving Populations. PPSN Tobias Friedrich, Timo Kötzing, Andrew M. Sutton
2016	A	`ed.`	Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016 GECCO Tobias Friedrich, Frank Neumann, Andrew M. Sutton
2016	J	`jnl`	Robustness of Ant Colony Optimization to Noise. Evol. Comput. Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2016	J	`jnl`	Stochastic-based robust dynamic resource allocation for independent tasks in a heterogeneous computing system. J. Parallel Distributed Comput. 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
2016	J	`jnl`	Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. Algorithmica Andrew M. Sutton
2016	—	`conf`	The Benefit of Recombination in Noisy Evolutionary Search. GECCO (Companion) Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	J	`jnl`	Editorial for the Special Issue on Theory of Evolutionary Algorithms 2014. Evol. Comput. Pietro S. Oliveto, Andrew M. Sutton
2015	J	`jnl`	Fitness Probability Distribution of Bit-Flip Mutation. Evol. Comput. Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba
2015	A	`conf`	Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. GECCO Benjamin Doerr, Frank Neumann, Andrew M. Sutton
2015	—	`conf`	Parameterized Complexity Analysis of Evolutionary Algorithms. GECCO (Companion) Frank Neumann, Andrew M. Sutton
2015	J	`jnl`	Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theor. Comput. Sci. Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann
2015	A	`conf`	Robustness of Ant Colony Optimization to Noise. GECCO Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	B	`conf`	The Benefit of Recombination in Noisy Evolutionary Search. ISAAC Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	J	`jnl`	The Benefit of Sex in Noisy Evolutionary Search. CoRR Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2014	A	`conf`	Efficient identification of improving moves in a ball for pseudo-boolean problems. GECCO Francisco Chicano, L. Darrell Whitley, Andrew M. Sutton
2014	J	`jnl`	Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evol. Comput. Andrew M. Sutton, Frank Neumann, Samadhi Nallaperuma
2014	—	`conf`	Parameterized complexity analysis of evolutionary algorithms. GECCO (Companion) Frank Neumann, Andrew M. Sutton
2014	A	`conf`	Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. PPSN Andrew M. Sutton, Frank Neumann
2014	A	`conf`	Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems. GECCO Andrew M. Sutton
2014	J	`jnl`	The Max problem revisited: The importance of mutation in genetic programming. Theor. Comput. Sci. Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly
2014	J	`jnl`	The component model for elementary landscapes and partial neighborhoods. Theor. Comput. Sci. L. Darrell Whitley, Andrew M. Sutton, Gabriela Ochoa, Francisco Chicano
2013	—	`conf`	Elementary landscapes: theory and applications. GECCO (Companion) L. Darrell Whitley, Andrew M. Sutton
2013	J	`jnl`	Emulating C++0x concepts. Sci. Comput. Program. Andrew M. Sutton, Jonathan I. Maletic
2013	J	`jnl`	Fitness Function Distributions over Generalized Search Neighborhoods in the Evol. Comput. Andrew M. Sutton, Francisco Chicano, L. Darrell Whitley
2013	J	`jnl`	Fitness Probability Distribution of Bit-Flip Mutation. CoRR Francisco Chicano, Andrew M. Sutton, L. Darrell Whitley, Enrique Alba
2013	B	`conf`	Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. IEEE Congress on Evolutionary Computation Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann
2013	B	`conf`	Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. IEEE Congress on Evolutionary Computation Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann
2013	A	`conf`	Population size matters: rigorous runtime results for maximizing the hypervolume indicator. GECCO Anh Quang Nguyen, Andrew M. Sutton, Frank Neumann
2013	J	`jnl`	Thomas Jansen: Analyzing Evolutionary Algorithms: The Computer Science Perspective - Springer, 2013, 255 pp, ISBN: 978-3-642-17338-7. Genet. Program. Evolvable Mach. Andrew M. Sutton
2012	J	`jnl`	A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem CoRR Andrew M. Sutton, Frank Neumann
2012	A*	`conf`	A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. AAAI Andrew M. Sutton, Frank Neumann
2012	—	`conf`	A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. PPSN (1) Andrew M. Sutton, Frank Neumann
2012	A	`conf`	A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. GECCO Andrew M. Sutton, Jareth Day, Frank Neumann
2012	J	`jnl`	Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theor. Comput. Sci. Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
2012	—	`conf`	Elementary landscapes: theory and applications. GECCO (Companion) L. Darrell Whitley, Andrew M. Sutton
2012	—	`ch.`	Genetic Algorithms - A Survey of Models and Methods. Handbook of Natural Computing L. Darrell Whitley, Andrew M. Sutton
2012	A	`conf`	The max problem revisited: the importance of mutation in genetic programming. GECCO Timo Kötzing, Andrew M. Sutton, Frank Neumann, Una-May O'Reilly
2011	A	`conf`	Approximating the distribution of fitness over hamming regions. FOGA Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
2011	B	`conf`	MosaiCode: Visualizing large scale software: A tool demonstration. VISSOFT Jonathan I. Maletic, Daniel J. Mosora, Christian D. Newman, Michael L. Collard, Andrew M. Sutton, Brian P. Robinson
2011	A	`conf`	Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. GECCO Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
2010	B	`conf`	Directed Plateau Search for MAX-k-SAT. SOCS Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
2010	A	`conf`	Identification of Idiom Usage in C++ Generic Libraries. ICPC Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic
2009	—	`conf`	A Theoretical Analysis of the k-Satisfiability Search Space. SLS Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
2009	A	`conf`	A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. GECCO Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
2009	—	`conf`	Abstracting the template instantiation relation in C++. ICSM Andrew M. Sutton, Ryan Holeman, Jonathan I. Maletic
2009	—	`conf`	Elementary landscape analysis. GECCO (Companion) L. Darrell Whitley, Andrew M. Sutton
2009	—	`conf`	Estimating Bounds on Expected Plateau Size in MAXSAT Problems. SLS Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
2009	—	`conf`	Improved Robustness through Population Variance in Ant Colony Optimization. SLS David C. Matthews, Andrew M. Sutton, Doug Hains, L. Darrell Whitley
2009	A	`conf`	Partial neighborhoods of elementary landscapes. GECCO L. Darrell Whitley, Andrew M. Sutton
2008	—	`conf`	Automatically identifying C++0x concepts in function templates. ICSM Andrew M. Sutton, Jonathan I. Maletic
2008	—	`ch.`	Resource Scheduling with Permutation Based Representations: Three Applications. Evolutionary Computation in Practice L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe, Laura Barbulescu
2008	A	`conf`	The Impact of Global Structure on Search. PPSN Monte Lunacek, L. Darrell Whitley, Andrew M. Sutton
2008	A	`conf`	Understanding elementary landscapes. GECCO L. Darrell Whitley, Andrew M. Sutton, Adele E. Howe
2007	A	`conf`	Differential evolution and non-separability: using selective pressure to focus search. GECCO Andrew M. Sutton, Monte Lunacek, L. Darrell Whitley
2007	—	`conf`	How We Manage Portability and Configuration with the C Preprocessor. ICSM Andrew M. Sutton, Jonathan I. Maletic
2007	A	`conf`	Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment. IPDPS Jay Smith, Luis Diego Briceno, Anthony A. Maciejewski, Howard Jay Siegel, Timothy Renner, Vladimir Shestak, Joshua Ladd, Andrew M. Sutton, David L. Janovy, Sudha Govindasamy, Amin Alqudah, Rinku Dewri, Puneet Prakash
2007	J	`jnl`	Recovering UML class models from C++: A detailed explanation. Inf. Softw. Technol. Andrew M. Sutton, Jonathan I. Maletic
2007	A*	`conf`	Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling. ICAPS Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
2006	A	`conf`	PSO and multi-funnel landscapes: how cooperation might limit exploration. GECCO Andrew M. Sutton, L. Darrell Whitley, Monte Lunacek, Adele E. Howe
2006	A*	`conf`	Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules. ICAPS Andrew M. Sutton, Adele E. Howe, L. Darrell Whitley
2005	—	`conf`	Context-Free Slicing of UML Class Models. ICSM Huzefa H. Kagdi, Jonathan I. Maletic, Andrew M. Sutton
2005	A	`conf`	Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones. GECCO Andrew M. Sutton, Huzefa H. Kagdi, Jonathan I. Maletic, L. Gwenn Volkert
2005	—	`conf`	Mappings for Accurately Reverse Engineering UML Class Models from C++. WCRE Andrew M. Sutton, Jonathan I. Maletic