11 citations · 25 across the 10 of their papers we have counts for
13 papers
A General Framework for Stable Roommates Problems using Answer Set Programming
Esra Erdem, Muge Fidan, David Manlove +1
The Stable Roommates problem (SR) is characterized by the preferences of agents over other agents as roommates: each agent ranks all others in strict order of preference. A solutio…
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…
A Review of Literature on Parallel Constraint Solving
Ian P. Gent, Ciaran McCreesh, Ian Miguel +4
As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to explo…
Empirical Algorithmics: draw your own conclusions
Frod Prefect, Patrick Prosser
In an empirical comparisons of algorithms we might compare run times over a set of benchmark problems to decide which one is fastest, i.e. an algorithmic horse race. Ideally we wou…
Finding Maximum k-Cliques Faster using Lazy Global Domination
Ciaran McCreesh, Patrick Prosser
A clique in a graph is a set of vertices, each of which is adjacent to every other vertex in this set. A k-clique relaxes this requirement, requiring vertices to be within a distan…
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
Ciaran McCreesh, Patrick Prosser
The maximum labelled clique problem is a variant of the maximum clique problem where edges in the graph are given labels, and we are not allowed to use more than a certain number o…