| 2021 | CPAIOR | Finding Subgraphs with Side Constraints. | zgr Akgn, Jessica A. Enright, Christopher Jefferson, Ciaran McCreesh, Patrick Prosser, Steffen Zschaler |
| 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 | 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 | 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 | 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 | CP | Teaching Constraint Programming. | Patrick Prosser |
| 2014 | CPAIOR | An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. | Ciaran McCreesh, Patrick Prosser |
| 2014 | CPAIOR | Stable Roommates and Constraint Programming. | Patrick Prosser |
| 2013 | IJCAI | Breaking Symmetries in Graph Representation. | Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey |
| 2007 | CPAIOR | A Constraint Programming Approach to the Hospitals / Residents Problem. | David F. Manlove, Gregg O'Malley, Patrick Prosser, Chris Unsworth |
| 2006 | ECAI | A Connectivity Constraint Using Bridges. | Patrick Prosser, Chris Unsworth |
| 2005 | CP | Specialised Constraints for Stable Matching Problems. | Chris Unsworth, Patrick Prosser |
| 2004 | CP | Variable Ordering Heuristics Show Promise. | J. Christopher Beck, Patrick Prosser, Richard J. Wallace |
| 2004 | ECAI | Failing First: An Update. | J. Christopher Beck, Patrick Prosser, Richard J. Wallace |
| 2003 | CP | Supertree Construction with Constraint Programming. | Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei |
| 2002 | ECAI | An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. | Ian P. Gent, Patrick Prosser |
| 2001 | CP | A Constraint Programming Approach to the Stable Marriage Problem. | Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith |
| 2000 | CP | Singleton Consistencies. | Patrick Prosser, Kostas Stergiou, Toby Walsh |
| 1999 | AAAI | Morphing: Combining Structure and Randomness. | Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh |
| 1998 | CP | Random Constraint Satisfaction: Theory Meets Practice. | Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh |
| 1998 | CP | The Dynamics of Dynamic Variable Ordering Heuristics. | Patrick Prosser |
| 1997 | AAAI | The Scaling of Search Cost. | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh |
| 1997 | CP | The Constrainedness of Arc Consistency. | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh |
| 1996 | AAAI | The Constrainedness of Search. | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh |
| 1996 | CP | An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem. | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh |
| 1995 | CP | Scaling Effects in the CSP Phase Transition. | Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh |
| 1995 | CP | Forward Checking with Backmarking. | Patrick Prosser |
| 1994 | ECAI | Binary Constraint Satisfaction Problems: Some are Harder than Others. | Patrick Prosser |
| 1993 | IJCAI | Domain Filtering can Degrade Intelligent Backtracking Search. | Patrick Prosser |
| 1989 | IJCAI | A Reactive Scheduling Agent. | Patrick Prosser |
| 1988 | ECAI | A Hybrid Genetic Algorithm for Pallet Loading. | Patrick Prosser |