Frank Ruskey

Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey: In-place permuting and perfect shuffling using involutions. Inf. Process. Lett. 113(10-11): 386-391 (2013)

Alexander E. Holroyd, Frank Ruskey, Aaron Williams: Shorthand Universal Cycles for Permutations. Algorithmica 64(2): 215-245 (2012)

Frank Ruskey, Joe Sawada, Aaron Williams: Binary bubble languages and cool-lex order. J. Comb. Theory, Ser. A 119(1): 155-169 (2012)

Frank Ruskey, Jennifer Woodcock, Yuji Yamauchi: Counting and computing the Rand and block distances of pairs of set partitions. J. Discrete Algorithms 16: 236-248 (2012)

Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey: Generating simple convex Venn diagrams. J. Discrete Algorithms 16: 270-286 (2012)

Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey, Aaron Williams: Cool-lex order and k-ary Catalan structures. J. Discrete Algorithms 16: 287-307 (2012)

Bette Bultena, Matthew Klimesh, Frank Ruskey: Minimum Area Polyomino Venn Diagrams. JoCG 3(1): 154-167 (2012)

Frank Ruskey, Aaron Williams: The Feline Josephus Problem. Theory Comput. Syst. 50(1): 20-34 (2012)

Alejandro Erickson, Abraham Isgur, Bradley W. Jackson, Frank Ruskey, Stephen M. Tanny: Nested Recurrence Relations with Conolly-like Solutions. SIAM J. Discrete Math. 26(1): 206-238 (2012)

Frank Ruskey, Joe Sawada, Aaron Williams: De Bruijn Sequences for Fixed-Weight Binary Strings. SIAM J. Discrete Math. 26(2): 605-617 (2012)

Marcel Celaya, Frank Ruskey: An Undecidable Nested Recurrence Relation. CiE 2012: 107-117

Khalegh Mamakani, Frank Ruskey: The First Simple Symmetric 11-Venn Diagram. Graph Drawing 2012: 563-565

Marcel Celaya, Frank Ruskey: An Undecidable Nested Recurrence Relation. CoRR abs/1203.0586 (2012)

Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey: Parallel and sequential in-place permuting and perfect shuffling using involutions. CoRR abs/1204.1958 (2012)

Khalegh Mamakani, Frank Ruskey: A New Rose : The First Simple Symmetric 11-Venn Diagram. CoRR abs/1207.6452 (2012)

Alejandro Erickson, Frank Ruskey, Jennifer Woodcock, Mark Schurch: Monomer-Dimer Tatami Tilings of Rectangular Regions. Electr. J. Comb. 18(1) (2011)

Frank Ruskey, Mark Weston: Spherical Venn Diagrams with Involutory Isometries. Electr. J. Comb. 18(1) (2011)

Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey: Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams. IWOCA 2011: 275-286

Frank Ruskey, Jennifer Woodcock: The Rand and Block Distances of Pairs of Set Partitions. IWOCA 2011: 287-299

Frank Ruskey, Aaron Williams: An explicit universal cycle for the (n-1)-permutations of an n-set. ACM Transactions on Algorithms 6(3) (2010)

Alejandro Erickson, Frank Ruskey, Mark Schurch, Jennifer Woodcock: Auspicious Tatami Mat Arrangements. COCOON 2010: 288-297

Alexander E. Holroyd, Frank Ruskey, Aaron Williams: Faster Generation of Shorthand Universal Cycles for Permutations. COCOON 2010: 298-307

Tao Cao, Khalegh Mamakani, Frank Ruskey: Symmetric Monotone Venn Diagrams with Seven Curves. FUN 2010: 331-342

Frank Ruskey, Aaron Williams: The Feline Josephus Problem. FUN 2010: 343-354

Frank Ruskey, Jennifer Woodcock: Counting Fixed-Height Tatami Tilings. Electr. J. Comb. 16(1) (2009)

Stirling Chow, Frank Ruskey: Gray codes for column-convex polyominoes and a new class of distributive lattices. Discrete Mathematics 309(17): 5284-5297 (2009)

Frank Ruskey, Aaron Williams: The coolest way to generate combinations. Discrete Mathematics 309(17): 5305-5320 (2009)

Frank Ruskey, Aaron Williams: Generating Balanced Parentheses and Binary Trees by Prefix Shifts. CATS 2008: 107-115

Jeremy Carroll, Frank Ruskey, Mark Weston: Which n-Venn Diagrams Can Be Drawn with Convex k-Gons? Discrete & Computational Geometry 37(4): 619-628 (2007)

