default search action
Patrick Prosser
Person information
- affiliation: University of Glasgow
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
- [j17]Esra Erdem
, Muge Fidan
A General Framework for Stable Roommates Problems using Answer Set Programming. Theory Pract. Log. Program. 20(6): 911-925 (2020) - 2019
- [j16]Michael Codish, Alice Miller
Constraints for symmetry breaking in graph representation. Constraints An Int. J. 24(1): 1-24 (2019) - 2018
- [j15]Ciaran McCreesh
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. J. Artif. Intell. Res. 61: 723-759 (2018) - [j14]Ian P. Gent, Ian Miguel
A review of literature on parallel constraint solving. Theory Pract. Log. Program. 18(5-6): 725-758 (2018) - 2015
- [j13]Ciaran McCreesh, Patrick Prosser:
A parallel branch and bound algorithm for the maximum labelled clique problem. Optim. Lett. 9(5): 949-960 (2015) - [j12]Ciaran McCreesh, Patrick Prosser:
The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound. ACM Trans. Parallel Comput. 2(1): 8:1-8:27 (2015) - 2013
- [j11]Ciaran McCreesh, Patrick Prosser:
Multi-Threading a State-of-the-Art Maximum Clique Algorithm. Algorithms 6(4): 618-635 (2013) - 2012
- [j10]Patrick Prosser:
Exact Algorithms for Maximum Clique: A Computational Study. Algorithms 5(4): 545-587 (2012) - 2011
- [j9]Patrick Prosser, Chris Unsworth:
Limited discrepancy search revisited. ACM J. Exp. Algorithmics 16 (2011) - 2008
- [j8]Neil C. A. Moore, Patrick Prosser:
The Ultrametric Constraint and its Application to Phylogenetics. J. Artif. Intell. Res. 32: 901-938 (2008) - 2006
- [j7]J. Christopher Beck, Patrick Prosser, Evgeny Selensky:
A case study of mutual routing-scheduling reformulation. J. Sched. 9(5): 469-491 (2006) - 2001
- [j6]Ian P. Gent
Random Constraint Satisfaction: Flaws and Structure. Constraints An Int. J. 6(4): 345-372 (2001) - 2000
- [j5]Philip Kilby, Patrick Prosser, Paul Shaw:
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints. Constraints An Int. J. 5(4): 389-414 (2000) - [j4]Bruno De Backer, Vincent Furnon, Paul Shaw, Philip Kilby, Patrick Prosser:
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. J. Heuristics 6(4): 501-523 (2000) - 1996
- [j3]Patrick Prosser:
An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems. Artif. Intell. 81(1-2): 81-109 (1996) - 1993
- [j2]Patrick Prosser:
Hybrid Algorithms for the Constraint Satisfaction Problem. Comput. Intell. 9: 268-299 (1993) - 1991
- [j1]Peter Burke, Patrick Prosser:
A distributed asynchronous system for predictive and reactive scheduling. Artif. Intell. Eng. 6(3): 106-124 (1991)
Conference and Workshop Papers
- 2021
- [c49]Özgür Akgün
Finding Subgraphs with Side Constraints. CPAIOR 2021: 348-364 - 2020
- [c48]Stephan Gocht
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP 2020: 338-357 - [c47]Ciaran McCreesh
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. ICGT 2020: 316-324 - 2019
- [c46]Ciaran McCreesh
Understanding the Empirical Hardness of Random Optimisation Problems. CP 2019: 333-349 - [c45]Blair Archibald
Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. CPAIOR 2019: 20-38 - 2018
- [c44]Ruth Hoffmann
Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. CPAIOR 2018: 298-315 - 2017
- [c43]Ciaran McCreesh
On Maximum Weight Clique Algorithms, and How They Are Evaluated. CP 2017: 206-225 - [c42]Ciaran McCreesh
A Partitioning Algorithm for Maximum Common Subgraph Problems. IJCAI 2017: 712-719 - 2016
- [c41]Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon:
Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. CP 2016: 350-368 - [c40]Ciaran McCreesh, Patrick Prosser, James Trimble:
Morphing Between Stable Matching Problems. CP 2016: 832-840 - [c39]Ciaran McCreesh, Patrick Prosser, James Trimble:
Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. IJCAI 2016: 631-638 - [c38]José Cano
Task Variant Allocation in Distributed Robotics. Robotics: Science and Systems 2016 - [c37]Ciaran McCreesh, Patrick Prosser:
Finding Maximum k-Cliques Faster Using Lazy Global Domination. SOCS 2016: 72-80 - 2015
- [c36]Ciaran McCreesh, Patrick Prosser:
A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs. CP 2015: 295-312 - [c35]Craig Macdonald, Ciaran McCreesh, Alice Miller
Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists. CP 2015: 671-686 - 2014
- [c34]Patrick Prosser:
Teaching Constraint Programming. CP 2014: 3 - [c33]Ciaran McCreesh, Patrick Prosser:
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. CP 2014: 549-563 - [c32]Patrick Prosser:
Stable Roommates and Constraint Programming. CPAIOR 2014: 15-28 - [c31]Ciaran McCreesh, Patrick Prosser:
An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. CPAIOR 2014: 226-234 - 2013
- [c30]Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey:
Breaking Symmetries in Graph Representation. IJCAI 2013: 510-516 - 2008
- [c29]Paul Cockshott, Andreas Koltes, John T. O'Donnell, Patrick Prosser, Wim Vanderbauwhede:
A Hardware Relaxation Paradigm for Solving NP-Hard Problems. BCS Int. Acad. Conf. 2008: 75-86 - 2007
- [c28]David F. Manlove, Gregg O'Malley, Patrick Prosser, Chris Unsworth:
A Constraint Programming Approach to the Hospitals / Residents Problem. CPAIOR 2007: 155-170 - 2006
- [c27]Patrick Prosser, Chris Unsworth:
A Connectivity Constraint Using Bridges. ECAI 2006: 707-708 - 2005
- [c26]Chris Unsworth, Patrick Prosser:
Specialised Constraints for Stable Matching Problems. CP 2005: 869 - [c25]Chris Unsworth, Patrick Prosser:
A Specialised Binary Constraint for the Stable Marriage Problem. SARA 2005: 218-233 - 2004
- [c24]J. Christopher Beck, Patrick Prosser, Richard J. Wallace:
Variable Ordering Heuristics Show Promise. CP 2004: 711-715 - [c23]J. Christopher Beck, Patrick Prosser, Richard J. Wallace:
Trying Again to Fail-First. CSCLP 2004: 41-55 - [c22]J. Christopher Beck, Patrick Prosser, Richard J. Wallace:
Failing First: An Update. ECAI 2004: 959-960 - 2003
- [c21]J. Christopher Beck, Patrick Prosser, Evgeny Selensky:
Vehicle Routing and Job Shop Scheduling: What's the Difference? ICAPS 2003: 267-276 - [c20]Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei:
Supertree Construction with Constraint Programming. CP 2003: 837-841 - 2002
- [c19]Patrick Prosser, Evgeny Selensky:
A Study of Encodings of Constraint Satisfaction Problems with 0/1 Variables. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 121-131 - [c18]Ian P. Gent, Patrick Prosser:
An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. ECAI 2002: 141-145 - [c17]J. Christopher Beck, Patrick Prosser, Evgeny Selensky:
Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems. ICGT 2002: 60-74 - [c16]J. Christopher Beck, Patrick Prosser, Evgeny Selensky:
On the Reformulation of Vehicle Routing Problems and Scheduling Problems. SARA 2002: 282-289 - 2001
- [c15]Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith:
A Constraint Programming Approach to the Stable Marriage Problem. CP 2001: 225-239 - 2000
- [c14]Patrick Prosser, Kostas Stergiou, Toby Walsh:
Singleton Consistencies. CP 2000: 353-368 - 1999
- [c13]Ian P. Gent, Holger H. Hoos, Patrick Prosser, Toby Walsh:
Morphing: Combining Structure and Randomness. AAAI/IAAI 1999: 654-660 - 1998
- [c12]Patrick Prosser:
The Dynamics of Dynamic Variable Ordering Heuristics. CP 1998: 17-23 - [c11]Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh:
Random Constraint Satisfaction: Theory Meets Practice. CP 1998: 325-339 - 1997
- [c10]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
The Scaling of Search Cost. AAAI/IAAI 1997: 315-320 - [c9]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
The Constrainedness of Arc Consistency. CP 1997: 327-340 - 1996
- [c8]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
The Constrainedness of Search. AAAI/IAAI, Vol. 1 1996: 246-252 - [c7]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh:
An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem. CP 1996: 179-193 - 1995
- [c6]Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Toby Walsh:
Scaling Effects in the CSP Phase Transition. CP 1995: 70-87 - [c5]Patrick Prosser:
Forward Checking with Backmarking. Constraint Processing, Selected Papers 1995: 185-204 - 1994
- [c4]Patrick Prosser:
Binary Constraint Satisfaction Problems: Some are Harder than Others. ECAI 1994: 95-99 - 1993
- [c3]Patrick Prosser:
Domain Filtering can Degrade Intelligent Backtracking Search. IJCAI 1993: 262-267 - 1989
- [c2]Patrick Prosser:
A Reactive Scheduling Agent. IJCAI 1989: 1004-1009 - 1988
- [c1]Patrick Prosser:
A Hybrid Genetic Algorithm for Pallet Loading. ECAI 1988: 159-164
Informal and Other Publications
- 2020
- [i13]Esra Erdem, Muge Fidan, David F. Manlove, Patrick Prosser:
A General Framework for Stable Roommates Problems using Answer Set Programming. CoRR abs/2008.03050 (2020) - 2019
- [i12]Benjamin Bumpus, Patrick Prosser, James Trimble:
A Constraint Model for the Tree Decomposition of a Graph. CoRR abs/1908.02530 (2019) - 2018
- [i11]Ian P. Gent, Ciaran McCreesh, Ian Miguel, Neil C. A. Moore, Peter Nightingale, Patrick Prosser, Chris Unsworth:
A Review of Literature on Parallel Constraint Solving. CoRR abs/1803.10981 (2018) - 2014
- [i10]Neil C. A. Moore, Patrick Prosser:
The Ultrametric Constraint and its Application to Phylogenetics. CoRR abs/1401.3438 (2014) - [i9]Ciaran McCreesh, Patrick Prosser:
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound. CoRR abs/1401.5921 (2014) - [i8]Ciaran McCreesh, Patrick Prosser:
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem. CoRR abs/1407.7061 (2014) - [i7]Ciaran McCreesh, Patrick Prosser:
Finding Maximum k-Cliques Faster using Lazy Global Domination. CoRR abs/1408.6485 (2014) - [i6]Frod Prefect, Patrick Prosser:
Empirical Algorithmics: draw your own conclusions. CoRR abs/1412.3333 (2014) - 2013
- [i5]Chris Unsworth, Patrick Prosser:
An n-ary Constraint for the Stable Marriage Problem. CoRR abs/1308.0183 (2013) - [i4]Ciaran McCreesh, Patrick Prosser:
Greedy Graph Colouring is a Misleading Heuristic. CoRR abs/1310.7741 (2013) - 2012
- [i3]Patrick Prosser:
Exact Algorithms for Maximum Clique: a computational study. CoRR abs/1207.4616 (2012) - [i2]Alice Miller, Patrick Prosser:
Diamond-free Degree Sequences. CoRR abs/1208.0460 (2012) - [i1]Ciaran McCreesh, Patrick Prosser:
Distributing an Exact Algorithm for Maximum Clique: maximising the costup. CoRR abs/1209.4560 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: