Ciaran McCreesh
Title
Cited by
Cited by
Year
Multi-threading a state-of-the-art maximum clique algorithm
C McCreesh, P Prosser
Algorithms 6 (4), 618-635, 2013
482013
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
452015
A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs
C McCreesh, P Prosser
International conference on principles and practice of constraint …, 2015
382015
Portfolios of subgraph isomorphism algorithms
L Kotthoff, C McCreesh, C Solnon
International Conference on Learning and Intelligent Optimization, 107-122, 2016
312016
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
252016
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
192018
Between subgraph isomorphism and maximum common subgraph
R Hoffmann, C McCreesh, C Reilly
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
192017
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
162018
A partitioning algorithm for maximum common subgraph problems
C McCreesh, P Prosser, J Trimble
152017
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
142019
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
132017
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
122018
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
112014
Solving hard subgraph problems in parallel
C McCreesh
University of Glasgow, 2017
102017
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
102014
A parallel branch and bound algorithm for the maximum labelled clique problem
C McCreesh, P Prosser
Optimization Letters 9 (5), 949-960, 2015
92015
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
82020
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
82018
Heuristics and Really Hard Instances for Subgraph Isomorphism Problems.
C McCreesh, P Prosser, J Trimble
IJCAI, 631-638, 2016
82016
Task variant allocation in distributed robotics
J Cano, DR White, A Bordallo, C McCreesh, P Prosser, J Singer, ...
Robotics Science and Systems 2016, 2016
72016
The system can't perform the operation now. Try again later.
Articles 1–20