default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCiaran McCreesh
Person information
- affiliation: University of Glasgow
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Stephan Gocht, Ciaran McCreesh, Magnus O. Myreen, Jakob Nordström
, Andy Oertel, Yong Kiam Tan:
End-to-End Verification for Subgraph Solving. AAAI 2024: 8038-8047- [c31]Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, Konstantin Sidorov:
Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. CP 2024: 9:1-9:21 - [c30]Matthew J. McIlree, Ciaran McCreesh, Jakob Nordström:
Proof Logging for the Circuit Constraint. CPAIOR (2) 2024: 38-55 - [c29]Matthew J. McIlree, Ciaran McCreesh:
Proof Logging for Smart Extensional Constraints (Extended Abstract). IJCAI 2024: 8444-8446 - 2023
- [j9]Ciaran McCreesh:
Report on BCTCS 2023. Bull. EATCS 140 (2023) - [j8]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation. J. Artif. Intell. Res. 77: 1539-1589 (2023) - [c28]Matthew J. McIlree, Ciaran McCreesh:
Proof Logging for Smart Extensional Constraints. CP 2023: 26:1-26:17 - 2022
- [c27]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. AAAI 2022: 3698-3707 - [c26]Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
An Auditable Constraint Programming Solver. CP 2022: 25:1-25:18 - [i9]Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation. CoRR abs/2203.12275 (2022) - 2021
- [c25]Blair Archibald, Kyle Burns, Ciaran McCreesh, Michele Sevegnani:
Practical Bigraphs via Subgraph Isomorphism. CP 2021: 15:1-15:17 - [c24]Johannes Klaus Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab:
Complications for Computational Experiments from Modern Processors. CP 2021: 25:1-25:21 - [c23]Özgür Akgün, Jessica A. Enright, Christopher Jefferson, Ciaran McCreesh, Patrick Prosser, Steffen Zschaler:
Finding Subgraphs with Side Constraints. CPAIOR 2021: 348-364 - [c22]Sonja Kraiczy, Ciaran McCreesh:
Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints. IJCAI 2021: 1396-1402 - 2020
- [c21]Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Justifying All Differences Using Pseudo-Boolean Reasoning. AAAI 2020: 1486-1494 - [c20]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 - [c19]Ciaran McCreesh, Patrick Prosser, James Trimble:
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. ICGT 2020: 316-324 - [c18]Stephan Gocht, Ciaran McCreesh, Jakob Nordström:
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions. IJCAI 2020: 1134-1140
2010 – 2019
- 2019
- [c17]Ciaran McCreesh, William Pettersson, Patrick Prosser:
Understanding the Empirical Hardness of Random Optimisation Problems. CP 2019: 333-349 - [c16]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
- [j7]José Cano, David Robert White, Alejandro Bordallo, Ciaran McCreesh, Anna Lito Michala, Jeremy Singer, Vijay Nagarajan:
Solving the task variant allocation problem in distributed robotics. Auton. Robots 42(7): 1477-1495 (2018) - [j6]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) - [j5]Blair Archibald, Patrick Maier, Ciaran McCreesh, Robert J. Stewart, Phil Trinder:
Replicable parallel branch and bound search. J. Parallel Distributed Comput. 113: 92-114 (2018) - [j4]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) - [c15]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 - [i8]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
- [c14]Ruth Hoffmann, Ciaran McCreesh, Craig Reilly:
Between Subgraph Isomorphism and Maximum Common Subgraph. AAAI 2017: 3907-3914 - [c13]Ciaran McCreesh, Patrick Prosser, Kyle A. Simpson, James Trimble:
On Maximum Weight Clique Algorithms, and How They Are Evaluated. CP 2017: 206-225 - [c12]Ciaran McCreesh, Patrick Prosser, James Trimble:
A Partitioning Algorithm for Maximum Common Subgraph Problems. IJCAI 2017: 712-719 - [i7]Blair Archibald, Ciaran McCreesh, Patrick Maier, Rob Stewart, Phil Trinder:
Replicable Parallel Branch and Bound Search. CoRR abs/1703.05647 (2017) - 2016
- [c11]Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon:
Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems. CP 2016: 350-368 - [c10]Ciaran McCreesh, Patrick Prosser, James Trimble:
Morphing Between Stable Matching Problems. CP 2016: 832-840 - [c9]Ciaran McCreesh, Patrick Prosser, James Trimble:
Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. IJCAI 2016: 631-638 - [c8]Ciaran McCreesh:
Solving Hard Subgraph Problems in Parallel. IJCAI 2016: 4014-4015 - [c7]Lars Kotthoff, Ciaran McCreesh, Christine Solnon:
Portfolios of Subgraph Isomorphism Algorithms. LION 2016: 107-122 - [c6]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 - [c5]Ciaran McCreesh, Patrick Prosser:
Finding Maximum k-Cliques Faster Using Lazy Global Domination. SOCS 2016: 72-80 - 2015
- [j3]Ciaran McCreesh, Patrick Prosser:
A parallel branch and bound algorithm for the maximum labelled clique problem. Optim. Lett. 9(5): 949-960 (2015) - [j2]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) - [c4]Ciaran McCreesh, Patrick Prosser:
A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs. CP 2015: 295-312 - [c3]Craig Macdonald, Ciaran McCreesh, Alice Miller, Patrick Prosser:
Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists. CP 2015: 671-686 - 2014
- [c2]Ciaran McCreesh, Patrick Prosser:
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem. CP 2014: 549-563 - [c1]Ciaran McCreesh, Patrick Prosser:
An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem. CPAIOR 2014: 226-234 - [i6]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) - [i5]Ciaran McCreesh, Patrick Prosser:
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem. CoRR abs/1407.7061 (2014) - [i4]Sylwester Arabas, Michael R. Bareford, Ian P. Gent, Benjamin M. Gorman, Masih Hajiarabderkani, Tristan Henderson, Luke Hutton, Alexander Konovalov, Lars Kotthoff, Ciaran McCreesh, Ruma R. Paul, Karen E. Petrie, Abdul Razaq, Daniël Reijsbergen:
An Open and Reproducible Paper on Openness and Reproducibility of Papers in Computational Science. CoRR abs/1408.2123 (2014) - [i3]Ciaran McCreesh, Patrick Prosser:
Finding Maximum k-Cliques Faster using Lazy Global Domination. CoRR abs/1408.6485 (2014) - 2013
- [j1]Ciaran McCreesh, Patrick Prosser:
Multi-Threading a State-of-the-Art Maximum Clique Algorithm. Algorithms 6(4): 618-635 (2013) - [i2]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)
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-10-21 20:33 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:
