| 2014 | CPM | On Combinatorial Generation of Prefix Normal Words. | Peter Burcsi, Gabriele Fici, Zsuzsanna Liptk, Frank Ruskey, Joe Sawada |
| 2014 | FUN | Normal, Abby Normal, Prefix Normal. | Peter Burcsi, Gabriele Fici, Zsuzsanna Liptk, Frank Ruskey, Joe Sawada |
| 2013 | IWOCA | Domino Tatami Covering Is NP-Complete. | Alejandro Erickson, Frank Ruskey |
| 2012 | CiE | An Undecidable Nested Recurrence Relation. | Marcel Celaya, Frank Ruskey |
| 2012 | GD | The First Simple Symmetric 11-Venn Diagram. | Khalegh Mamakani, Frank Ruskey |
| 2011 | IWOCA | Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams. | Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey |
| 2011 | IWOCA | The Rand and Block Distances of Pairs of Set Partitions. | Frank Ruskey, Jennifer Woodcock |
| 2010 | COCOON | Auspicious Tatami Mat Arrangements. | Alejandro Erickson, Frank Ruskey, Mark Schurch, Jennifer Woodcock |
| 2010 | COCOON | Faster Generation of Shorthand Universal Cycles for Permutations. | Alexander E. Holroyd, Frank Ruskey, Aaron Williams |
| 2010 | FUN | Symmetric Monotone Venn Diagrams with Seven Curves. | Tao Cao, Khalegh Mamakani, Frank Ruskey |
| 2010 | FUN | The Feline Josephus Problem. | Frank Ruskey, Aaron Williams |
| 2005 | COCOON | Generating Combinations by Prefix Shifts. | Frank Ruskey, Aaron Williams |
| 2003 | GD | Drawing Area-Proportional Venn and Euler Diagrams. | Stirling Chow, Frank Ruskey |
| 2002 | GD | Drawing Venn Diagrams. | Frank Ruskey |
| 2000 | COCOON | Generating Necklaces and Strings with Forbidden Substrings. | Frank Ruskey, Joe Sawada |
| 2000 | SODA | A fast algorithm to generate unlabeled necklaces. | Frank Ruskey, Joe Sawada |
| 1999 | SODA | The Advantages of Forward Thinking in Generating Rooted and Free Trees. | Gang Li, Frank Ruskey |
| 1999 | SODA | An Efficient Algorithm for Generating Necklaces with Fixed Density. | Joe Sawada, Frank Ruskey |
| 1994 | GD | Three-Dimensional Graph Drawing. | Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey |
| 1993 | ISAAC | Simple Combinatorial Gray Codes Constructed by Reversing Sublists. | Frank Ruskey |