Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
20001.6k citationsJoshua Knowles, David Corneprofile →
This map shows the geographic impact of David Corne'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 David Corne with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Corne more than expected).
This network shows the impact of papers produced by David Corne. 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 David Corne. The network helps show where David Corne may publish in the future.
Co-authorship network of co-authors of David Corne
This figure shows the co-authorship network connecting the top 25 collaborators of David Corne.
A scholar is included among the top collaborators of David Corne 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 David Corne. David Corne is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Corne, David, et al.. (2008). Feature selection strategies for poorly correlated data: correlation coefficient considered harmful. International Conference on Artificial Intelligence. 226–231.
5.
Soak, Sang-Moon, David Corne, & Byung-Ha Ahn. (2006). On a property analysis of representations for spanning tree problems. Scientific Programming. 107–118.1 indexed citations
6.
Rowe, William, David Corne, & Joshua Knowles. (2006). Developing Landscape State Machines for Improved Algorithm Performance Prediction.2 indexed citations
7.
Corne, David, et al.. (2005). Hybridising rule induction and multiobjective evolutionary search for optimizing water distribution systems.3 indexed citations
8.
Corne, David, et al.. (2004). Measuring Effectiveness of Text-Decorated HTML Tags in Web Document Clustering.. 707–714.1 indexed citations
9.
Corne, David, et al.. (2003). Evolving better stoplists for document clustering and web intelligence. 1015–1023.16 indexed citations
10.
Raidl, Günther R., Stefano Cagnoni, Juan Romero, et al.. (2003). Applications of Evolutionary Computing: Evoworkshops 2003. Springer eBooks.49 indexed citations
11.
Knowles, Joshua & David Corne. (2001). A Comparative Assessment of Memetic, Evolutionary, and Constructive Algorithms on Multiobjective $d$-MST Problems. Research Explorer (The University of Manchester). 162–167.4 indexed citations
Knowles, Joshua & David Corne. (2001). Benchmark problem generators and results for the multiobjective degree-constrained minimum spanning tree problem. Research Explorer (The University of Manchester). 424–431.7 indexed citations
14.
Knowles, Joshua & David Corne. (2000). Heuristics for evolutionary off-line routing in telecommunications networks. Research Explorer (The University of Manchester). 574–581.4 indexed citations
15.
Oates, Martin J., et al.. (2000). A tri-phase multimodal evolutionary search performance profile on the 'Hierarchical if and only if' problem.. Genetic and Evolutionary Computation Conference. 339–346.1 indexed citations
16.
Corne, David, Martin J. Oates, & George Davey Smith. (2000). Telecommunications Optimization: Heuristic and Adaptive Techniques. UEA Digital Repository (University of East Anglia).28 indexed citations
17.
Knowles, Joshua, David Corne, & Martin J. Oates. (1999). A new evolutionary approach to the degree constrained minimum spanning tree problem. Research Explorer (The University of Manchester). 794–794.2 indexed citations
18.
Tsutsui, Shigeyoshi, et al.. (1997). A Real Coded Genetic Algorithm with an Explorer and an Exploiter Populations.. 238–245.33 indexed citations
19.
Ross, Peter, et al.. (1995). A Study of Genetic Algorithm Hybrids for Facility Layout Problems. international conference on Genetic algorithms. 498–505.19 indexed citations
20.
Logan, Brian, David Corne, & Tim Smithers. (1992). The Edinburgh designer system: an architecture for solving ill structured problems. OpenGrey (Institut de l'Information Scientifique et Technique). 282–286.3 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.