Frank Ruskey, Aaron Williams: An explicit universal cycle for the (n-1)-permutations of an n-set. CoRR abs/0710.1842 (2007)

Bradley W. Jackson, Frank Ruskey: Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes. Electr. J. Comb. 13(1) (2006)

Frank Ruskey, Mark Weston: More Fun with Symmetric Venn Diagrams. Theory Comput. Syst. 39(3): 413-423 (2006)

Stirling Chow, Frank Ruskey: Towards a General Solution to Drawing Area-Proportional Euler Diagrams. Electr. Notes Theor. Comput. Sci. 134: 3-18 (2005)

Stirling Chow, Frank Ruskey: Area-Proportional Drawings of Intersecting Families of Simple Closed Curves. CCCG 2005: 121-124

Frank Ruskey, Aaron Williams: Generating Combinations by Prefix Shifts. COCOON 2005: 570-576

Jeremy Carroll, Frank Ruskey, Mark Weston: Which n-Venn diagrams can be drawn with convex k-gons? CoRR abs/cs/0512001 (2005)

Charles E. Killian, Frank Ruskey, Carla D. Savage, Mark Weston: Half-Simple Symmetric Venn Diagrams. Electr. J. Comb. 11(1) (2004)

C. Robert Miers, Frank Ruskey: Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Z_p with p Prime. SIAM J. Discrete Math. 17(4): 675-685 (2004)

C. Robert Miers, Frank Ruskey: Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings. SIAM J. Discrete Math. 18(1): 71-82 (2004)

Donald E. Knuth, Frank Ruskey: Efficient Coroutine Generation of Constrained Gray Sequences. Essays in Memory of Ole-Johan Dahl 2004: 183-208

Frank Ruskey, Joe Sawada: Bent Hamilton Cycles in d-Dimensional Grid Graphs. Electr. J. Comb. 10 (2003)

Scott Effler, Frank Ruskey: A CAT algorithm for generating permutations with a fixed number of inversions. Inf. Process. Lett. 86(2): 107-112 (2003)

Joe Sawada, Frank Ruskey: Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2). J. Algorithms 46(1): 21-26 (2003)

John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson: Euclidean strings. Theor. Comput. Sci. 1-3(301): 321-340 (2003)

L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada: Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2): 303-317 (2003)

Stirling Chow, Frank Ruskey: Drawing Area-Proportional Venn and Euler Diagrams. Graph Drawing 2003: 466-477

Frank Ruskey: Drawing Venn Diagrams. Graph Drawing 2002: 381

Wendy J. Myrvold, Frank Ruskey: Ranking and unranking permutations in linear time. Inf. Process. Lett. 79(6): 281-284 (2001)

Frank Ruskey, C. Robert Miers, Joe Sawada: The Number of Irreducible Polynomials and Lyndon Words with Given Trace. SIAM J. Discrete Math. 14(2): 240-245 (2001)

Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers: Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). J. Algorithms 37(2): 267-282 (2000)

Thomas Ball, Daniel Hoffman, Frank Ruskey, Richard Webber, Lee J. White: State Generation and Automated Class Testing. Softw. Test., Verif. Reliab. 10(3): 149-170 (2000)

Frank Ruskey, Joe Sawada: Generating Necklaces and Strings with Forbidden Substrings. COCOON 2000: 330-339

Frank Ruskey, Joe Sawada: A fast algorithm to generate unlabeled necklaces. SODA 2000: 256-262

Frank Ruskey, Joe Sawada: An Efficient Algorithm for Generating Necklaces with Fixed Density. SIAM J. Comput. 29(2): 671-684 (1999)

Bette Bultena, Branko Grünbaum, Frank Ruskey: Convex drawings of intersecting families of simple closed curves. CCCG 1999

Joe Sawada, Frank Ruskey: An Efficient Algorithm for Generating Necklaces with Fixed Density. SODA 1999: 752-758

Gang Li, Frank Ruskey: The Advantages of Forward Thinking in Generating Rooted and Free Trees. SODA 1999: 939-940

Bette Bultena, Frank Ruskey: Venn Diagrams with Few Vertices. Electr. J. Comb. 5 (1998)

Colin Ramsay, Ian T. Roberts, Frank Ruskey: Completely separating systems of k-sets. Discrete Mathematics 183(1-3): 265-275 (1998)

Bette Bultena, Frank Ruskey: An Eades-McKay Algorithm for Well-Formed Parentheses Strings. Inf. Process. Lett. 68(5): 255-259 (1998)

