Dogan Corus
Orcid: 0000-0003-4151-2734
According to our database1,
Dogan Corus
authored at least 21 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
On the Generalisation Performance of Geometric Semantic Genetic Programming for Boolean Functions: Learning Block Mutations.
ACM Trans. Evol. Learn. Optim., December, 2024
2021
On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials Is Best.
ACM Trans. Evol. Learn. Optim., 2021
IEEE Trans. Evol. Comput., 2021
Proceedings of the FOGA '21: Foundations of Genetic Algorithms XVI, 2021
2020
When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms.
Theor. Comput. Sci., 2020
CoRR, 2020
On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms.
Algorithmica, 2020
2019
Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem.
Artif. Intell., 2019
Proceedings of the Genetic and Evolutionary Computation Conference, 2019
2018
Runtime analysis of evolutionary algorithms with complex fitness evaluation mechanisms.
PhD thesis, 2018
Standard Steady State Genetic Algorithms Can Hillclimb Faster Than Mutation-Only Evolutionary Algorithms.
IEEE Trans. Evol. Comput., 2018
IEEE Trans. Evol. Comput., 2018
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018
Artificial Immune Systems Can Find Arbitrarily Good Approximations for the NP-Hard Partition Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018
Standard steady state genetic algorithms can hillclimb faster than evolutionary algorithms using standard bit mutation.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018
2017
Algorithmica, 2017
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
2016
A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
Evol. Comput., 2016
2015
On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015
2014
A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
CoRR, 2014
2013
The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013