Dr. Andrew M. Sutton

Assistant Professor
Department of Computer Science
University of Minnesota Duluth
311 Heller Hall
1114 Kirby Drive
Duluth, MN 55812
Email: amsutton [at] d.umn.edu
Telephone: +1 218.726.7978

Research
My research interests include: theory of randomized search heuristics,
theory of evolutionary computation, parameterized complexity,
randomized algorithms, graph theory.
Activities
I am an Assistant Professor (since August 2017) in the Department of Computer Science at the University of Minnesota Duluth.
I am an international partner of the European Union COST Action CA15140  Improving Applicability of NatureInspired Optimisation by Joining Theory and Practice
I am guest editing together with Pietro Oliveto a Special Issue of the Theoretical Computer Science Journal (Elsevier) on the Theory of Bioinspired Computation.
Publicity Chair of ACM GECCO 2019 in Prague and GECCO 2018 in Kyoto.
Proceedings Chair of ACM GECCO 2016 in Denver, CO.
I was previously affiliated with the Algorithm Engineering Group at the Hasso Plattner Institute in Potsdam, Germany. My research there was supported by the SAGE Project, funded by the European Commission FP7 ICT FET Open Scheme. I have also held postdoctoral appointments in the Chair of Theoretical Computer Science Ⅰ at FriedrichSchillerUniversität in Jena, Germany and in the School of Computer Science at the University of Adelaide in Adelaide, South Australia.
Teaching
Publications
Editorial Work
 P. S. Oliveto and A. M. Sutton. Special Issue on Theory of Bioinspired Computation, Theoretical Computer Science, Elsevier, (forthcoming).
 T. Friedrich, F. Neumann, A. M. Sutton. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) 2016, ACM Press, 1174 pages.
[link]

T. Friedrich, F. Neumann, A. M. Sutton. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) 2016, Companion, ACM Press, 1482 pages.
 P. S. Oliveto and A. M. Sutton. Special Issue on Theory of Evolutionary Algorithms 2014, Evolutionary Computation 23:4 (2015) MIT Press.
[link]
Journal Articles
 D.C. Dang, T. Friedrich, T. Kötzing, M. S. Krejca, P. K. Lehre, P. S. Oliveto, D. Sudholt, and A. M. Sutton. Escaping Local Optima Using Crossover with Emergent Diversity. IEEE Transactions on Evolutionary Computation, 22:3 (2018) pp. 484497.
[link]
[arXiv]
 T. Friedrich, T. Kötzing, M. S. Krejca, and A. M. Sutton. The Compact Genetic Algorithm is Efficient under Extreme Gaussian Noise. IEEE Transactions in Evolutionary Computation, 21:3 (2017), pp. 477490. [link]
 B. Doerr, F. Neumann, and A. M. Sutton. Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable kCNF Formulas. Algorithmica, 78:2 (2017), pp. 561586. [link]
 A. M. Sutton. Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems, Algorithmica, 75:3 (2016), pp. 507528. [link]
 T. Paixão, G. Badkobeh, N. H. Barton, D. Çörüş, D.C. Dang, T. Friedrich, P. K. Lehre, D. Sudholt, A. M. Sutton, B. Trubenová. Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology 383 (2015), pp. 2843. [link]
 A. Q. Nguyen, A. M. Sutton, and F. Neumann. Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theoretical Computer Science 561 (2015), pp. 2436. [link]
 F. Chicano, A. M. Sutton, L. D. Whitley, and E. Alba. Fitness Probability Distribution of BitFlip Mutation. Evolutionary Computation 23:2 (2015), pp. 217248. [link]
 A. M. Sutton, F. Neumann, and S. Nallaperuma. Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem, Evolutionary Computation 22:4 (2014), pp. 595628.
[link]
 T. Kötzing, A. M. Sutton, F. Neumann, and
U.M. O'Reilly. The Max Problem Revisited: The Importance of
Mutation in Genetic Programming, Theoretical Computer Science 545 (2014), pp. 94107.
[link]
 A. M. Sutton, F. Chicano, and L. D. Whitley, Fitness Function
