Multi-threading a state-of-the-art maximum clique algorithm C McCreesh, P Prosser Algorithms 6 (4), 618-635, 2013 | 48 | 2013 |

The shape of the search tree for the maximum clique problem and the implications for parallel branch and bound C McCreesh, P Prosser ACM Transactions on Parallel Computing (TOPC) 2 (1), 1-27, 2015 | 45 | 2015 |

A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs C McCreesh, P Prosser International conference on principles and practice of constraint …, 2015 | 38 | 2015 |

Portfolios of subgraph isomorphism algorithms L Kotthoff, C McCreesh, C Solnon International Conference on Learning and Intelligent Optimization, 107-122, 2016 | 31 | 2016 |

Clique and constraint models for maximum common (connected) subgraph problems C McCreesh, SN Ndiaye, P Prosser, C Solnon International Conference on Principles and Practice of Constraint …, 2016 | 25 | 2016 |

Replicable parallel branch and bound search B Archibald, P Maier, C McCreesh, R Stewart, P Trinder Journal of Parallel and Distributed Computing 113, 92-114, 2018 | 19 | 2018 |

Between subgraph isomorphism and maximum common subgraph R Hoffmann, C McCreesh, C Reilly Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 19 | 2017 |

When subgraph isomorphism is really hard, and why this matters for graph databases C McCreesh, P Prosser, C Solnon, J Trimble Journal of Artificial Intelligence Research 61, 723-759, 2018 | 16 | 2018 |

A partitioning algorithm for maximum common subgraph problems C McCreesh, P Prosser, J Trimble | 15 | 2017 |

Sequential and parallel solution-biased search for subgraph algorithms B Archibald, F Dunlop, R Hoffmann, C McCreesh, P Prosser, J Trimble International Conference on Integration of Constraint Programming …, 2019 | 14 | 2019 |

On maximum weight clique algorithms, and how they are evaluated C McCreesh, P Prosser, K Simpson, J Trimble International Conference on Principles and Practice of Constraint …, 2017 | 13 | 2017 |

A review of literature on parallel constraint solving IP Gent, I Miguel, P Nightingale, C McCreesh, P Prosser, NCA Moore, ... Theory and Practice of Logic Programming 18 (5-6), 725-758, 2018 | 12 | 2018 |

Reducing the branching in a branch and bound algorithm for the maximum clique problem C McCreesh, P Prosser International Conference on Principles and Practice of Constraint …, 2014 | 11 | 2014 |

Solving hard subgraph problems in parallel C McCreesh University of Glasgow, 2017 | 10 | 2017 |

An exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem C McCreesh, P Prosser International Conference on AI and OR Techniques in Constriant Programming …, 2014 | 10 | 2014 |

A parallel branch and bound algorithm for the maximum labelled clique problem C McCreesh, P Prosser Optimization Letters 9 (5), 949-960, 2015 | 9 | 2015 |

Justifying all differences using pseudo-boolean reasoning J Elffers, S Gocht, C McCreesh Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1486-1494, 2020 | 8 | 2020 |

Solving the task variant allocation problem in distributed robotics J Cano, DR White, A Bordallo, C McCreesh, AL Michala, J Singer, ... Autonomous robots 42 (7), 1477-1495, 2018 | 8 | 2018 |

Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. C McCreesh, P Prosser, J Trimble IJCAI, 631-638, 2016 | 8 | 2016 |

Task variant allocation in distributed robotics J Cano, DR White, A Bordallo, C McCreesh, P Prosser, J Singer, ... Robotics Science and Systems 2016, 2016 | 7 | 2016 |