A Hybrid Genetic Algorithm for Pallet Loading. - Patrick Prosser (ECAI, 1988)

A Reactive Scheduling Agent. - Patrick Prosser (IJCAI, 1989)

A distributed asynchronous system for predictive and reactive scheduling. - Peter Burke; Patrick Prosser (Artif. Intell. Eng., 1991)

Domain Filtering can Degrade Intelligent Backtracking Search. - Patrick Prosser (IJCAI, 1993)

Hybrid Algorithms for the Constraint Satisfaction Problem. - Patrick Prosser (Comput. Intell., 1993)

Binary Constraint Satisfaction Problems: Some are Harder than Others. - Patrick Prosser (ECAI, 1994)

Scaling Effects in the CSP Phase Transition. - Ian P. Gent; Ewan MacIntyre; Patrick Prosser; Toby Walsh (CP, 1995)

Forward Checking with Backmarking. - Patrick Prosser (Constraint Processing, Selected Papers, 1995)

The Constrainedness of Search. - Ian P. Gent; Ewan MacIntyre; Patrick Prosser; Toby Walsh (AAAI/IAAI, Vol. 1, 1996)

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 (CP, 1996)

An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems. - Patrick Prosser (Artif. Intell., 1996)

The Scaling of Search Cost. - Ian P. Gent; Ewan MacIntyre; Patrick Prosser; Toby Walsh (AAAI/IAAI, 1997)

The Constrainedness of Arc Consistency. - Ian P. Gent; Ewan MacIntyre; Patrick Prosser; Toby Walsh (CP, 1997)

Random Constraint Satisfaction: Theory Meets Practice. - Ewan MacIntyre; Patrick Prosser; Barbara M. Smith; Toby Walsh (CP, 1998)

The Dynamics of Dynamic Variable Ordering Heuristics. - Patrick Prosser (CP, 1998)

Morphing: Combining Structure and Randomness. - Ian P. Gent; Holger H. Hoos; Patrick Prosser; Toby Walsh (AAAI/IAAI, 1999)

Singleton Consistencies. - Patrick Prosser; Kostas Stergiou 001; Toby Walsh (CP, 2000)

A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints. - Philip Kilby; Patrick Prosser; Paul Shaw (Constraints An Int. J., 2000)

Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. - Bruno De Backer; Vincent Furnon; Paul Shaw; Philip Kilby; Patrick Prosser (J. Heuristics, 2000)

A Constraint Programming Approach to the Stable Marriage Problem. - Ian P. Gent; Robert W. Irving; David F. Manlove; Patrick Prosser; Barbara M. Smith (CP, 2001)

Random Constraint Satisfaction: Flaws and Structure. - Ian P. Gent; Ewan MacIntyre; Patrick Prosser; Barbara M. Smith; Toby Walsh (Constraints An Int. J., 2001)

A Study of Encodings of Constraint Satisfaction Problems with 0/1 Variables. - Patrick Prosser; Evgeny Selensky (International Workshop on Constraint Solving and Constraint Logic Programming, 2002)

An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. - Ian P. Gent; Patrick Prosser (ECAI, 2002)

Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems. - J. Christopher Beck; Patrick Prosser; Evgeny Selensky (ICGT, 2002)

On the Reformulation of Vehicle Routing Problems and Scheduling Problems. - J. Christopher Beck; Patrick Prosser; Evgeny Selensky (SARA, 2002)

Vehicle Routing and Job Shop Scheduling: What's the Difference? - J. Christopher Beck; Patrick Prosser; Evgeny Selensky (ICAPS, 2003)

Supertree Construction with Constraint Programming. - Ian P. Gent; Patrick Prosser; Barbara M. Smith; Wu Wei (CP, 2003)

Variable Ordering Heuristics Show Promise. - J. Christopher Beck; Patrick Prosser; Richard J. Wallace (CP, 2004)

Trying Again to Fail-First. - J. Christopher Beck; Patrick Prosser; Richard J. Wallace (CSCLP, 2004)

Failing First: An Update. - J. Christopher Beck; Patrick Prosser; Richard J. Wallace (ECAI, 2004)

Specialised Constraints for Stable Matching Problems. - Chris Unsworth; Patrick Prosser (CP, 2005)

A Specialised Binary Constraint for the Stable Marriage Problem. - Chris Unsworth; Patrick Prosser (SARA, 2005)

A Connectivity Constraint Using Bridges. - Patrick Prosser; Chris Unsworth (ECAI, 2006)

A case study of mutual routing-scheduling reformulation. - J. Christopher Beck; Patrick Prosser; Evgeny Selensky (J. Sched., 2006)

A Constraint Programming Approach to the Hospitals / Residents Problem. - David F. Manlove; Gregg O'Malley; Patrick Prosser; Chris Unsworth (CPAIOR, 2007)

A Hardware Relaxation Paradigm for Solving NP-Hard Problems. - Paul Cockshott; Andreas Koltes; John T. O'Donnell; Patrick Prosser; Wim Vanderbauwhede (BCS Int. Acad. Conf., 2008)

The Ultrametric Constraint and its Application to Phylogenetics. - Neil C. A. Moore; Patrick Prosser (J. Artif. Intell. Res., 2008)

Limited discrepancy search revisited. - Patrick Prosser; Chris Unsworth (ACM J. Exp. Algorithmics, 2011)

Exact Algorithms for Maximum Clique: A Computational Study. - Patrick Prosser (Algorithms, 2012)

Diamond-free Degree Sequences - Alice Miller 001; Patrick Prosser (CoRR, 2012)

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

Breaking Symmetries in Graph Representation. - Michael Codish; Alice Miller 001; Patrick Prosser; Peter James Stuckey (IJCAI, 2013)

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)

An n-ary Constraint for the Stable Marriage Problem. - Chris Unsworth; Patrick Prosser (CoRR, 2013)

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

Teaching Constraint Programming. - 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)

Stable Roommates and Constraint Programming. - Patrick Prosser (CPAIOR, 2014)

Empirical Algorithmics: draw your own conclusions. - Frod Prefect; Patrick Prosser (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)

Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. - Ciaran McCreesh; Patrick Prosser; James Trimble 001 (IJCAI, 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)

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)

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)

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)

Constraints for symmetry breaking in graph representation. - Michael Codish; Alice Miller 001; Patrick Prosser; Peter J. Stuckey (Constraints An Int. J., 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)

A General Framework for Stable Roommates Problems using Answer Set Programming. - Esra Erdem 001; Muge Fidan; David F. Manlove; Patrick Prosser (Theory Pract. Log. Program., 2020)

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