Dirk Sudholt - RankMe

205 papers A* 2A 73B 6Journal 90Unranked 28

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Royal Road Function for Permutation Spaces: an Example Where Order Crossover is Provably Essential. GECCO Andre Opris, Sebastian Sonntag, Dirk Sudholt
2025	J	`jnl`	Achieving Tight O(4 Algorithmica Andre Opris, Johannes Lengler, Dirk Sudholt
2025	A	`conf`	Analysing the Effectiveness of Mutation Operators for One-Sided Bipartite Crossing Minimisation. GECCO Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2025	J	`jnl`	Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. Algorithmica Joost Jorritsma, Johannes Lengler, Dirk Sudholt
2025	A	`conf`	Empirical Linkage Learning Provably Builds Truthful Models on Concatenated Traps and H-IFF. GECCO Marcus Schmidbauer, Dirk Sudholt
2025	J	`jnl`	The Compact Genetic Algorithm Struggles on Cliff Functions. Algorithmica Frank Neumann, Dirk Sudholt, Carsten Witt
2025	A*	`conf`	Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem. IJCAI Duc-Cuong Dang, Aneta Neumann, Frank Neumann, Andre Opris, Dirk Sudholt
2025	—	`conf`	Theory and Practice of Population Diversity in Evolutionary Computation. GECCO Companion Dirk Sudholt, Giovanni Squillero
2025	A	`conf`	Why Dominance Is Not Enough: Lessons from Practical Evolutionary Multi-Objective Algorithms. GECCO Duc-Cuong Dang, Andre Opris, Dirk Sudholt
2024	A	`conf`	A Tight GECCO Andre Opris, Johannes Lengler, Dirk Sudholt
2024	J	`jnl`	A Tight O(4 CoRR Andre Opris, Johannes Lengler, Dirk Sudholt
2024	J	`jnl`	Analysing Equilibrium States for Population Diversity. Algorithmica Johannes Lengler, Andre Opris, Dirk Sudholt
2024	J	`jnl`	Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation. Artif. Intell. Duc-Cuong Dang, Andre Opris, Dirk Sudholt
2024	A	`conf`	Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation (Poster Abstract). GD Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2024	J	`jnl`	Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation. CoRR Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2024	A	`conf`	Evolutionary Computation Meets Graph Drawing: Runtime Analysis for Crossing Minimisation on Layered Graph Drawings. GECCO Jakob Baumann, Ignaz Rutter, Dirk Sudholt
2024	A	`conf`	Guiding Quality Diversity on Monotone Submodular Functions: Customising the Feature Space by Adding Boolean Conjunctions. GECCO Marcus Schmidbauer, Andre Opris, Jakob Bossek, Frank Neumann, Dirk Sudholt
2024	—	`conf`	Hot of the Press: Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation. GECCO Companion Andre Opris, Duc-Cuong Dang, Dirk Sudholt
2024	A	`conf`	Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis. GECCO Duc-Cuong Dang, Andre Opris, Dirk Sudholt
2024	J	`jnl`	Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis. CoRR Duc-Cuong Dang, Andre Opris, Dirk Sudholt
2024	—	`conf`	Level-Based Theorems for Runtime Analysis of Multi-objective Evolutionary Algorithms. PPSN (3) Duc-Cuong Dang, Andre Opris, Dirk Sudholt
2024	—	`conf`	On the Equivalence Between Stochastic Tournament and Power-Law Ranking Selection and How to Implement Them Efficiently. PPSN (3) Duc-Cuong Dang, Andre Opris, Dirk Sudholt
2024	A	`conf`	Runtime Analyses of NSGA-III on Many-Objective Problems. GECCO Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt
2024	J	`jnl`	Runtime Analyses of NSGA-III on Many-Objective Problems. CoRR Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt
2024	J	`jnl`	Runtime Analysis of Quality Diversity Algorithms. Algorithmica Jakob Bossek, Dirk Sudholt
2024	J	`jnl`	Self-adjusting Population Sizes for Non-elitist Evolutionary Algorithms: Why Success Rates Matter. Algorithmica Mario Alejandro Hevia Fajardo, Dirk Sudholt
2024	J	`jnl`	Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. Artif. Intell. Mario Alejandro Hevia Fajardo, Dirk Sudholt
2024	J	`jnl`	Theoretical Analysis of Quality Diversity Algorithms for a Classical Path Planning Problem. CoRR Duc-Cuong Dang, Aneta Neumann, Frank Neumann, Andre Opris, Dirk Sudholt
2024	—	`conf`	Theory and Practice of Population Diversity in Evolutionary Computation. GECCO Companion Dirk Sudholt, Giovanni Squillero
2023	A*	`conf`	A Proof That Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation. AAAI Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt
2023	J	`jnl`	A Proof that Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation. CoRR Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt
2023	A	`conf`	Analysing Equilibrium States for Population Diversity. GECCO Johannes Lengler, Andre Opris, Dirk Sudholt
2023	J	`jnl`	Analysing Equilibrium States for Population Diversity. CoRR Johannes Lengler, Andre Opris, Dirk Sudholt
2023	A	`conf`	Analysing the Robustness of NSGA-II under Noise. GECCO Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt
2023	J	`jnl`	Analysing the Robustness of NSGA-II under Noise. CoRR Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt
2023	A	`conf`	Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. GECCO Joost Jorritsma, Johannes Lengler, Dirk Sudholt
2023	J	`jnl`	Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima. CoRR Joost Jorritsma, Johannes Lengler, Dirk Sudholt
2023	J	`jnl`	Do additional target points speed up evolutionary algorithms? Theor. Comput. Sci. Jakob Bossek, Dirk Sudholt
2023	A	`conf`	Runtime Analysis of Quality Diversity Algorithms. GECCO Jakob Bossek, Dirk Sudholt
2023	J	`jnl`	Runtime Analysis of Quality Diversity Algorithms. CoRR Jakob Bossek, Dirk Sudholt
2023	B	`conf`	The Cost of Randomness in Evolutionary Algorithms: Crossover can Save Random Bits. EvoCOP Carlo Kneissl, Dirk Sudholt
2023	—	`conf`	Theory and Practice of Population Diversity in Evolutionary Computation. GECCO Companion Dirk Sudholt, Giovanni Squillero
2022	—	`conf`	Evolutionary Algorithms for Cardinality-Constrained Ising Models. PPSN (2) Vijay Dhanjibhai Bhuva, Duc-Cuong Dang, Liam Huber, Dirk Sudholt
2022	J	`jnl`	Hard Problems are Easier for Success-based Parameter Control. CoRR Mario Alejandro Hevia Fajardo, Dirk Sudholt
2022	A	`conf`	Hard problems are easier for success-based parameter control. GECCO Mario Alejandro Hevia Fajardo, Dirk Sudholt
2022	J	`jnl`	On the impact of the performance metric on efficient algorithm configuration. Artif. Intell. George T. Hall, Pietro S. Oliveto, Dirk Sudholt
2022	J	`jnl`	Runtime Analysis of Restricted Tournament Selection for Bimodal Optimisation. CoRR Edgar Covantes Osuna, Dirk Sudholt
2022	J	`jnl`	Runtime Analysis of Restricted Tournament Selection for Bimodal Optimisation. Evol. Comput. Edgar Covantes Osuna, Dirk Sudholt
2022	J	`jnl`	The Compact Genetic Algorithm Struggles on Cliff Functions. CoRR Frank Neumann, Dirk Sudholt, Carsten Witt
2022	A	`conf`	The compact genetic algorithm struggles on Cliff functions. GECCO Frank Neumann, Dirk Sudholt, Carsten Witt
2022	J	`jnl`	Theoretical and Empirical Analysis of Parameter Control Mechanisms in the (1 + (λ, λ)) Genetic Algorithm. ACM Trans. Evol. Learn. Optim. Mario Alejandro Hevia Fajardo, Dirk Sudholt
2022	—	`conf`	Theory and practice of population diversity in evolutionary computation. GECCO Companion Dirk Sudholt, Giovanni Squillero
2022	J	`jnl`	Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm. Algorithmica Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2021	J	`jnl`	Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial. Algorithmica Dirk Sudholt
2021	A	`conf`	Do additional optima speed up evolutionary algorithms? FOGA Jakob Bossek, Dirk Sudholt
2021	J	`jnl`	Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates Matter. CoRR Mario Alejandro Hevia Fajardo, Dirk Sudholt
2021	A	`conf`	Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. FOGA Mario Alejandro Hevia Fajardo, Dirk Sudholt
2021	A	`conf`	Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. GECCO Mario Alejandro Hevia Fajardo, Dirk Sudholt
2021	J	`jnl`	The Complex Parameter Landscape of the Compact Genetic Algorithm. Algorithmica Johannes Lengler, Dirk Sudholt, Carsten Witt
2021	J	`jnl`	Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2021	J	`jnl`	Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. CoRR Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	A	`conf`	A tight lower bound on the expected runtime of standard steady state genetic algorithms. GECCO Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2020	J	`jnl`	Analysis of the Performance of Algorithm Configurators for Search Heuristics with Global Mutation Operators. CoRR George T. Hall, Pietro S. Oliveto, Dirk Sudholt
2020	A	`conf`	Analysis of the performance of algorithm configurators for search heuristics with global mutation operators. GECCO George T. Hall, Pietro S. Oliveto, Dirk Sudholt
2020	A	`conf`	Causes and effects of fitness landscapes in unit test generation. GECCO Nasser M. Albunian, Gordon Fraser, Dirk Sudholt
2020	J	`jnl`	Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation. Theor. Comput. Sci. Edgar Covantes Osuna, Wanru Gao, Frank Neumann, Dirk Sudholt
2020	A	`conf`	Do sophisticated evolutionary algorithms perform better than simple ones? GECCO Michael Foster, Matthew Hughes, George O. O'Brien, Pietro S. Oliveto, James Pyle, Dirk Sudholt, James Williams
2020	—	`conf`	Fast Perturbative Algorithm Configurators. PPSN (1) George T. Hall, Pietro S. Oliveto, Dirk Sudholt
2020	J	`jnl`	Fast Perturbative Algorithm Configurators. CoRR George T. Hall, Pietro Simone Oliveto, Dirk Sudholt
2020	B	`conf`	Measuring and Maintaining Population Diversity in Search-Based Unit Test Generation. SSBSE Nasser M. Albunian, Gordon Fraser, Dirk Sudholt
2020	J	`jnl`	Memetic algorithms outperform evolutionary algorithms in multimodal optimisation. Artif. Intell. Phan Trung Hai Nguyen, Dirk Sudholt
2020	J	`jnl`	More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization. CoRR Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	A	`conf`	More effective randomized search heuristics for graph coloring through dynamic optimization. GECCO Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2020	A	`conf`	On the choice of the parameter control mechanism in the (1+( GECCO Mario Alejandro Hevia Fajardo, Dirk Sudholt
2020	J	`jnl`	Parallel Black-Box Complexity With Tail Bounds. IEEE Trans. Evol. Comput. Per Kristian Lehre, Dirk Sudholt
2020	J	`jnl`	Runtime Analysis of Crowding Mechanisms for Multimodal Optimization. IEEE Trans. Evol. Comput. Edgar Covantes Osuna, Dirk Sudholt
2020	—	`ch.`	The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses. Theory of Evolutionary Computation Dirk Sudholt
2020	—	`conf`	Theory and practice of population diversity in evolutionary computation. GECCO Companion Dirk Sudholt, Giovanni Squillero
2019	J	`jnl`	On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements? Algorithmica Samadhi Nallaperuma, Pietro S. Oliveto, Jorge Pérez Heredia, Dirk Sudholt
2019	J	`jnl`	On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization. Algorithmica Dirk Sudholt, Carsten Witt
2019	J	`jnl`	On the Impact of the Cutoff Time on the Performance of Algorithm Configurators. CoRR George T. Hall, Pietro S. Oliveto, Dirk Sudholt
2019	J	`jnl`	On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism. Evol. Comput. Edgar Covantes Osuna, Dirk Sudholt
2019	J	`jnl`	On the benefits and risks of using fitness sharing for multimodal optimisation. Theor. Comput. Sci. Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
2019	A	`conf`	On the impact of the cutoff time on the performance of algorithm configurators. GECCO George T. Hall, Pietro S. Oliveto, Dirk Sudholt
2019	J	`jnl`	Parallel Black-Box Complexity with Tail Bounds. CoRR Per Kristian Lehre, Dirk Sudholt
2019	J	`jnl`	Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Algorithmica Carola Doerr, Dirk Sudholt
2019	A	`conf`	Runtime analysis of randomized search heuristics for dynamic graph coloring. GECCO Jakob Bossek, Frank Neumann, Pan Peng, Dirk Sudholt
2019	A	`conf`	Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem. FOGA Jakob Bossek, Dirk Sudholt
2018	J	`jnl`	Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial. CoRR Dirk Sudholt
2018	J	`jnl`	Design and Analysis of Diversity-Based Parent Selection Schemes for Speeding Up Evolutionary Multi-objective Optimisation. CoRR Edgar Covantes Osuna, Wanru Gao, Frank Neumann, Dirk Sudholt
2018	—	`conf`	Empirical Analysis of Diversity-Preserving Mechanisms on Example Landscapes for Multimodal Optimisation. PPSN (2) Edgar Covantes Osuna, Dirk Sudholt
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	J	`jnl`	How to Escape Local Optima in Black Box Optimisation: When Non-elitism Outperforms Elitism. Algorithmica Pietro S. Oliveto, Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová
2018	A	`conf`	Medium step sizes are harmful for the compact genetic algorithm. GECCO Johannes Lengler, Dirk Sudholt, Carsten Witt
2018	J	`jnl`	Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems. CoRR Phan Trung Hai Nguyen, Dirk Sudholt
2018	A	`conf`	Memetic algorithms beat evolutionary algorithms on the class of hurdle problems. GECCO Phan Trung Hai Nguyen, Dirk Sudholt
2018	J	`jnl`	On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism. CoRR Edgar Covantes Osuna, Dirk Sudholt
2018	A	`conf`	On the robustness of evolutionary algorithms to noise: refined results and an example where noise helps. GECCO Dirk Sudholt
2018	J	`jnl`	Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Algorithmica Timo Kötzing, Dirk Sudholt
2018	J	`jnl`	Runtime Analysis of Probabilistic Crowding and Restricted Tournament Selection for Bimodal Optimisation. CoRR Edgar Covantes Osuna, Dirk Sudholt
2018	A	`conf`	Runtime analysis of probabilistic crowding and restricted tournament selection for bimodal optimisation. GECCO Edgar Covantes Osuna, Dirk Sudholt
2018	J	`jnl`	The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses. CoRR Dirk Sudholt
2018	—	`conf`	Tutorials at PPSN 2018. PPSN (2) Gisele Lobo Pappa, Michael T. M. Emmerich, Ana L. C. Bazzan, Will N. Browne, Kalyanmoy Deb, Carola Doerr, Marko Durasevic, Michael G. Epitropakis, Saemundur O. Haraldsson, Domagoj Jakobovic, Pascal Kerschke, Krzysztof Krawiec, Per Kristian Lehre, Xiaodong Li, Andrei Lissovoi, Pekka Malo, Luis Martí, Yi Mei, Juan Julián Merelo Guervós, Julian F. Miller, Alberto Moraglio, Antonio J. Nebro, Su Nguyen, Gabriela Ochoa, Pietro S. Oliveto, Stjepan Picek, Nelishia Pillay, Mike Preuss, Marc Schoenauer, Roman Senkerik, Ankur Sinha, Ofer M. Shir, Dirk Sudholt, L. Darrell Whitley, Mark Wineberg, John R. Woodward, Mengjie Zhang
2017	A	`conf`	Analysis of the Clearing Diversity-Preserving Mechanism. FOGA Edgar Covantes Osuna, Dirk Sudholt
2017	J	`jnl`	Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem. Evol. Comput. Samadhi Nallaperuma, Frank Neumann, Dirk Sudholt
2017	J	`jnl`	How Crossover Speeds up Building Block Assembly in Genetic Algorithms. Evol. Comput. Dirk Sudholt
2017	J	`jnl`	On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
2017	J	`jnl`	Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search. Evol. Comput. Alberto Moraglio, Dirk Sudholt
2017	A	`ed.`	Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2017, Copenhagen, Denmark, January 12-15, 2017 FOGA Christian Igel, Dirk Sudholt, Carsten Witt
2017	A	`conf`	Speeding up evolutionary multi-objective optimisation through diversity-based parent selection. GECCO Edgar Covantes Osuna, Wanru Gao, Frank Neumann, Dirk Sudholt
2017	A	`conf`	Theoretical results on bet-and-run as an initialisation strategy. GECCO Andrei Lissovoi, Dirk Sudholt, Markus Wagner, Christine Zarges
2017	—	`conf`	Theory of swarm intelligence: tutorial at GECCO 2017. GECCO (Companion) Dirk Sudholt
2017	J	`jnl`	Towards a Runtime Comparison of Natural and Artificial Evolution. Algorithmica Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová
2017	A	`conf`	When is it beneficial to reject improvements? GECCO Samadhi Nallaperuma, Pietro S. Oliveto, Jorge Pérez Heredia, Dirk Sudholt
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	A	`conf`	Runtime Analysis for the Parameter-less Population Pyramid. GECCO Brian W. Goldman, Dirk Sudholt
2016	—	`conf`	Theory of Swarm Intelligence. GECCO (Companion) Dirk Sudholt
2016	A	`conf`	Tutorials at PPSN 2016. PPSN Carola Doerr, Nicolas Bredèche, Enrique Alba, Thomas Bartz-Beielstein, Dimo Brockhoff, Benjamin Doerr, Gusz Eiben, Michael G. Epitropakis, Carlos M. Fonseca, Andreia P. Guerreiro, Evert Haasdijk, Jacqueline Heinerman, Julien Hubert, Per Kristian Lehre, Luigi Malagò, Juan Julián Merelo Guervós, Julian Francis Miller, Boris Naujoks, Pietro S. Oliveto, Stjepan Picek, Nelishia Pillay, Mike Preuss, Patricia Ryser-Welch, Giovanni Squillero, Jörg Stork, Dirk Sudholt, Alberto Paolo Tonda, L. Darrell Whitley, Martin Zaefferer
2016	A	`conf`	Update Strength in EDAs and ACO: How to Avoid Genetic Drift. GECCO Dirk Sudholt, Carsten Witt
2016	J	`jnl`	Update Strength in EDAs and ACO: How to Avoid Genetic Drift. CoRR Dirk Sudholt, Carsten Witt
2016	A	`conf`	When Non-Elitism Outperforms Elitism for Crossing Fitness Valleys. GECCO Pietro S. Oliveto, Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová
2015	A	`conf`	Black-box Complexity of Parallel Search with Distributed Populations. FOGA Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt
2015	J	`jnl`	Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms. Evol. Comput. Andrea Mambrini, Dirk Sudholt
2015	J	`jnl`	Design and analysis of different alternating variable searches for search-based software testing. Theor. Comput. Sci. Joseph Kempka, Phil McMinn, Dirk Sudholt
2015	A	`conf`	First Steps Towards a Runtime Comparison of Natural and Artificial Evolution. GECCO Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová
2015	J	`jnl`	First Steps Towards a Runtime Comparison of Natural and Artificial Evolution. CoRR Tiago Paixão, Jorge Pérez Heredia, Dirk Sudholt, Barbora Trubenová
2015	A	`conf`	On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations. GECCO Dogan Corus, Jun He, Thomas Jansen, Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
2015	—	`ch.`	Parallel Evolutionary Algorithms. Handbook of Computational Intelligence Dirk Sudholt
2015	—	`conf`	Theory of Swarm Intelligence. GECCO (Companion) Dirk Sudholt
2014	A	`conf`	A fixed budget analysis of randomized search heuristics for the traveling salesperson problem. GECCO Samadhi Nallaperuma, Frank Neumann, Dirk Sudholt
2014	J	`jnl`	Analysis of speedups in parallel evolutionary algorithms and (1+λ) EAs for combinatorial optimization. Theor. Comput. Sci. Jörg Lässig, Dirk Sudholt
2014	A	`conf`	Design and analysis of adaptive migration intervals in parallel evolutionary algorithms. GECCO Andrea Mambrini, Dirk Sudholt
2014	J	`jnl`	General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms. Evol. Comput. Jörg Lässig, Dirk Sudholt
2014	J	`jnl`	How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms. CoRR Dirk Sudholt
2014	J	`jnl`	Improved Evolutionary Algorithm Design for the Project Scheduling Problem Based on Runtime Analysis. IEEE Trans. Software Eng. Leandro L. Minku, Dirk Sudholt, Xin Yao
2014	A	`conf`	On the Runtime Analysis of Fitness Sharing Mechanisms. PPSN Pietro S. Oliveto, Dirk Sudholt, Christine Zarges
2014	A	`conf`	On the runtime analysis of stochastic ageing mechanisms. GECCO Pietro S. Oliveto, Dirk Sudholt
2014	J	`jnl`	The choice of the offspring population size in the (1, λ) evolutionary algorithm. Theor. Comput. Sci. Jonathan E. Rowe, Dirk Sudholt
2014	—	`conf`	Theory of swarm intelligence. GECCO (Companion) Dirk Sudholt
2014	A	`conf`	Unbiased Black-Box Complexity of Parallel Search. PPSN Golnaz Badkobeh, Per Kristian Lehre, Dirk Sudholt
2013	J	`jnl`	A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms. IEEE Trans. Evol. Comput. Dirk Sudholt
2013	A	`conf`	A theoretical runtime and empirical analysis of different alternating variable searches for search-based testing. GECCO Joseph Kempka, Phil McMinn, Dirk Sudholt
2013	J	`jnl`	Design and analysis of migration in parallel evolutionary algorithms. Soft Comput. Jörg Lässig, Dirk Sudholt
2013	J	`jnl`	Mutation Rate Matters Even When Optimizing Monotonic Functions. Evol. Comput. Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2013	A	`conf`	When do evolutionary algorithms optimize separable functions in parallel? FOGA Benjamin Doerr, Dirk Sudholt, Carsten Witt
2012	J	`jnl`	A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems. Algorithmica Dirk Sudholt, Christian Thyssen
2012	A	`conf`	Crossover speeds up building-block assembly. GECCO Dirk Sudholt
2012	A	`conf`	Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design. GECCO Leandro L. Minku, Dirk Sudholt, Xin Yao
2012	J	`jnl`	General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms CoRR Jörg Lässig, Dirk Sudholt
2012	—	`conf`	Homogeneous and Heterogeneous Island Models for the Set Cover Problem. PPSN (1) Andrea Mambrini, Dirk Sudholt, Xin Yao
2012	—	`ch.`	Parametrization and Balancing Local and Global Search. Handbook of Memetic Algorithms Dirk Sudholt
2012	J	`jnl`	Running time analysis of Ant Colony Optimization for shortest path problems. J. Discrete Algorithms Dirk Sudholt, Christian Thyssen
2012	A	`conf`	Runtime analysis of convex evolutionary search. GECCO Alberto Moraglio, Dirk Sudholt
2012	A	`conf`	The choice of the offspring population size in the (1, λ) EA. GECCO Jonathan E. Rowe, Dirk Sudholt
2012	—	`conf`	Theory of swarm intelligence. GECCO (Companion) Dirk Sudholt
2011	J	`jnl`	A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms CoRR Dirk Sudholt
2011	J	`jnl`	Adaptive Population Models for Offspring Populations and Parallel Evolutionary Algorithms CoRR Jörg Lässig, Dirk Sudholt
2011	A	`conf`	Adaptive population models for offspring populations and parallel evolutionary algorithms. FOGA Jörg Lässig, Dirk Sudholt
2011	J	`jnl`	Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization CoRR Jörg Lässig, Dirk Sudholt
2011	B	`conf`	Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract). ISAAC Jörg Lässig, Dirk Sudholt
2011	A	`conf`	How crossover helps in pseudo-boolean optimization. GECCO Timo Kötzing, Dirk Sudholt, Madeleine Theile
2011	J	`jnl`	Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima. Algorithmica Dirk Sudholt
2011	J	`jnl`	Memetic Algorithms: Parametrization and Balancing Local and Global Search CoRR Dirk Sudholt
2011	—	`ch.`	Memetic Evolutionary Algorithms. Theory of Randomized Search Heuristics Dirk Sudholt
2011	A	`conf`	On the effectiveness of crossover for migration in parallel evolutionary algorithms. GECCO Frank Neumann, Pietro S. Oliveto, Günter Rudolph, Dirk Sudholt
2011	J	`jnl`	Runtime analysis of the 1-ANT ant colony optimizer. Theor. Comput. Sci. Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
2011	A	`conf`	Simple max-min ant systems and the optimization of linear pseudo-boolean functions. FOGA Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner
2011	—	`conf`	Theory of swarm intelligence. GECCO (Companion) Dirk Sudholt
2011	A	`conf`	Using markov-chain mixing time estimates for the analysis of ant colony optimization. FOGA Dirk Sudholt
2010	A	`conf`	A few ants are enough: ACO with iteration-best update. GECCO Frank Neumann, Dirk Sudholt, Carsten Witt
2010	J	`jnl`	A self-stabilizing algorithm for cut problems in synchronous networks. Theor. Comput. Sci. Thomas Sauerwald, Dirk Sudholt
2010	J	`jnl`	Analysis of an Asymmetric Mutation Operator. Evol. Comput. Thomas Jansen, Dirk Sudholt
2010	—	`conf`	Analysis of an Iterated Local Search Algorithm for Vertex Coloring. ISAAC (1) Dirk Sudholt, Christine Zarges
2010	A	`conf`	Ant colony optimization for stochastic shortest path problems. GECCO Christian Horoba, Dirk Sudholt
2010	—	`conf`	Experimental Supplements to the Theoretical Analysis of Migration in the Island Model. PPSN (1) Jörg Lässig, Dirk Sudholt
2010	—	`conf`	General Lower Bounds for the Running Time of Evolutionary Algorithms. PPSN (1) Dirk Sudholt
2010	—	`conf`	General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms. PPSN (1) Jörg Lässig, Dirk Sudholt
2010	J	`jnl`	Optimizing Monotone Functions Can Be Difficult CoRR Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2010	—	`conf`	Optimizing Monotone Functions Can Be Difficult. PPSN (1) Benjamin Doerr, Thomas Jansen, Dirk Sudholt, Carola Winzen, Christine Zarges
2010	J	`jnl`	Runtime analysis of a binary particle swarm optimizer. Theor. Comput. Sci. Dirk Sudholt, Carsten Witt
2010	J	`jnl`	Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions CoRR Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner
2010	A	`conf`	The benefit of migration in parallel evolutionary algorithms. GECCO Jörg Lässig, Dirk Sudholt
2009	J	`jnl`	Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evol. Comput. Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2009	J	`jnl`	Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intell. Frank Neumann, Dirk Sudholt, Carsten Witt
2009	—	`ch.`	Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search. Innovations in Swarm Intelligence Frank Neumann, Dirk Sudholt, Carsten Witt
2009	J	`jnl`	Ingo Wegener. Evol. Comput. Thomas Jansen, Melanie Schmidt, Dirk Sudholt, Carsten Witt, Christine Zarges
2009	—	`conf`	Running Time Analysis of ACO Systems for Shortest Path Problems. SLS Christian Horoba, Dirk Sudholt
2009	J	`jnl`	The impact of parametrization in memetic evolutionary algorithms. Theor. Comput. Sci. Dirk Sudholt
2008	—	`—`	Computational complexity of evolutionary algorithms, hybridizations, and swarm intelligence. Dirk Sudholt
2008	A	`conf`	Memetic algorithms with variable-depth search to overcome local optima. GECCO Dirk Sudholt
2008	—	`conf`	Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. ANTS Conference Frank Neumann, Dirk Sudholt, Carsten Witt
2008	—	`conf`	Runtime Analysis of Binary PSO. Theory of Evolutionary Algorithms Dirk Sudholt, Carsten Witt
2008	A	`conf`	Runtime analysis of binary PSO. GECCO Dirk Sudholt, Carsten Witt
2008	B	`conf`	Self-stabilizing Cuts in Synchronous Networks. SIROCCO Thomas Sauerwald, Dirk Sudholt
2008	A	`conf`	Theoretical analysis of diversity mechanisms for global exploration. GECCO Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2007	—	`conf`	Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. SLS Frank Neumann, Dirk Sudholt, Carsten Witt
2007	A	`conf`	On the runtime analysis of the 1-ANT ACO algorithm. GECCO Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt
2006	B	`conf`	Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency. ISAAC Dirk Sudholt
2006	A	`conf`	On the analysis of the (1+1) memetic algorithm. GECCO Dirk Sudholt
2005	A	`conf`	Crossover is provably essential for the ising model on trees. GECCO Dirk Sudholt
2005	B	`conf`	Design and analysis of an asymmetric mutation operator. Congress on Evolutionary Computation Thomas Jansen, Dirk Sudholt
2004	A	`conf`	Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
2004	A	`conf`	The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener