| 2026 | AAAI | Faster Certified Symmetry Breaking Using Orders with Auxiliary Variables. | Markus Anders, Bart Bogaerts, Benjamin Bog, Arthur Gontier, Wietze Koops, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordstrm, Andy Oertel, Adrian Rebola-Pardo, Yong Kiam Tan |
| 2026 | CP | Proof Logging for Projected Enumeration (and Counting?) Problems in VeriPB. | Ciaran McCreesh, Jakob Nordstrm, Andy Oertel, Yong Kiam Tan |
| 2025 | AAAI | Certifying Bounds Propagation for Integer Multiplication Constraints. | Matthew J. McIlree, Ciaran McCreesh |
| 2024 | AAAI | End-to-End Verification for Subgraph Solving. | Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordstrm, Andy Oertel, Yong Kiam Tan |
| 2024 | CP | Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. | Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordstrm, Andy Oertel, Konstantin Sidorov |
| 2024 | CPAIOR | Proof Logging for the Circuit Constraint. | Matthew J. McIlree, Ciaran McCreesh, Jakob Nordstrm |
| 2024 | IJCAI | Proof Logging for Smart Extensional Constraints (Extended Abstract). | Matthew J. McIlree, Ciaran McCreesh |
| 2023 | CP | Proof Logging for Smart Extensional Constraints. | Matthew J. McIlree, Ciaran McCreesh |
| 2022 | AAAI | Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. | Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordstrm |
| 2022 | CP | An Auditable Constraint Programming Solver. | Stephan Gocht, Ciaran McCreesh, Jakob Nordstrm |
| 2021 | CP | Practical Bigraphs via Subgraph Isomorphism. | Blair Archibald, Kyle Burns, Ciaran McCreesh, Michele Sevegnani |
| 2021 | CP | Complications for Computational Experiments from Modern Processors. | Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab |
| 2021 | CPAIOR | Finding Subgraphs with Side Constraints. | zgr Akgn, Jessica A. Enright, Christopher Jefferson, Ciaran McCreesh, Patrick Prosser, Steffen Zschaler |
| 2021 | IJCAI | Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints. | Sonja Kraiczy, Ciaran McCreesh |
| 2020 | AAAI | Justifying All Differences Using Pseudo-Boolean Reasoning. | Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordstrm |
| 2020 | CP | Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. | Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordstrm, Patrick Prosser, James Trimble |
| 2020 | IJCAI | Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions. | Stephan Gocht, Ciaran McCreesh, Jakob Nordstrm |
| 2019 | CP | Understanding the Empirical Hardness of Random Optimisation Problems. | Ciaran McCreesh, William Pettersson, Patrick Prosser |
| 2019 | CPAIOR | Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. | Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, James Trimble |
| 2018 | CPAIOR | Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. | Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon, James Trimble |
| 2017 | AAAI | Between Subgraph Isomorphism and Maximum Common Subgraph. | Ruth Hoffmann, Ciaran McCreesh, Craig Reilly |
| 2017 | CP | On Maximum Weight Clique Algorithms, and How They Are Evaluated. | Ciaran McCreesh, Patrick Prosser, Kyle A. Simpson, James Trimble |
| 2017 | IJCAI | A Partitioning Algorithm for Maximum Common Subgraph Problems. | Ciaran McCreesh, Patrick Prosser, James Trimble |
| 2016 | CP | Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. | Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon |
| 2016 | CP | Morphing Between Stable Matching Problems. | Ciaran McCreesh, Patrick Prosser, James Trimble |
| 2016 | IJCAI | Solving Hard Subgraph Problems in Parallel. | Ciaran McCreesh |
| 2016 | IJCAI | Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. | Ciaran McCreesh, Patrick Prosser, James Trimble |
| 2016 | SoCS | Finding Maximum k-Cliques Faster Using Lazy Global Domination. | Ciaran McCreesh, Patrick Prosser |
| 2015 | CP | Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists. | Craig Macdonald, Ciaran McCreesh, Alice Miller, Patrick Prosser |
| 2015 | CP | A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs. | Ciaran McCreesh, Patrick Prosser |
| 2014 | CP | Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. | Ciaran McCreesh, Patrick Prosser |
| 2014 | CPAIOR | An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. | Ciaran McCreesh, Patrick Prosser |