Dynamic local search for the maximum clique problem W Pullan, HH Hoos Journal of Artificial Intelligence Research 25, 159-185, 2006 | 216 | 2006 |
Approximating the maximum vertex/edge weighted clique using local search W Pullan Journal of Heuristics 14, 117-134, 2008 | 115 | 2008 |
Simple ingredients leading to very efficient heuristics for the maximum clique problem A Grosso, M Locatelli, W Pullan Journal of Heuristics 14, 587-612, 2008 | 106 | 2008 |
Phased local search for the maximum clique problem W Pullan Journal of Combinatorial Optimization 12, 303-323, 2006 | 93 | 2006 |
Cooperating local search for the maximum clique problem W Pullan, F Mascia, M Brunato Journal of Heuristics 17, 181-199, 2011 | 71 | 2011 |
Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers W Pullan Discrete Optimization 6 (2), 214-219, 2009 | 61 | 2009 |
Structure prediction of benzene clusters using a genetic algorithm WJ Pullan Journal of Chemical Information and Computer Sciences 37 (6), 1189-1193, 1997 | 56 | 1997 |
Energy minimization of mixed argon–xenon microclusters using a genetic algorithm WJ Pullan Journal of Computational Chemistry 18 (8), 1096-1111, 1997 | 54 | 1997 |
Adapting the genetic algorithm to the travelling salesman problem W Pullan The 2003 Congress on Evolutionary Computation, 2003. CEC'03. 2, 1029-1035, 2003 | 50 | 2003 |
Heuristic identification of critical nodes in sparse real-world graphs W Pullan Journal of Heuristics 21, 577-598, 2015 | 47 | 2015 |
Genetic operators for the atomic cluster problem WJ Pullan Computer Physics Communications 107 (1-3), 137-148, 1997 | 42 | 1997 |
A Memetic Genetic Algorithm for the Vertex p-center Problem W Pullan Evolutionary computation 16 (3), 417-436, 2008 | 41 | 2008 |
An unbiased population‐based search for the geometry optimization of Lennard–Jones clusters: 2≤ N≤ 372 W Pullan Journal of computational chemistry 26 (9), 899-906, 2005 | 40 | 2005 |
Large expert-curated database for benchmarking document similarity detection in biomedical literature search P Brown, AC Tan, MA El-Esawi, T Liehr, O Blanck, DP Gladue, ... Database 2019, 2019 | 33 | 2019 |
Fast and accurate non-sequential protein structure alignment using a new asymmetric linear sum assignment heuristic P Brown, W Pullan, Y Yang, Y Zhou Bioinformatics 32 (3), 370-377, 2016 | 27 | 2016 |
A population based hybrid metaheuristic for the p-median problem W Pullan 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on …, 2008 | 20 | 2008 |
An integrated approach to teaching introductory programming W Pullan, S Drew, S Tucker 2013 second international conference on E-learning and E-technologies in …, 2013 | 17 | 2013 |
Matching stochastic algorithms to objective function landscapes WP Baritompa, M Dür, EMT Hendrix, L Noakes, WJ Pullan, GR Wood Journal of Global Optimization 31, 579-598, 2005 | 17 | 2005 |
Unbiased geometry optimisation of Morse atomic clusters W Pullan IEEE Congress on Evolutionary Computation, 1-7, 2010 | 12 | 2010 |
Protein structure alignment using maximum cliques and local search W Pullan Australasian Joint Conference on Artificial Intelligence, 776-780, 2007 | 12 | 2007 |