Author of the publication

More effective randomized search heuristics for graph coloring through dynamic optimization.

, , , and . GECCO, page 1277-1285. ACM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Do additional target points speed up evolutionary algorithms?, and . Theor. Comput. Sci., (March 2023)Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm., , and . Algorithmica, 84 (6): 1603-1658 (2022)The Complex Parameter Landscape of the Compact Genetic Algorithm., , and . Algorithmica, 83 (4): 1096-1137 (2021)Fast Perturbative Algorithm Configurators., , and . PPSN (1), volume 12269 of Lecture Notes in Computer Science, page 19-32. Springer, (2020)Measuring and Maintaining Population Diversity in Search-Based Unit Test Generation., , and . SSBSE, volume 12420 of Lecture Notes in Computer Science, page 153-168. Springer, (2020)A Proof That Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation., , , and . AAAI, page 12390-12398. AAAI Press, (2023)Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter., and . GECCO, page 1151-1159. ACM, (2021)A tight lower bound on the expected runtime of standard steady state genetic algorithms., , and . GECCO, page 1323-1331. ACM, (2020)Parallel Black-Box Complexity With Tail Bounds., and . IEEE Trans. Evol. Comput., 24 (6): 1010-1024 (2020)On the impact of the performance metric on efficient algorithm configuration., , and . Artif. Intell., (2022)