Distributing an Exact Algorithm for Maximum Clique: maximising the costup - Ciaran McCreesh; Patrick Prosser (CoRR, 2012)

Multi-Threading a State-of-the-Art Maximum Clique Algorithm. - Ciaran McCreesh; Patrick Prosser (Algorithms, 2013)

Greedy Graph Colouring is a Misleading Heuristic. - Ciaran McCreesh; Patrick Prosser (CoRR, 2013)

Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. - Ciaran McCreesh; Patrick Prosser (CP, 2014)

An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. - Ciaran McCreesh; Patrick Prosser (CPAIOR, 2014)

An Open and Reproducible Paper on Openness and Reproducibility of Papers in Computational Science. - Sylwester Arabas; Michael R. Bareford; Ian P. Gent; Benjamin M. Gorman; Masih Hajiarabderkani; Tristan Henderson; Luke Hutton; Alexander Konovalov 001; Lars Kotthoff; Ciaran McCreesh; Ruma R. Paul; Karen E. Petrie; et al. (CoRR, 2014)

Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists. - Craig Macdonald; Ciaran McCreesh; Alice Miller 001; Patrick Prosser (CP, 2015)

A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs. - Ciaran McCreesh; Patrick Prosser (CP, 2015)

A parallel branch and bound algorithm for the maximum labelled clique problem. - Ciaran McCreesh; Patrick Prosser (Optim. Lett., 2015)

The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound. - Ciaran McCreesh; Patrick Prosser (ACM Trans. Parallel Comput., 2015)

Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. - Ciaran McCreesh; Samba Ndojh Ndiaye; Patrick Prosser; Christine Solnon (CP, 2016)

Morphing Between Stable Matching Problems. - Ciaran McCreesh; Patrick Prosser; James Trimble 001 (CP, 2016)

Solving Hard Subgraph Problems in Parallel. - Ciaran McCreesh (IJCAI, 2016)

Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. - Ciaran McCreesh; Patrick Prosser; James Trimble 001 (IJCAI, 2016)

Portfolios of Subgraph Isomorphism Algorithms. - Lars Kotthoff; Ciaran McCreesh; Christine Solnon (LION, 2016)

Task Variant Allocation in Distributed Robotics. - José Cano 001; David Robert White; Alejandro Bordallo; Ciaran McCreesh; Patrick Prosser; Jeremy Singer; Vijay Nagarajan (Robotics: Science and Systems, 2016)

Finding Maximum k-Cliques Faster Using Lazy Global Domination. - Ciaran McCreesh; Patrick Prosser (SOCS, 2016)

Between Subgraph Isomorphism and Maximum Common Subgraph. - Ruth Hoffmann; Ciaran McCreesh; Craig Reilly (AAAI, 2017)

On Maximum Weight Clique Algorithms, and How They Are Evaluated. - Ciaran McCreesh; Patrick Prosser; Kyle A. Simpson; James Trimble 001 (CP, 2017)

A Partitioning Algorithm for Maximum Common Subgraph Problems. - Ciaran McCreesh; Patrick Prosser; James Trimble 001 (IJCAI, 2017)

Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. - Ruth Hoffmann; Ciaran McCreesh; Samba Ndojh Ndiaye; Patrick Prosser; Craig Reilly; Christine Solnon; James Trimble 001 (CPAIOR, 2018)

Solving the task variant allocation problem in distributed robotics. - José Cano 001; David Robert White; Alejandro Bordallo; Ciaran McCreesh; Anna Lito Michala; Jeremy Singer; Vijay Nagarajan (Auton. Robots, 2018)

When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. - Ciaran McCreesh; Patrick Prosser; Christine Solnon; James Trimble 001 (J. Artif. Intell. Res., 2018)

Replicable parallel branch and bound search. - Blair Archibald; Patrick Maier 001; Ciaran McCreesh; Robert J. Stewart 001; Phil Trinder (J. Parallel Distributed Comput., 2018)

A review of literature on parallel constraint solving. - Ian P. Gent; Ian Miguel; Peter Nightingale; Ciaran McCreesh; Patrick Prosser; Neil C. A. Moore; Chris Unsworth (Theory Pract. Log. Program., 2018)

Understanding the Empirical Hardness of Random Optimisation Problems. - Ciaran McCreesh; William Pettersson; Patrick Prosser (CP, 2019)

Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. - Blair Archibald; Fraser Dunlop; Ruth Hoffmann; Ciaran McCreesh; Patrick Prosser; James Trimble 001 (CPAIOR, 2019)

Justifying All Differences Using Pseudo-Boolean Reasoning. - Jan Elffers; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (AAAI, 2020)

Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. - Stephan Gocht; Ross McBride; Ciaran McCreesh; Jakob Nordström; Patrick Prosser; James Trimble 001 (CP, 2020)

The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. - Ciaran McCreesh; Patrick Prosser; James Trimble 001 (ICGT, 2020)

Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions. - Stephan Gocht; Ciaran McCreesh; Jakob Nordström (IJCAI, 2020)

Practical Bigraphs via Subgraph Isomorphism. - Blair Archibald; Kyle Burns; Ciaran McCreesh; Michele Sevegnani (CP, 2021)

Complications for Computational Experiments from Modern Processors. - Johannes Klaus Fichte; Markus Hecher; Ciaran McCreesh; Anas Shahab (CP, 2021)

Finding Subgraphs with Side Constraints. - Özgür Akgün; Jessica A. Enright; Christopher Jefferson; Ciaran McCreesh; Patrick Prosser; Steffen Zschaler (CPAIOR, 2021)

Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints. - Sonja Kraiczy; Ciaran McCreesh (IJCAI, 2021)

Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. - Bart Bogaerts 001; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (AAAI, 2022)

An Auditable Constraint Programming Solver. - Stephan Gocht; Ciaran McCreesh; Jakob Nordström (CP, 2022)

Proof Logging for Smart Extensional Constraints. - Matthew J. McIlree; Ciaran McCreesh (CP, 2023)

Report on BCTCS 2023. - Ciaran McCreesh (Bull. EATCS, 2023)

Certified Dominance and Symmetry Breaking for Combinatorial Optimisation. - Bart Bogaerts 001; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (J. Artif. Intell. Res., 2023)

End-to-End Verification for Subgraph Solving. - Stephan Gocht; Ciaran McCreesh; Magnus O. Myreen; Jakob Nordström; Andy Oertel; Yong Kiam Tan (AAAI, 2024)

Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. - Emir Demirovic; Ciaran McCreesh; Matthew J. McIlree; Jakob Nordström; Andy Oertel; Konstantin Sidorov (CP, 2024)

Proof Logging for the Circuit Constraint. - Matthew J. McIlree; Ciaran McCreesh; Jakob Nordström (CPAIOR (2), 2024)

Proof Logging for Smart Extensional Constraints (Extended Abstract). - Matthew J. McIlree; Ciaran McCreesh (IJCAI, 2024)

Certifying Bounds Propagation for Integer Multiplication Constraints. - Matthew J. McIlree; Ciaran McCreesh (AAAI, 2025)