default search action
James Trimble 0001
Person information
- affiliation: University of Glasgow, UK
Other persons with the same name
- James Trimble 0002 — Rutgers University, New Brunswick, NJ, USA
- James Trimble 0003 — University of Tennessee at Chattanooga, Department of Electrical Engineering, TN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Gergely Csáji, David F. Manlove, Iain McBride, James Trimble:
Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples. IJCAI 2024: 2731-2739 - 2023
- [b1]James Trimble:
Partitioning algorithms for induced subgraph problems. University of Glasgow, UK, 2023 - [i6]Gergely Csáji, David F. Manlove, Iain McBride, James Trimble:
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples. CoRR abs/2311.00405 (2023) - 2022
- [j3]Maxence Delorme
, Sergio García
Improved instance generation for kidney exchange programmes. Comput. Oper. Res. 141: 105707 (2022) - 2021
- [i5]James Trimble:
Induced universal graphs for families of small graphs. CoRR abs/2109.00075 (2021) - 2020
- [c12]Stephan Gocht
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP 2020: 338-357 - [c11]Ciaran McCreesh
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. ICGT 2020: 316-324 - [c10]James Trimble
PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth. IPEC 2020: 34:1-34:4 - [c9]James Trimble
PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth. IPEC 2020: 35:1-35:4 - [c8]James Trimble
An Algorithm for the Exact Treedepth Problem. SEA 2020: 19:1-19:14 - [i4]James Trimble
An Algorithm for the Exact Treedepth Problem. CoRR abs/2004.08959 (2020) - [i3]James Trimble:
Bute: A Bottom-Up Exact Solver for Treedepth (Submitted to PACE 2020 under username peaty). CoRR abs/2006.09912 (2020)
2010 – 2019
- 2019
- [c7]Blair Archibald
Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. CPAIOR 2019: 20-38 - [i2]Benjamin Bumpus, Patrick Prosser, James Trimble:
A Constraint Model for the Tree Decomposition of a Graph. CoRR abs/1908.02530 (2019) - 2018
- [j2]Ciaran McCreesh
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. J. Artif. Intell. Res. 61: 723-759 (2018) - [c6]Ruth Hoffmann
Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. CPAIOR 2018: 298-315 - 2017
- [j1]David F. Manlove
"Almost-stable" matchings in the Hospitals / Residents problem with Couples. Constraints An Int. J. 22(1): 50-72 (2017) - [c5]Ciaran McCreesh
On Maximum Weight Clique Algorithms, and How They Are Evaluated. CP 2017: 206-225 - [c4]Ciaran McCreesh
A Partitioning Algorithm for Maximum Common Subgraph Problems. IJCAI 2017: 712-719 - 2016
- [c3]Ciaran McCreesh, Patrick Prosser, James Trimble:
Morphing Between Stable Matching Problems. CP 2016: 832-840 - [c2]Ciaran McCreesh, Patrick Prosser, James Trimble:
Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. IJCAI 2016: 631-638 - [c1]John P. Dickerson, David F. Manlove
Position-Indexed Formulations for Kidney Exchange. EC 2016: 25-42 - [i1]John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble:
Position-Indexed Formulations for Kidney Exchange. CoRR abs/1606.01623 (2016)
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:28 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: