| Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results PS Oliveto, J He, X Yao International Journal of Automation and Computing 4, 281-293, 2007 | 290 | 2007 |
| Simplified drift analysis for proving lower bounds in evolutionary computation PS Oliveto, C Witt Algorithmica 59, 369-386, 2011 | 188 | 2011 |
| Escaping local optima using crossover with emergent diversity DC Dang, T Friedrich, T Kötzing, MS Krejca, PK Lehre, PS Oliveto, ... IEEE Transactions on Evolutionary Computation 22 (3), 484-497, 2017 | 143 | 2017 |
| Analysis of diversity-preserving mechanisms for global exploration T Friedrich, PS Oliveto, D Sudholt, C Witt Evolutionary Computation 17 (4), 455-476, 2009 | 129 | 2009 |
| Improved time complexity analysis of the simple genetic algorithm PS Oliveto, C Witt Theoretical Computer Science 605, 21-41, 2015 | 126 | 2015 |
| Standard steady state genetic algorithms can hillclimb faster than mutation-only evolutionary algorithms D Corus, PS Oliveto IEEE Transactions on Evolutionary Computation 22 (5), 720-732, 2017 | 123 | 2017 |
| Analysis of the -EA for Finding Approximate Solutions to Vertex Cover Problems PS Oliveto, J He, X Yao IEEE Transactions on Evolutionary Computation 13 (5), 1006-1029, 2009 | 114 | 2009 |
| On the runtime analysis of the simple genetic algorithm PS Oliveto, C Witt Theoretical Computer Science 545, 2-19, 2014 | 78 | 2014 |
| Theoretical analysis of fitness-proportional selection: landscapes and efficiency F Neumann, PS Oliveto, C Witt Proceedings of the 11th Annual conference on Genetic and evolutionary …, 2009 | 77 | 2009 |
| On the convergence of immune algorithms V Cutello, G Nicosia, M Romeo, PS Oliveto 2007 IEEE Symposium on Foundations of Computational Intelligence, 409-415, 2007 | 77 | 2007 |
| Escaping local optima with diversity mechanisms and crossover DC Dang, T Friedrich, T Kötzing, MS Krejca, PK Lehre, PS Oliveto, ... Proceedings of the Genetic and Evolutionary Computation Conference 2016, 645-652, 2016 | 76 | 2016 |
| Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation PS Oliveto, C Witt arXiv preprint arXiv:1211.7184, 2012 | 65 | 2012 |
| Analysis of population-based evolutionary algorithms for the vertex cover problem PS Oliveto, J He, X Yao 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on …, 2008 | 61 | 2008 |
| On the runtime analysis of selection hyper-heuristics with adaptive learning periods B Doerr, A Lissovoi, PS Oliveto, JA Warwicker Proceedings of the Genetic and Evolutionary Computation Conference, 1015-1022, 2018 | 50 | 2018 |
| On the time complexity of algorithm selection hyper-heuristics for multimodal optimisation A Lissovoi, PS Oliveto, JA Warwicker Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2322-2329, 2019 | 48 | 2019 |
| Theoretical analysis of rank-based mutation-combining exploration and exploitation PS Oliveto, PK Lehre, F Neumann 2009 IEEE Congress on Evolutionary Computation, 1455-1462, 2009 | 47 | 2009 |
| Theoretical analysis of diversity mechanisms for global exploration T Friedrich, PS Oliveto, D Sudholt, C Witt Proceedings of the 10th annual conference on Genetic and Evolutionary …, 2008 | 47 | 2008 |
| Runtime analysis of evolutionary algorithms for discrete optimization PS Oliveto, X Yao Theory of Randomized Search Heuristics: Foundations and Recent Developments …, 2011 | 46 | 2011 |
| On the effectiveness of crossover for migration in parallel evolutionary algorithms F Neumann, PS Oliveto, G Rudolph, D Sudholt Proceedings of the 13th annual conference on Genetic and evolutionary …, 2011 | 45 | 2011 |
| How to escape local optima in black box optimisation: when non-elitism outperforms elitism PS Oliveto, T Paixăo, J Pérez Heredia, D Sudholt, B Trubenová Algorithmica 80, 1604-1633, 2018 | 41 | 2018 |
Dirk SudholtUniversity of Passau, GermanyVerified email at uni-passau.de
