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

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

Position-Indexed Formulations for Kidney Exchange. - John P. Dickerson; David F. Manlove; Benjamin Plaut; Tuomas Sandholm; James Trimble 001 (EC, 2016)

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)

"Almost-stable" matchings in the Hospitals / Residents problem with Couples. - David F. Manlove; Iain McBride; James Trimble 001 (Constraints An Int. J., 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)

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)

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

A Constraint Model for the Tree Decomposition of a Graph. - Benjamin Bumpus; Patrick Prosser; James Trimble 001 (CoRR, 2019)

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)

PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth. - James Trimble 001 (IPEC, 2020)

PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth. - James Trimble 001 (IPEC, 2020)

An Algorithm for the Exact Treedepth Problem. - James Trimble 001 (SEA, 2020)

Bute: A Bottom-Up Exact Solver for Treedepth (Submitted to PACE 2020 under username peaty). - James Trimble 001 (CoRR, 2020)

Induced universal graphs for families of small graphs. - James Trimble 001 (CoRR, 2021)

Improved instance generation for kidney exchange programmes. - Maxence Delorme; Sergio García 001; Jacek Gondzio; Jörg Kalcsics; David F. Manlove; William Pettersson; James Trimble 001 (Comput. Oper. Res., 2022)

Partitioning algorithms for induced subgraph problems. - James Trimble 001 (2023)

Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples. - Gergely Csáji; David F. Manlove; Iain McBride; James Trimble 001 (IJCAI, 2024)