Follow
Ciaran McCreesh
Title
Cited by
Cited by
Year
A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs
C McCreesh, P Prosser
International conference on principles and practice of constraint …, 2015
632015
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
562015
A partitioning algorithm for maximum common subgraph problems
C McCreesh, P Prosser, J Trimble
532017
Multi-threading a state-of-the-art maximum clique algorithm
C McCreesh, P Prosser
Algorithms 6 (4), 618-635, 2013
532013
The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
C McCreesh, P Prosser, J Trimble
International Conference on Graph Transformation, 316-324, 2020
472020
Portfolios of subgraph isomorphism algorithms
L Kotthoff, C McCreesh, C Solnon
International Conference on Learning and Intelligent Optimization, 107-122, 2016
472016
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
462018
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
432016
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
392019
Between subgraph isomorphism and maximum common subgraph
R Hoffmann, C McCreesh, C Reilly
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
372017
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
322020
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
322018
Subgraph isomorphism meets cutting planes: Solving with certified solutions
S Gocht, C McCreesh, J Nordström
Proceedings of the Twenty-Ninth International Conference on International …, 2021
312021
Certifying solvers for clique and maximum common (connected) subgraph problems
S Gocht, R McBride, C McCreesh, J Nordström, P Prosser, J Trimble
International Conference on Principles and Practice of Constraint …, 2020
292020
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
262018
Certified symmetry and dominance breaking for combinatorial optimisation
B Bogaerts, S Gocht, C McCreesh, J Nordström
Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3698-3707, 2022
232022
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
212017
An exact branch and bound algorithm with symmetry breaking for the maximum balanced induced biclique problem
C McCreesh, P Prosser
Integration of AI and OR Techniques in Constraint Programming: 11th …, 2014
212014
An auditable constraint programming solver
S Gocht, C McCreesh, J Nordström
28th International Conference on Principles and Practice of Constraint …, 2022
182022
Solving hard subgraph problems in parallel
C McCreesh
University of Glasgow, 2017
182017
The system can't perform the operation now. Try again later.
Articles 1–20