21 citations · 24 across the 8 of their papers we have counts for
8 papers
Introducing The Maximum Common Bigraph Problem
Kyle Burns, Michele Sevegnani, Ciaran McCreesh +1
Bigraph reactive systems offer a powerful and flexible mathematical framework for modelling both spatial and non-spatial relationships between agents, with practical applications i…
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
Gergely Csáji, David Manlove, Iain McBride +1
In this paper, we study the Hospitals / Residents problem with Couples (HRC), where a solution is a stable matching or a report that none exists. We present a novel polynomial-time…
Induced universal graphs for families of small graphs
James Trimble
We present exact and heuristic algorithms that find, for a given family of graphs, a graph that contains each member of the family as an induced subgraph. For , we…
PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth
James Trimble
This note introduces Bute-Plus, an exact solver for the treedepth problem. The core of the solver is a positive-instance driven dynamic program that constructs an elimination tree…
An Algorithm for the Exact Treedepth Problem
James Trimble
We present a novel algorithm for the minimum-depth elimination tree problem, which is equivalent to the optimal treedepth decomposition problem. Our algorithm makes use of two chea…
A Constraint Model for the Tree Decomposition of a Graph
Benjamin Bumpus, Patrick Prosser, James Trimble
We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree de…