Publications (21)
An explicit universal cycle for the (n-1)-permutations of an n-set
Frank Ruskey, Aaron Williams
All Simple Venn Diagrams are Hamiltonian
Gara Pruesse, Frank Ruskey
Meta-Fibonacci Sequences, Binary Trees, and Extremal Compact Codes
Brad Jackson, Frank Ruskey
Developing a Mathematical Model for Bobbin Lace
Veronika Irvine, Frank Ruskey
An Undecidable Nested Recurrence Relation
Marcel Celaya, Frank Ruskey
Nested Recurrence Relations With Conolly-Like Solutions
Alejandro Erickson, Abraham Isgur, Bradley W. Jackson +2
Vertically constrained Motzkin-like paths inspired by bobbin lace
Veronika Irvine, Stephen Melczer, Frank Ruskey
A New Rose : The First Simple Symmetric 11-Venn Diagram
Khalegh Mamakani, Frank Ruskey
Enumerating maximal tatami mat coverings of square grids with $v$ vertical dominoes
Alejandro Erickson, Frank Ruskey
Parallel and sequential in-place permuting and perfect shuffling using involutions
Qingxuan Yang, John Ellis, Khalegh Mamakani +1
Normal, Abby Normal, Prefix Normal
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2
On Prefix Normal Words and Prefix Normal Forms
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2
Morphic Words and Nested Recurrence Relations
Marcel Celaya, Frank Ruskey
Minimum Area Venn Diagrams Whose Curves are Polyominoes
Stirling Chow, Frank Ruskey
On Combinatorial Generation of Prefix Normal Words
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2
Domino Tatami Covering is NP-complete
Alejandro Erickson, Frank Ruskey
Isoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions
L. Sunil Chandran, Anita Das, Frank Ruskey
Efficient coroutine generation of constrained Gray sequences
Donald E. Knuth, Frank Ruskey
Auspicious tatami mat arrangements
Alejandro Erickson, Frank Ruskey, Mark Schurch +1
Which n-Venn diagrams can be drawn with convex k-gons?
Jeremy Carroll, Frank Ruskey, Mark Weston
Generating Tatami Coverings Efficiently
Alejandro Erickson, Frank Ruskey