Doğan Çörüş

579 total citations
14 papers, 274 citations indexed

About

Doğan Çörüş is a scholar working on Artificial Intelligence, Biomedical Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Doğan Çörüş has authored 14 papers receiving a total of 274 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 5 papers in Biomedical Engineering and 4 papers in Computational Theory and Mathematics. Recurrent topics in Doğan Çörüş's work include Metaheuristic Optimization Algorithms Research (10 papers), Evolutionary Algorithms and Applications (6 papers) and Artificial Immune Systems Applications (5 papers). Doğan Çörüş is often cited by papers focused on Metaheuristic Optimization Algorithms Research (10 papers), Evolutionary Algorithms and Applications (6 papers) and Artificial Immune Systems Applications (5 papers). Doğan Çörüş collaborates with scholars based in United Kingdom, Türkiye and Australia. Doğan Çörüş's co-authors include Pietro S. Oliveto, Per Kristian Lehre, Duc-Cuong Dang, Anton V. Eremeev, D. Yazdani, Frank Neumann, Dirk Sudholt, Thomas Jansen, Christine Zarges and Jun He and has published in prestigious journals such as Journal of Theoretical Biology, Artificial Intelligence and IEEE Transactions on Evolutionary Computation.

In The Last Decade

Doğan Çörüş

14 papers receiving 272 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Doğan Çörüş United Kingdom 9 178 113 27 27 26 14 274
Christine Zarges United Kingdom 14 308 1.7× 188 1.7× 9 0.3× 38 1.4× 29 1.1× 37 427
Andrei Lissovoi United Kingdom 9 219 1.2× 139 1.2× 5 0.2× 41 1.5× 9 0.3× 22 269
Jan Mulawka Poland 9 178 1.0× 106 0.9× 45 1.7× 19 0.7× 10 0.4× 41 366
Adel Torkaman Rahmani Iran 8 127 0.7× 38 0.3× 19 0.7× 13 0.5× 8 0.3× 38 245
Qilong Feng China 11 44 0.2× 137 1.2× 33 1.2× 33 1.2× 16 0.6× 56 357
S. Gustafson United Kingdom 6 238 1.3× 52 0.5× 18 0.7× 20 0.7× 28 1.1× 8 303
C.-Y. Kao Taiwan 7 104 0.6× 65 0.6× 10 0.4× 71 2.6× 10 0.4× 8 284
Jan Paredis Netherlands 6 313 1.8× 101 0.9× 11 0.4× 33 1.2× 36 1.4× 16 386
Ikuo Yoshihara Japan 8 84 0.5× 30 0.3× 66 2.4× 26 1.0× 7 0.3× 67 221
Steven Gustafson United States 10 386 2.2× 90 0.8× 10 0.4× 38 1.4× 29 1.1× 20 473

Countries citing papers authored by Doğan Çörüş

Since Specialization
Citations

This map shows the geographic impact of Doğan Çörüş's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Doğan Çörüş with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Doğan Çörüş more than expected).

Fields of papers citing papers by Doğan Çörüş

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Doğan Çörüş. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Doğan Çörüş. The network helps show where Doğan Çörüş may publish in the future.

Co-authorship network of co-authors of Doğan Çörüş

This figure shows the co-authorship network connecting the top 25 collaborators of Doğan Çörüş. A scholar is included among the top collaborators of Doğan Çörüş based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Doğan Çörüş. Doğan Çörüş is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

14 of 14 papers shown
1.
Çörüş, Doğan & Pietro S. Oliveto. (2025). On the Generalisation Performance of Geometric Semantic Genetic Programming for Boolean Functions: Learning Block Mutations. Proceedings of the Genetic and Evolutionary Computation Conference Companion. 87–88. 1 indexed citations
2.
Çörüş, Doğan & Pietro S. Oliveto. (2024). On the Generalisation Performance of Geometric Semantic Genetic Programming for Boolean Functions: Learning Block Mutations. 4(4). 1–33. 1 indexed citations
3.
Çörüş, Doğan, Pietro S. Oliveto, & D. Yazdani. (2021). Fast Immune System-Inspired Hypermutation Operators for Combinatorial Optimization. IEEE Transactions on Evolutionary Computation. 25(5). 956–970. 11 indexed citations
4.
Çörüş, Doğan, Pietro S. Oliveto, & D. Yazdani. (2021). Automatic adaptation of hypermutation rates for multimodal optimisation. Aberystwyth Research portal (Aberystwyth University). 1–12. 8 indexed citations
5.
Çörüş, Doğan, Pietro S. Oliveto, & D. Yazdani. (2019). Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem. Artificial Intelligence. 274. 180–196. 19 indexed citations
6.
Çörüş, Doğan & Pietro S. Oliveto. (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. 11–12. 5 indexed citations
7.
Çörüş, Doğan, Duc-Cuong Dang, Anton V. Eremeev, & Per Kristian Lehre. (2017). Level-Based Analysis of Genetic Algorithms and Other Search Processes. IEEE Transactions on Evolutionary Computation. 22(5). 707–719. 80 indexed citations
8.
Çörüş, Doğan & Pietro S. Oliveto. (2017). Standard Steady State Genetic Algorithms Can Hillclimb Faster Than Mutation-Only Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation. 22(5). 720–732. 78 indexed citations
9.
Çörüş, Doğan, Pietro S. Oliveto, & D. Yazdani. (2017). On the runtime analysis of the opt-IA artificial immune system. Proceedings of the Genetic and Evolutionary Computation Conference. 83–90. 17 indexed citations
10.
Çörüş, Doğan, Jun He, Thomas Jansen, et al.. (2016). On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation. Algorithmica. 78(2). 714–740. 12 indexed citations
11.
Paixão, Tiago, Nick Barton, Doğan Çörüş, et al.. (2015). Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology. 383. 28–43. 20 indexed citations
12.
Çörüş, Doğan, Jun He, Thomas Jansen, et al.. (2015). On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations. University of Birmingham Research Portal (University of Birmingham). 1399–1406. 3 indexed citations
13.
Çörüş, Doğan, et al.. (2015). A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms. Evolutionary Computation. 24(1). 183–203. 12 indexed citations
14.
Çörüş, Doğan, Per Kristian Lehre, & Frank Neumann. (2013). The generalized minimum spanning tree problem. Adelaide Research & Scholarship (AR&S) (University of Adelaide). 519–526. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026