Distributions over Generalized Search Neighborhoods in the qary
Hypercube, Evolutionary Computation 21:4 (2013), pp. 561590.
[link]
 A. M. Sutton, L. D. Whitley, and A. E. Howe, Computing the
moments of kbounded pseudoBoolean functions over Hamming spheres of
arbitrary radius in polynomial time, Theoretical Computer Science
425 (2012), pp. 5874.
[link]
Refereed Conference Proceedings

F. Neumann and A. M. Sutton. Runtime Analysis of the (1+1) Evolutionary Algorithm for the ChanceConstrained Knapsack Problem. In Proceedings of the 15th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGAXV), Potsdam, Germany, August 2019. [To appear]

A. M. Sutton and Carsten Witt. Lower Bounds on the Runtime of CrossoverBased Algorithms via Decoupling and Family Graphs. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO19), Prague, Czech Republic, July 2019. [To appear]

B. Doerr and A. M. Sutton. When Resampling to Cope With Noise, Use Median, Not Mean. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO19), Prague, Czech Republic, July 2019. [To appear]

F. Neumann and A. M. Sutton. Evolving Solutions to CommunityStructured Satisfiability Formulas. In Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence (AAAI19), Honolulu, HI, USA, January 2019. [To appear]

A. M. Sutton. Crossover Can Simulate Bounded Tree Search on a FixedParameter Tractable Optimization Problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO18), Kyoto, Japan, July 2018.
[link]

V. Hasenöhrl and A. M. Sutton. On the Runtime Dynamics of the Compact Genetic Algorithm on Jump Functions. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO18), Kyoto, Japan, July 2018.
[link]

T. Friedrich, T. Kötzing, F. Quinzan and A. M. Sutton. Improving the Run Time of the (1+1) Evolutionary Algorithm with Luby Sequences. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO18), Kyoto, Japan, July 2018.
[link]

F. Neumann and A. M. Sutton. Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights. Proceedings of the Fifteenth International Conference on Parallel Problem Solving from Nature (PPSN XV), Coimbra, Portugal, September, 2018.
[link]
 T. Friedrich, A. Krohmer, R. Rothenberger, T. Sauerwald, A. M. Sutton. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. European Symposium on Algorithms (ESA 2017)
[link]
 T. Friedrich, A. Krohmer, R. Rothenberger, A. M. Sutton. Phase Transitions for ScaleFree SAT Formulas. In Proceedings of the ThirtyFirst AAAI Conference on Artificial Intelligence (AAAI 2017), San Francisco, CA, USA, February 2017.
[link]
 T. Friedrich, T. Kötzing, F. Quinzan, and A. M. Sutton. Resampling vs Recombination: a Statistical Run Time Estimation. In Proceedings of the Fourteenth ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA), Copenhagen, Denmark, January 2017.
[link]
 T. Friedrich, T. Kötzing, and A. M. Sutton. On the Robustness of Evolving Populations. In Proceedings of the 14th International Conference on Parallel Problem Solving from Nature (PPSN2016), Edinburgh, Scotland, September 2016. [link]
 T. Friedrich, T. Kötzing, M. S. Krejca, and A. M. Sutton. Graceful Scaling on Uniform versus SteepTailed Noise. In Proceedings of the 14th International Conference on Parallel Problem Solving from Nature (PPSN2016), Edinburgh, Scotland, September 2016. [link]
 D.C. Dang, T. Friedrich, T. Kötzing, M. S. Krejca, P. K. Lehre, P. S. Oliveto, D. Sudholt, and A. M. Sutton. Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. In Proceedings of the 14th International Conference on Parallel Problem Solving from Nature (PPSN2016), Edinburgh, Scotland, September 2016. [link]
 D.C. Dang, T. Friedrich, T. Kötzing, M. S. Krejca, P. K. Lehre, P. S. Oliveto, D. Sudholt, and A. M. Sutton. Escaping Local Optima with Diversity Mechanisms and Crossover. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO16), Denver, CO, USA, July 2016. [link]
 T. Friedrich, T. Kötzing, M. S. Krejca, and A. M. Sutton. The Benefit of Recombination in Noisy Evolutionary Search. In Proceedings of the TwentySixth International Symposium on Algorithms and Computation (ISAAC 2015), Nagoya, Japan, December 2015. [link]
 B. Doerr, F. Neumann, and A. M. Sutton. Improved Runtime Bounds for the (1+1) EA on Random 3CNF Formulas Based on FitnessDistance Correlation. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO15), Madrid, Spain, July 2015. [link]
