| 2024 | IJCAI | Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples. | Gergely Csji, David F. Manlove, Iain McBride, James Trimble |
| 2020 | CP | Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. | Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordstrm, Patrick Prosser, James Trimble |
| 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 | 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 | Morphing Between Stable Matching Problems. | Ciaran McCreesh, Patrick Prosser, James Trimble |
| 2016 | IJCAI | Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. | Ciaran McCreesh, Patrick Prosser, James Trimble |