Andrzej Proskurowski, Frank Ruskey, Malcolm Smith: Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings. SIAM J. Discrete Math. 11(1): 94-109 (1998)

Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997)

Bette Bultena, Frank Ruskey: Transition Restricted Gray Codes. Electr. J. Comb. 3(1) (1996)

Frank Ruskey, Carla D. Savage: A Gray Code for Combinations of a Multiset. Eur. J. Comb. 17(5): 493-500 (1996)

Gara Pruesse, Frank Ruskey: The Prism of the Acyclic Orientation Graph is Hamiltonian. Electr. J. Comb. 2 (1995)

Frank Ruskey, Ming Jiang, Andrew Weston: The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking). Discrete Applied Mathematics 57(1): 75-83 (1995)

Ming Jiang, Frank Ruskey: Determining the hamilton-connectedness of certain vertex-transitive graphs. Discrete Mathematics 133(1-3): 159-169 (1994)

Gara Pruesse, Frank Ruskey: Generating Linear Extensions Fast. SIAM J. Comput. 23(2): 373-386 (1994)

Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Volume upper bounds for 3D graph drawing. CASCON 1994: 11

Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Graph Drawing 1994: 1-11

Yasunori Koda, Frank Ruskey: A Gray Code for the Ideals of a Forest Poset. J. Algorithms 15(2): 324-340 (1993)

Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey: On Rotations and the Generation of Binary Trees. J. Algorithms 15(3): 343-366 (1993)

Frank Ruskey, Carla D. Savage: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of S_n. SIAM J. Discrete Math. 6(1): 152-166 (1993)

Frank Ruskey: Simple Combinatorial Gray Codes Constructed by Reversing Sublists. ISAAC 1993: 201-208

Dominique Roelants van Baronaigien, Frank Ruskey: Generating permutations with given ups and downs. Discrete Applied Mathematics 36(1): 57-65 (1992)

Chun Wa Ko, Frank Ruskey: Generating Permutations of a Bag by Interchanges. Inf. Process. Lett. 41(5): 263-269 (1992)

Frank Ruskey, Carla D. Savage, Terry Min Yih Wang: Generating Necklaces. J. Algorithms 13(3): 414-430 (1992)

Frank Ruskey: Generating linear extensions of posets by transpositions. J. Comb. Theory, Ser. B 54(1): 77-101 (1992)

Gara Pruesse, Frank Ruskey: Generating the Linear Extensions of Certain Posets by Transpositions. SIAM J. Discrete Math. 4(3): 413-422 (1991)

Bruce L. Bauslaugh, Frank Ruskey: Generating Alternating Permutations Lexicographically. BIT 30(1): 17-26 (1990)

Frank Ruskey, Andrzej Proskurowski: Generating Binary Trees by Transpositions. J. Algorithms 11(1): 68-84 (1990)

C. W. Ko, Frank Ruskey: Solution of some multi-dimensional lattice path parity difference recurrence relations. Discrete Mathematics 71(1): 47-56 (1988)

Dominique Roelants van Baronaigien, Frank Ruskey: Generating t-ary Trees in A-Order. Inf. Process. Lett. 27(4): 205-213 (1988)

Frank Ruskey: Adjacent Interchange Generation of Combinations. J. Algorithms 9(2): 162-180 (1988)

Andrzej Proskurowski, Frank Ruskey: Generating Binary Trees by Transpositions. SWAT 1988: 199-207

Andrzej Proskurowski, Frank Ruskey: Binary Tree Gray Codes. J. Algorithms 6(2): 225-238 (1985)

Frank Ruskey: A simple proof of a formula of Dershowitz and Zaks. Discrete Mathematics 43(1): 117-118 (1983)

Peter Eichhorst, Frank Ruskey: On Unary Stochastic Lindenmayer Systems. Information and Control 48(1): 1-10 (1981)

Frank Ruskey: Listing and Counting Subtrees of a Tree. SIAM J. Comput. 10(1): 141-150 (1981)

Ernest J. Cockayne, Frank Ruskey, A. G. Thomason: An Algorithm for the Most Economic Link Addition in a Tree Communication Network. Inf. Process. Lett. 9(4): 171-175 (1979)

Frank Ruskey: Generating t-ary Trees Lexicographically. SIAM J. Comput. 7(4): 424-439 (1978)

Frank Ruskey, T. C. Hu: Generating Binary Trees Lexicographically. SIAM J. Comput. 6(4): 745-758 (1977)