# Publications of Dr. Andrew M. Sutton

The following listing contains all publications of Dr. Andrew M. Sutton. Further publications of the research group can be found on the current list of publications and the complete list of publications. Individual listings are available externally on DBLP or locally as PDF.

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

- years: 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Thomas Bläsius, Dr. Katrin Casel, Dr. Sarel Cohen, Dr. Ágnes Cseh, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Martin Krejca, Dr. Nikhil Kumar, Dr. Pascal Lenzner
- PhD students: Vanja Doskoč, Ziena Elijazyfer, Philipp Fischbeck, Maximilian Katzmann, Ardalan Khazraei, Simon Krogmann, Gregor Lagodzinski, Anna Melnichenko, Louise Molitor, Stefan Neubert, Francesco Quinzan, Ralf Rothenberger, Martin Schirneck, Karen Seidel, Christopher Weyand
- theory conferences: ICALP, MFCS, SAGT, STACS, STOC, WINE

algorithm conferences: ALENEX, ESA, GD, ISAAC, SODA, SPAA, SWAT, WAW - artificial intelligence conferences: AAAI, AAMAS, ALT, COLT, ECAI, ICAPS, IJCAI, SAT

evolutionary computation conferences: CEC, EMO, EvoCOP, FOGA, GECCO, PPSN

2019 [ nach oben ]

- On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. Tools and Algorithms for the Construction and Analysis of Systems (TACAS) 2019: 117-134

2018 [ nach oben ]

- Escaping Local Optima Using Crossover with Emergent Diversity. Transactions on Evolutionary Computation 2018: 484-497
- Improving the Run Time of the (1+1) Evolutionary Algorithm with Luby Sequences. Genetic and Evolutionary Computation Conference (GECCO) 2018: 301-308

2017 [ nach oben ]

- Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 2017: 561-586
- The Compact Genetic Algorithm is Efficient under Extreme Gaussian Noise. Transactions on Evolutionary Computation 2017: 477-490
- Phase Transitions for Scale-Free SAT Formulas. Conference on Artificial Intelligence (AAAI) 2017: 3893-3899
- Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. European Symposium on Algorithms (ESA) 2017: 37:1-37:15
- Resampling vs Recombination: a Statistical Run Time Estimation. Foundations of Genetic Algorithms (FOGA) 2017: 25-35

2016 [ nach oben ]

- Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. Algorithmica 2016: 507-528
- Robustness of Ant Colony Optimization to Noise. Evolutionary Computation 2016: 237-254
- Ant Colony Optimization Beats Resampling on Noisy Functions. Genetic and Evolutionary Computation Conference (GECCO) 2016: 3-4
- The Benefit of Recombination in Noisy Evolutionary Search. Genetic and Evolutionary Computation Conference (GECCO) 2016: 161-162
- Escaping Local Optima with Diversity Mechanisms and Crossover. Genetic and Evolutionary Computation Conference (GECCO) 2016: 645-652
- Graceful Scaling on Uniform versus Steep-Tailed Noise. Parallel Problem Solving From Nature (PPSN) 2016: 761-770
- On the Robustness of Evolving Populations. Parallel Problem Solving From Nature (PPSN) 2016: 771-781
- Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. Parallel Problem Solving From Nature (PPSN) 2016: 890-900
- Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20 - 24, 2016. 2016ACM.Editorship
- Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings. 2016ACM.Editorship

2015 [ nach oben ]

- Fitness Probability Distribution of Bit-Flip Mutation. Evolutionary Computation 2015: 217-248
- Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology 2015: 28-43
- Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theoretical Computer Science 2015: 24-36
- Robustness of Ant Colony Optimization to Noise. Genetic and Evolutionary Computation Conference (GECCO) 2015: 17-24Best-Paper Award (ACO/SI Track)
- Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. Genetic and Evolutionary Computation Conference (GECCO) 2015: 1415-1422
- The Benefit of Recombination in Noisy Evolutionary Search. International Symposium of Algorithms and Computation (ISAAC) 2015: 140-150

2014 [ nach oben ]

- Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evolutionary Computation 2014: 595-628
- The component model for elementary landscapes and partial neighborhoods. Theoretical Computer Science 2014: 59-75
- The Max problem revisited: The importance of mutation in genetic programming. Theoretical Computer Science 2014: 94-107
- Efficient identification of improving moves in a ball for pseudo-boolean problems. Genetic and Evolutionary Computation Conference (GECCO) 2014: 437-444
- Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. Parallel Problem Solving from Nature (PPSN) 2014: 942-951

2013 [ nach oben ]

- Fitness Function Distributions over Generalized Search Neighborhoods in the q-ary Hypercube. Evolutionary Computation 2013: 561-590
- Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. Congress on Evolutionary Computation (CEC) 2013: 2037-2044
- Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. Congress on Evolutionary Computation (CEC) 2013: 2045-2052

2012 [ nach oben ]

- Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science 2012: 58-74
- Genetic Algorithms - A Survey of Models and Methods. Handbook of Natural Computing 2012: 637-671
- A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. Conference on Artificial Intelligence (AAAI) 2012
- A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. Genetic and Evolutionary Computation Conference (GECCO) 2012: 433-440
- The max problem revisited: the importance of mutation in genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2012: 1333-1340
- A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. Parallel Problem Solving from Nature (PPSN) 2012: 52-61

2011 [ nach oben ]

- Approximating the distribution of fitness over hamming regions. Foundations of Genetic Algorithms (FOGA) 2011: 93-104
- Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. Genetic and Evolutionary Computation Conference (GECCO) 2011: 973-980

2010 [ nach oben ]

- Directed Plateau Search for MAX-k-SAT. Symposium on Combinatorial Search (SOCS) 2010

2009 [ nach oben ]

- A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. Genetic and Evolutionary Computation Conference (GECCO) 2009: 365-372
- Partial neighborhoods of elementary landscapes. Genetic and Evolutionary Computation Conference (GECCO) 2009: 381-388
- Estimating Bounds on Expected Plateau Size in MAXSAT Problems. Stochastic Local Search Algorithms (SLS) 2009: 31-45
- A Theoretical Analysis of the k-Satisfiability Search Space. Stochastic Local Search Algorithms (SLS) 2009: 46-60
- Improved Robustness through Population Variance in Ant Colony Optimization. Stochastic Local Search Algorithms (SLS) 2009: 145-149

2008 [ nach oben ]

- Resource Scheduling with Permutation Based Representations: Three Applications. Evolutionary Computation in Practice 2008: 219-243
- Understanding elementary landscapes. Genetic and Evolutionary Computation Conference (GECCO) 2008: 585-592
- The Impact of Global Structure on Search. Parallel Problem Solving from Nature (PPSN) 2008: 498-507

2007 [ nach oben ]

- Differential evolution and non-separability: using selective pressure to focus search. Genetic and Evolutionary Computation Conference (GECCO) 2007: 1428-1435
- Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling. International Conference on Automated Planning and Scheduling (ICAPS) 2007: 320-327
- Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment. International Parallel and Distributed Processing Symposium (IPDPS) 2007: 1-10

2006 [ nach oben ]

- PSO and multi-funnel landscapes: how cooperation might limit exploration. Genetic and Evolutionary Computation Conference (GECCO) 2006: 75-82
- Spacetrack: Trading off Quality and Utilization in Oversubscribed Schedules. International Conference on Automated Planning and Scheduling (ICAPS) 2006: 430-433