[Best Paper Award  Theory Track]
 T. Friedrich, T. Kötzing, M. S. Krejca, and A. M. Sutton. Robustness of ACO against Gaussian Noise, In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO15), Madrid, Spain, July 2015. [link]
[Best Paper Award  ACO/SI Track]
 A. M. Sutton. Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems, In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO14), Vancouver, Canada, July 2014. [link]
 F. Chicano, D. Whitley, and A. M. Sutton. Efficient Identification of Improving Moves in a Ball for PseudoBoolean Problems, In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO14), Vancouver, Canada, July 2014.[link]
 A. M. Sutton and F. Neumann. Runtime Analysis of Evolutionary Algorithms on Randomly Constructed HighDensity Satisfiable 3CNF Formulas, In Proceedings of the Thirteenth International Conference on Parallel Problem Solving from Nature (PPSN XIII), Ljubljana, Slovenia, September 2014. Published in Lecture Notes in Computer Science Vol. 8672, (2014) pp. 942951. [link]
 A. Q. Nguyen, A. M. Sutton, and F. Neumann. Population Size
Matters: Rigorous Runtime Results for Maximizing the Hypervolume
Indicator, In Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO13), Amsterdam, The Netherlands, July 2013.
[link]
 S. Nallaperuma, A. M. Sutton, and F. Neumann. Fixedparameter
evolutionary algorithms for the Euclidean traveling salesperson
problem, In Proceedings of the IEEE Congress on Evolutionary
Computation (CEC 2013), Cancún, México, June 2013.
[link]
 S. Nallaperuma, A. M. Sutton, and F. Neumann. Parameterized
complexity analysis and more effective construction methods for ACO
algorithms and the Euclidean traveling salesperson problem, In
Proceedings of the IEEE Congress on Evolutionary Computation (CEC
2013), Cancún, México, June 2013.
[link]
 A. M. Sutton and F. Neumann. A Parameterized Runtime Analysis
of Simple Evolutionary Algorithms for Makespan Scheduling, In
Proceedings of the Twelfth International Conference on Parallel
Problem Solving from Nature (PPSN XII), Taormina, Italy, September
2012. Published in Lecture
Notes in Computer Science Vol. 7491, (2012) pp. 5261.
[link]
 A. M. Sutton and F. Neumann. A Parameterized Runtime Analysis
of Evolutionary Algorithms for the Euclidean Traveling Salesperson
Problem, In Proceedings of the TwentySixth Conference on
Artificial Intelligence (AAAI12), Toronto, ON, Canada, July 2012.
[CoRR abs/1207.0578]
 A. M. Sutton, J. Day, and F. Neumann. A Parameterized Runtime
Analysis of Evolutionary Algorithms for MAX2SAT, In Proceedings
of the Genetic and Evolutionary Computation Conference (GECCO12),
Philadelphia, PA, July 2012.
[link]
 T. Kötzing, A. M. Sutton, F. Neumann, and
U.M. O'Reilly. The Max Problem Revisited: The Importance of
Mutation in Genetic Programming, In Proceedings of the Genetic and
Evolutionary Computation Conference (GECCO12), Philadelphia, PA, July
2012.
[link]
 A. M. Sutton, L. D. Whitley, and A. E. Howe. Mutation Rates of
the (1+1)EA on PseudoBoolean Functions of Bounded Epistasis, In
Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO11), Dublin, Ireland, July 2011.
[link]
 A. M. Sutton, L. D. Whitley, and A. E. Howe. Approximating the
