9 citations · 10 across the 3 of their papers we have counts for
4 papers
A comparison of encodings for cardinality constraints in a SAT solver
Ed Wynn
Cardinality constraints are important in many Sat problems; previous studies provide contradictory conclusions about the best encoding to use. Here, three encodings are compared: S…
Enumeration of nonisomorphic Hamiltonian cycles on square grid graphs
Ed Wynn
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work en…
Exhaustive generation of `Mrs Perkins's quilt' square dissections for low orders
Ed Wynn
Dissections of a square into smaller squares, with the smaller squares having relatively prime sizes, are known as Mrs Perkins's quilts. A representation of these dissections using…
Constructing circuit codes by permuting initial sequences
Ed Wynn
Two new constructions are presented for coils and snakes in the hypercube. Improvements are made on the best known results for snake-in-the-box coils of dimensions 9, 10 and 11, an…