James Trimble - RankMe

24 papers A* 4A 3B 6Journal 9Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Introducing The Maximum Common Bigraph Problem. GCM@STAF Kyle Burns, Michele Sevegnani, Ciaran McCreesh, James Trimble
2024	A*	`conf`	Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples. IJCAI Gergely Csáji, David F. Manlove, Iain McBride, James Trimble
2023	J	`jnl`	Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples. CoRR Gergely Csáji, David F. Manlove, Iain McBride, James Trimble
2023	—	`—`	Partitioning algorithms for induced subgraph problems. James Trimble
2022	J	`jnl`	Improved instance generation for kidney exchange programmes. Comput. Oper. Res. Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson, James Trimble
2021	J	`jnl`	Induced universal graphs for families of small graphs. CoRR James Trimble
2020	B	`conf`	An Algorithm for the Exact Treedepth Problem. SEA James Trimble
2020	J	`jnl`	An Algorithm for the Exact Treedepth Problem. CoRR James Trimble
2020	J	`jnl`	Bute: A Bottom-Up Exact Solver for Treedepth (Submitted to PACE 2020 under username peaty). CoRR James Trimble
2020	A	`conf`	Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems. CP Stephan Gocht, Ross McBride, Ciaran McCreesh, Jakob Nordström, Patrick Prosser, James Trimble
2020	B	`conf`	PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth. IPEC James Trimble
2020	B	`conf`	PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth. IPEC James Trimble
2020	B	`conf`	The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. ICGT Ciaran McCreesh, Patrick Prosser, James Trimble
2019	J	`jnl`	A Constraint Model for the Tree Decomposition of a Graph. CoRR Benjamin Bumpus, Patrick Prosser, James Trimble
2019	B	`conf`	Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. CPAIOR Blair Archibald, Fraser Dunlop, Ruth Hoffmann, Ciaran McCreesh, Patrick Prosser, James Trimble
2018	B	`conf`	Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms. CPAIOR Ruth Hoffmann, Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Craig Reilly, Christine Solnon, James Trimble
2018	J	`jnl`	When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases. J. Artif. Intell. Res. Ciaran McCreesh, Patrick Prosser, Christine Solnon, James Trimble
2017	J	`jnl`	"Almost-stable" matchings in the Hospitals / Residents problem with Couples. Constraints An Int. J. David F. Manlove, Iain McBride, James Trimble
2017	A*	`conf`	A Partitioning Algorithm for Maximum Common Subgraph Problems. IJCAI Ciaran McCreesh, Patrick Prosser, James Trimble
2017	A	`conf`	On Maximum Weight Clique Algorithms, and How They Are Evaluated. CP Ciaran McCreesh, Patrick Prosser, Kyle A. Simpson, James Trimble
2016	A*	`conf`	Heuristics and Really Hard Instances for Subgraph Isomorphism Problems. IJCAI Ciaran McCreesh, Patrick Prosser, James Trimble
2016	A	`conf`	Morphing Between Stable Matching Problems. CP Ciaran McCreesh, Patrick Prosser, James Trimble
2016	A*	`conf`	Position-Indexed Formulations for Kidney Exchange. EC John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble
2016	J	`jnl`	Position-Indexed Formulations for Kidney Exchange. CoRR John P. Dickerson, David F. Manlove, Benjamin Plaut, Tuomas Sandholm, James Trimble