Distribution of Fitness over Hamming Regions, In Proceedings of
the Foundations of Genetic Algorithms (FOGA XI), Schwarzenberg,
Austria, January 2011.
[link]
 A. M. Sutton, A. E. Howe, and L. D. Whitley. Directed Plateau
Search for MAXkSAT, In Proceedings of the Third Annual Symposium
on Combinatorial Search, Atlanta, GA, July 2010.
[link]
 A. M. Sutton, A. E. Howe, and L. D. Whitley. A Theoretical
Analysis of the kSatisfiability Search Space, In Proceedings of
SLS 2009, Brussels, Belgium, September 2009. Published in Lecture
Notes in Computer Science Vol. 5752, (2009) pp. 4660.
[link]
[Second runnerup for Best Paper Award]

A. M. Sutton, A. E. Howe, and L. D. Whitley. Estimating Bounds on
Expected Plateau Size in MAXSAT Problems, In Proceedings of
SLS 2009, Brussels, Belgium, September 2009. Published in Lecture
Notes in Computer Science Vol. 5752, (2009) pp. 3145.
[link]
 A. M. Sutton, L. D. Whitley, and A. E. Howe. A Polynomial Time
Computation of the Exact Correlation Structure of kSatisfiability
Landscapes, In Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO09), Montreal, Canada, July 2009.
[link]
[slides]
 L. D. Whitley and A. M. Sutton. Partial Neighborhoods of
Elementary Landscapes, In Proceedings of the Genetic and Evolutionary Computation
Conference (GECCO09), Montreal, Canada, July 2009.
[link]
 M. Lunacek, D. Whitley, and A. Sutton. The Impact of Global
Structure on Search, In Proceedings of the 10th Conference on
Parallel Problem Solving from Nature (PPSN08), Dortmund, Germany,
September 2008.
[link]
[Awarded Best Student Paper]
 L. D. Whitley, A. M. Sutton, and A. E. Howe. Understanding
Elementary Landscapes, In Proceedings of the Genetic and Evolutionary Computation
Conference (GECCO08), Atlanta, GA.
[link]
 A. M. Sutton, A. E. Howe, and L. D. Whitley. Using Adaptive
Priority Weighting to Direct Search in Probabilistic Scheduling,
In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS07),
Providence, RI.
[link]
 A. M. Sutton, M. Lunacek, and L. D. Whitley. Differential
Evolution and Nonseparability: Using selective pressure to focus
search, In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO07),
London, England.
[link]
 J. Smith, L. D. Briceno, A. A. Maciejewski, H. J. Siegel,
D. Janovy, T. Renner, J. Ladd, A. Sutton, S. Govindasamy, A. Alqudah,
R. Dewri, P. Prakash, V. Shestak. Measuring the Robustness of
Resource Allocations in a Stochastic Dynamic Environment, In Proceedings of the
International Parallel and Distributed Processing Symposium (IPDPS
2007), Long Beach, CA.
[link]
 A. M. Sutton, L. D. Whitley, M. Lunacek, and A. Howe. PSO and
Multifunnel Landscapes: How cooperation might limit exploration,
In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO06), Seattle, WA.
[link]
[Nominated for Best Paper]
 A. M. Sutton, A. Howe, and L. D. Whitley, Spacetrack:
Tradingoff Quality and Utilization in Oversubscribed Schedules,
In Proceedings of the International Conference on Automated Planning and Scheduling
(ICAPS06, short paper), English Lake District, UK.
[link]
Miscellaneous
Tutorials
 Parameterized complexity analysis of evolutionary algorithms tutorial at GECCO 2015 (with Frank Neumann). [link]
 Parameterized complexity analysis of evolutionary algorithms tutorial at GECCO 2014 (with Frank Neumann). [link]
 Elementary Landscapes: Theory and Applications tutorial at
GECCO 2013 (with Darrell Whitley).
[link]
 Elementary Landscapes: Theory and Applications tutorial at
GECCO 2012 (with Darrell Whitley).
[link]
 Elementary Landscape Analysis for TSP, Graph Coloring, Graph
Partitioning, and MAXSAT tutorial at GECCO 2009 (with Darrell
Whitley).
[link]