201 citations · 1.5k across the 125 of their papers we have counts for
5 papers · 2 filters
The SeqBin Constraint Revisited
George Katsirelos, Nina Narodytska, Toby Walsh
We revisit the SeqBin constraint. This meta-constraint subsumes a number of important global constraints like Change, Smooth and IncreasingNValue. We show that the previously propo…
Eliminating the Weakest Link: Making Manipulation Intractable?
Jessica Davies, Nina Narodytska, Toby Walsh
Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computat…
Symmetry Breaking Constraints: Recent Results
Toby Walsh
Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results…
Combining Voting Rules Together
Nina Narodytska, Toby Walsh, Lirong Xia
We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several…
The RegularGcc Matrix Constraint
Ronald de Haan, Nina Narodytska, Toby Walsh
We study propagation of the RegularGcc global constraint. This ensures that each row of a matrix of decision variables satisfies a Regular constraint, and each column satisfies a G…