Остановите войну!
for scientists:
default search action
Patrick Prosser
- > Home > Persons > Patrick Prosser
Publications
- 2021
- [c49]Özgür Akgün, Jessica A. Enright, Christopher Jefferson, Ciaran McCreesh, Patrick Prosser, Steffen Zschaler:
Finding Subgraphs with Side Constraints. CPAIOR 2021: 348-364 - 2020
- [c48]Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble:
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP 2020: 338-357 - [c47]Ciaran McCreesh, Patrick Prosser, James Trimble:
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. ICGT 2020: 316-324 - 2019
- [c46]Ciaran McCreesh, William Pettersson, Patrick Prosser:
Understanding the Empirical Hardness of Random Optimisation Problems. CP 2019: 333-349 - [c45]Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, James Trimble:
Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. CPAIOR 2019: 20-38 - 2018
- [j15]Ciaran McCreesh, Patrick Prosser, Christine Solnon, James Trimble:
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, Peter Nightingale, Ciaran McCreesh, Patrick Prosser, Neil C. A. Moore, Chris Unsworth:
A review of literature on parallel constraint solving. Theory Pract. Log. Program. 18(5-6): 725-758 (2018) - [c44]Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon, James Trimble:
Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. CPAIOR 2018: 298-315 - [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) - 2017
- [c43]Ciaran McCreesh, Patrick Prosser, Kyle A. Simpson, James Trimble:
On Maximum Weight Clique Algorithms, and How They Are Evaluated. CP 2017: 206-225 - [c42]Ciaran McCreesh, Patrick Prosser, James Trimble:
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, David Robert White, Alejandro Bordallo, Ciaran McCreesh, Patrick Prosser, Jeremy Singer, Vijay Nagarajan:
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
- [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) - [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, Patrick Prosser:
Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists. CP 2015: 671-686 - 2014
- [c33]Ciaran McCreesh, Patrick Prosser:
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. CP 2014: 549-563 - [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 - [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) - 2013
- [j11]Ciaran McCreesh, Patrick Prosser:
Multi-Threading a State-of-the-Art Maximum Clique Algorithm. Algorithms 6(4): 618-635 (2013) - [i4]Ciaran McCreesh, Patrick Prosser:
Greedy Graph Colouring is a Misleading Heuristic. CoRR abs/1310.7741 (2013) - 2012
- [i1]Ciaran McCreesh, Patrick Prosser:
Distributing an Exact Algorithm for Maximum Clique: maximising the costup. CoRR abs/1209.4560 (2012)
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 2023-12-19 20:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint