- The Prism of the Acyclic Orientation Graph is Hamiltonian
- THE NUMBER OF IRREDUCIBLE POLYNOMIALS AND LYNDON WORDS WITH GIVEN TRACE
- FIXED-DENSITY DE BRUIJN SEQUENCES FRANK RUSKEY, JOE SAWADA, AND AARON WILLIAMS
- Bent Hamilton Cycles in d-Dimensional Grid Graphs F. Ruskey Joe Sawada y
- Euclidean Strings # John Ellis + , Frank Ruskey + , Joe Sawada # and Jamie Simpson #
- HAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F2 GILBERT LEE, FRANK RUSKEY, AND AARON WILLIAMS
- A Gray Code for the Ideals of a Forest Poset Yasunori Koda and Frank Ruskey
- Transition Restricted Gray Codes Bette Bultena and Frank Ruskey
- SOFTWARE TESTING, VERIFICATION AND RELIABILITY Softw. Test. Verif. Reliab. 2000; 10: 149170
- Generating Lyndon brackets. An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces
- Searching for Symmetric Venn Diagrams Stirling Chow, CS Dept., University of Victoria, B.C., CANADA, schow2@csr.csc.uvic.ca
- Convex Drawings of Intersecting Families of Simple Closed Curves
- Algorithmica manuscript No. (will be inserted by the editor)
- Gray Codes from Antimatroids Gara Pruesse \Lambda
- Fast generation of all perfect elimination orderings of a chordal graph.
- Alley CATs in search of good homes Frank Ruskey \Lambda
- FIBONACCI MEETS HOFSTADTER FRANK RUSKEY
- MORE FUN WITH SYMMETRIC VENN DIAGRAMS Frank Ruskey a and Mark Weston
- Symmetric Venn Diagrams on the Sphere I: Chain Decompositions and Isometry Groups of Order
- Generating Necklaces and Strings with Forbidden Substrings
- Iterations of eccentric digraphs Mirka Miller
- COUNTING STRINGS WITH GIVEN ELEMENTARY SYMMETRIC FUNCTION EVALUATIONS II: CIRCULAR STRINGS
- Euclidean Strings Frank Ruskey, U. Victoria, Victoria, CANADA
- On the Hamiltonicity of Directed oe \Gamma Cayley Graphs
- COMPLETE k-ARY TREES AND GENERALIZED META-FIBONACCI CHRIS DEUGAU AND FRANK RUSKEY
- The Search for Simple Symmetric Venn Diagrams
- More fun with symmetric Venn diagrams Frank Ruskey1
- DOI: 10.1007/s00224-005-1243-1 Theory Comput. Systems 39, 413423 (2006)
- Generating Balanced Parentheses and Binary Trees by Prefix Shifts We show that the set Bn of balanced parentheses
- Generating Binary Trees by Transpositions Frank Ruskey \Lambda and Andrzej Proskurowski y
- Auspicious tatami mat arrangements
- Generating Linear Extensions of Posets by Transpositions
- Motivation Introduction to Tatami Tilings 2xn Tatami Tilings mxn Tatami Tilings Results Counting Fixed-Height Tatami Tilings
- Generating Alternating Permutations Lexicographically
- Generating Unlabeled Necklaces and Irreducible Polynomials over GF(2)
- Here we list and fix some small errors/typos that occur in the paper: Brad Jackson and Frank Ruskey, Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes Electronic Journal
- A CAT Algorithm for Generating Permutations with a Fixed Number of
- Drawing Area-Proportional Venn and Euler Stirling Chow and Frank Ruskey
- State Generation and Automated Class Testing Thomas Ball \Lambda Daniel Hoffman y Frank Ruskey z Richard Webber x
- An EadesMcKay Algorithm for WellFormed Parentheses Strings
- An E#cient Implementation of the Eades, Hickey, Read Adjacent Interchange Combination Generation
- Euclidean Strings , Frank Ruskey
- The Number of Irreducible Polynomials over GF(2) with Given Trace and Subtrace
- Generating Linear Extensions of Posets by Transpositions
- An Efficient Algorithm for Generating Necklaces with Fixed Density Joe Sawada \Lambda Frank Ruskey y
- Faster Generation of Shorthand Universal Cycles for Permutations
- Analysis of Algorithms for Listing Equivalence Classes of kary Strings
- The Advantages of Forward Thinking in Generating Rooted and Free Trees
- HAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F 2 GILBERT LEE, FRANK RUSKEY, AND AARON WILLIAMS
- Generating combinations by prefix shifts Frank Ruskey # Aaron Williams +
- Which n-Venn diagrams can be drawn with convex Jeremy Carroll
- Faster Generation of Shorthand Universal Cycles for Permutations
- Counting Fixed-Height Tatami Tilings Frank Ruskey
- Generating Permutations of a Bag by Interchanges Chun Wa Ko \Lambda
- On Rotations and the Generation of Binary Trees
- COMPLETE kARY TREES AND GENERALIZED METAFIBONACCI CHRIS DEUGAU AND FRANK RUSKEY
- GENERATING LINEAR EXTENSIONS FAST GARA PRUESSE \Lambda AND FRANK RUSKEY y
- HalfSimple Symmetric Venn Diagrams Charles E. Killian
- A Gray Code for Combinations of a Multiset Frank Ruskey \Lambda
- Generating Necklaces Frank Ruskey \Lambda
- THE COOLEST WAY TO GENERATE COMBINATIONS FRANK RUSKEY AND AARON WILLIAMS
- A CAT Algorithm for Generating Permutations with a Fixed Number of
- Generating Necklaces Frank Ruskey * Carla Savage y
- Completely Separating Systems of k-Sets Colin Ramsay and Ian T. Roberts
- Venn Diagrams with Few Vertices Bette Bultena and Frank Ruskey
- Deconstructing Coroutines Donald E. Knuth and Frank Ruskey
- Which nVenn diagrams can be drawn with convex Jeremy Carroll + Frank Ruskey # Mark Weston #
- THE FELINE JOSEPHUS PROBLEM FRANK RUSKEY AND AARON WILLIAMS
- Minimum Area Venn Diagrams Whose Curves are Polyominoes
- FIBONACCI MEETS HOFSTADTER FRANK RUSKEY
- Simple combinatorial Gray codes constructed by reversing sublists
- METAFIBONACCI SEQUENCES, BINARY TREES, AND EXTREMAL COMPACT CODES
- Sequences that satisfy a(n-a(n)) = 0 Nate Kube # Frank Ruskey +
- Here we list and fix some small errors/typos that occur in the paper: Brad Jackson and Frank Ruskey, MetaFibonacci Sequences, Binary Trees and Extremal Compact Codes Electronic Journal
- COUNTING STRINGS WITH GIVEN ELEMENTARY SYMMETRIC FUNCTION EVALUATIONS I: STRINGS OVER ZP WITH P PRIME
- Minimum Area Venn Diagrams Whose Curves are Polyominoes
- Iterations of eccentric digraphs Mirka Miller
- THE NUMBER OF IRREDUCIBLE POLYNOMIALS AND LYNDON WORDS WITH GIVEN TRACE
- Generating Unlabeled Necklaces and Irreducible Polynomials over GF(2)
- Bent Hamilton Cycles in d-Dimensional Grid Graphs F. Ruskey * Joe Sawada y
- An Efficient Algorithm for Generating Necklaces with Fixed Density Joe Sawada* Frank Ruskeyy
- On Rotations and the Generation of Binary Trees
- Generating Linear Extensions of Posets by Transpositions
- Generating Permutations of a Bag by Interchanges Chun Wa Ko * Frank Ruskey y
- On the Hamiltonicity of Directed oe -o Cayley Graphs
- Transition Restricted Gray Codes Bette Bultena and Frank Ruskey
- THE COOLEST WAY TO GENERATE COMBINATIONS FRANK RUSKEY AND AARON WILLIAMS
- A CAT Algorithm for Generating Permutations with a Fixed Number of
- Alley CATs in search of good homes Frank Ruskey *
- Euclidean Strings John Ellisy, Frank Ruskeyy, Joe Sawada? and Jamie Simpsonz
- Generating Lyndon brackets. An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces
- UNCORRECTED DISC: 7292 + Model pp. 114 (col. fig: NIL)
- Completely Separating Systems of kSets Colin Ramsay and Ian T. Roberts
- META-FIBONACCI SEQUENCES, BINARY TREES, AND EXTREMAL COMPACT CODES
- THE COOLEST WAY TO GENERATE COMBINATIONS FRANK RUSKEY AND AARON WILLIAMS
- Symmetric Monotone Venn Diagrams with Seven Tao Cao, Khalegh Mamakani and Frank Ruskey
- AN EXPLICIT UNIVERSAL CYCLE FOR THE (n -1)-PERMUTATIONS OF AN n-SET
- Venn Diagrams with Few Vertices Bette Bultena and Frank Ruskey
- AN EXPLICIT UNIVERSAL CYCLE FOR THE (n -1)PERMUTATIONS OF AN nSET
- Efficient Generation of Subsets with a Given Sum
- THE RAND AND BLOCK INDEX OF PAIRS OF SET PARTITIONS FRANK RUSKEY AND JENNI WOODCOCK
- Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
- Auspicious tatami mat arrangements Alejandro Erickson
- AUSPICIOUS TATAMI MAT ARRANGEMENTS ALEJANDRO ERICKSON, FRANK RUSKEY, MARK SCHURCH, AND JENNI WOODCOCK
- Symmetric Venn Diagrams on the Sphere I: Chain Decompositions and Isometry Groups of Order
- MINIMUM AREA POLYOMINO VENN DIAGRAMS BETTE BULTENA, MATTHEW KLIMESH, AND FRANK RUSKEY
- Minimum Area Venn Diagrams Whose Curves are Polyominoes
- Towards a General Solution to Drawing Area-Proportional Euler Diagrams
- Half-Simple Symmetric Venn Diagrams Charles E. Killian
- COUNTING STRINGS WITH GIVEN ELEMENTARY SYMMETRIC FUNCTION EVALUATIONS II: CIRCULAR STRINGS
- The Feline Josephus Problem Frank Ruskey1 Aaron Williams1
- Faster Generation of Shorthand Universal Cycles for Permutations
- 1312 NOTICES OF THE AMS VOLUME 53, NUMBER 11 About the Cover
- Generating Lyndon brackets. An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces
- Information Processing Letters 79 (2001) 281284 Ranking and unranking permutations in linear time
- THE FELINE JOSEPHUS PROBLEM FRANK RUSKEY AND AARON WILLIAMS
- Symmetric Monotone Venn Diagrams with Seven Curves
- Generating Balanced Parentheses and Binary Trees by Prefix Shifts We show that the set Bn of balanced parentheses
- Iterations of eccentric digraphs Mirka Miller
- Sequences that satisfy a(n-a(n)) = 0 Frank Ruskey
- Generating combinations by prefix shifts Frank Ruskey
- COUNTING STRINGS WITH GIVEN ELEMENTARY SYMMETRIC FUNCTION EVALUATIONS I: STRINGS OVER ZP WITH P PRIME
- An Efficient Implementation of the Eades, Hickey, Read Adjacent Interchange Combination Generation
- Generating Necklaces and Strings with Forbidden Substrings
- A Gray Code for Combinations of a Multiset Frank Ruskey * Carla Savage y
- Euclidean Strings Frank Ruskey, U. Victoria, Victoria, CANADA
- Generating Binary Trees by Transpositions Frank Ruskey * and Andrzej Proskurowski y
- The Advantages of Forward Thinking in Generating Rooted and Free Trees
- META-FIBONACCI SEQUENCES, BINARY TREES, AND EXTREMAL COMPACT CODES
- The Prism of the Acyclic Orientation Graph is Hamiltonian
- Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings
- Simple combinatorial Gray codes constructed by reversing sublists
- Generating combinations by prefix shifts Frank Ruskey* Aaron Williamsy
- Gray Codes from Antimatroids Gara Pruesse *
- Efficient Generation of Subsets with a Given Sum
- GENERATING LINEAR EXTENSIONS FAST GARA PRUESSE* AND FRANK RUSKEYy
- Which n-Venn diagrams can be drawn with convex k-gons?
- Ranking and Unranking Permutations in Linear Time
- Generating Alternating Permutations Lexicographically
- Generating Linear Extensions of Posets by Transpositions
- Sequences that satisfy a(n-a(n)) = 0 Nate Kube* Frank Ruskeyy
- An Eades-McKay Algorithm for Well-Formed Parentheses Strings
- An Efficient Implementation of the Eades, Hickey, Read Adjacent Interchange Combination Generation
- Half-Simple Symmetric Venn Diagrams Charles E. Killian Frank Ruskey *
- A Gray Code for the Ideals of a Forest Poset Yasunori Koda and Frank Ruskey
- Area-Proportional Drawings of Intersecting Families of Simple Closed Curves Stirling Chow
- AreaProportional Drawings of Intersecting Families Simple Closed Curves Stirling Chow
- NESTED RECURRENCE RELATIONS WITH CONOLLY-LIKE ALEJANDRO ERICKSON, ABRAHAM ISGUR, BRADLEY W. JACKSON, FRANK RUSKEY*,
