Frank Ruskey

ORCID

Publication Activity (10 Years)

Years Active: 1977-2019
Publications (10 Years): 3

Top Venues

CoRR

J. Discrete Algorithms

SIAM J. Discret. Math.

J. Comb. Theory, Ser. A

Publications

Veronika Irvine, Stephen Melczer, Frank Ruskey
Vertically Constrained Motzkin-Like Paths Inspired by Bobbin Lace. Electron. J. Comb. 26 (2) (2019)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659 (2017)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
On Prefix Normal Words and Prefix Normal Forms. CoRR (2016)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
Normal, Abby Normal, Prefix Normal. FUN (2014)
Khalegh Mamakani, Frank Ruskey
New Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves. Discret. Comput. Geom. 52 (1) (2014)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
On Combinatorial Generation of Prefix Normal Words. CPM (2014)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
Normal, Abby Normal, Prefix Normal. CoRR (2014)
Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
On Combinatorial Generation of Prefix Normal Words. CoRR (2014)
Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey
In-place permuting and perfect shuffling using involutions. Inf. Process. Lett. 113 (10-11) (2013)
Alejandro Erickson, Frank Ruskey
Domino Tatami Covering Is NP-Complete. IWOCA (2013)
Alejandro Erickson, Frank Ruskey
Domino Tatami Covering is NP-complete CoRR (2013)
Marcel Celaya, Frank Ruskey
An Undecidable Nested Recurrence Relation. CiE (2012)
Frank Ruskey, Joe Sawada, Aaron Williams
De Bruijn Sequences for Fixed-Weight Binary Strings. SIAM J. Discret. Math. 26 (2) (2012)
Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey
Generating simple convex Venn diagrams. J. Discrete Algorithms 16 (2012)
Khalegh Mamakani, Frank Ruskey
The First Simple Symmetric 11-Venn Diagram. Graph Drawing (2012)
Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey, Aaron Williams
Cool-lex order and k-ary Catalan structures. J. Discrete Algorithms 16 (2012)
Khalegh Mamakani, Frank Ruskey
A New Rose : The First Simple Symmetric 11-Venn Diagram CoRR (2012)
Frank Ruskey, Jennifer Woodcock, Yuji Yamauchi
Counting and computing the Rand and block distances of pairs of set partitions. J. Discrete Algorithms 16 (2012)
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
Shorthand Universal Cycles for Permutations. Algorithmica 64 (2) (2012)
Alejandro Erickson, Abraham Isgur, Bradley W. Jackson, Frank Ruskey, Stephen M. Tanny
Nested Recurrence Relations with Conolly-like Solutions. SIAM J. Discret. Math. 26 (1) (2012)
Bette Bultena, Matthew Klimesh, Frank Ruskey
Minimum Area Polyomino Venn Diagrams. J. Comput. Geom. 3 (1) (2012)
Frank Ruskey, Joe Sawada, Aaron Williams
Binary bubble languages and cool-lex order. J. Comb. Theory, Ser. A 119 (1) (2012)
Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey
Parallel and sequential in-place permuting and perfect shuffling using involutions CoRR (2012)
Frank Ruskey, Aaron Williams
The Feline Josephus Problem. Theory Comput. Syst. 50 (1) (2012)
Marcel Celaya, Frank Ruskey
An Undecidable Nested Recurrence Relation CoRR (2012)
Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams. IWOCA (2011)
Frank Ruskey, Mark Weston
Spherical Venn Diagrams with Involutory Isometries. Electron. J. Comb. 18 (1) (2011)
Frank Ruskey, Jennifer Woodcock
The Rand and Block Distances of Pairs of Set Partitions. IWOCA (2011)
Alejandro Erickson, Frank Ruskey, Jennifer Woodcock, Mark Schurch
Monomer-Dimer Tatami Tilings of Rectangular Regions. Electron. J. Comb. 18 (1) (2011)
Alejandro Erickson, Frank Ruskey, Mark Schurch, Jennifer Woodcock
Auspicious Tatami Mat Arrangements. COCOON (2010)
Frank Ruskey, Aaron Williams
-set. ACM Trans. Algorithms 6 (3) (2010)
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
Faster Generation of Shorthand Universal Cycles for Permutations. COCOON (2010)
Frank Ruskey, Aaron Williams
The Feline Josephus Problem. FUN (2010)
Tao Cao, Khalegh Mamakani, Frank Ruskey
Symmetric Monotone Venn Diagrams with Seven Curves. FUN (2010)
Stirling Chow, Frank Ruskey
Gray codes for column-convex polyominoes and a new class of distributive lattices. Discret. Math. 309 (17) (2009)
Frank Ruskey, Aaron Williams
The coolest way to generate combinations. Discret. Math. 309 (17) (2009)
Frank Ruskey, Jennifer Woodcock
Counting Fixed-Height Tatami Tilings. Electron. J. Comb. 16 (1) (2009)
Frank Ruskey, Aaron Williams
Generating Balanced Parentheses and Binary Trees by Prefix Shifts. CATS (2008)
Jeremy Carroll, Frank Ruskey, Mark Weston
Which n-Venn Diagrams Can Be Drawn with Convex k-Gons? Discret. Comput. Geom. 37 (4) (2007)
Frank Ruskey, Aaron Williams
An explicit universal cycle for the (n-1)-permutations of an n-set CoRR (2007)
Frank Ruskey, Mark Weston
More Fun with Symmetric Venn Diagrams. Theory Comput. Syst. 39 (3) (2006)
Bradley W. Jackson, Frank Ruskey
Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes. Electron. J. Comb. 13 (1) (2006)
Jeremy Carroll, Frank Ruskey, Mark Weston
Which n-Venn diagrams can be drawn with convex k-gons? CoRR (2005)
Stirling Chow, Frank Ruskey
Towards a General Solution to Drawing Area-Proportional Euler Diagrams. Electron. Notes Theor. Comput. Sci. 134 (2005)
Stirling Chow, Frank Ruskey
Area-Proportional Drawings of Intersecting Families of Simple Closed Curves. CCCG (2005)
Frank Ruskey, Aaron Williams
Generating Combinations by Prefix Shifts. COCOON (2005)
Charles E. Killian, Frank Ruskey, Carla D. Savage, Mark Weston
Half-Simple Symmetric Venn Diagrams. Electron. J. Comb. 11 (1) (2004)
Donald E. Knuth, Frank Ruskey
Efficient Coroutine Generation of Constrained Gray Sequences. Essays in Memory of Ole-Johan Dahl (2004)
C. Robert Miers, Frank Ruskey
Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings. SIAM J. Discret. Math. 18 (1) (2004)
C. Robert Miers, Frank Ruskey
with p Prime. SIAM J. Discret. Math. 17 (4) (2004)
Stirling Chow, Frank Ruskey
Drawing Area-Proportional Venn and Euler Diagrams. Graph Drawing (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) (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) (2003)
John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson
Euclidean strings. Theor. Comput. Sci. 301 (1-3) (2003)
Scott Effler, Frank Ruskey
A CAT algorithm for generating permutations with a fixed number of inversions. Inf. Process. Lett. 86 (2) (2003)
Frank Ruskey, Joe Sawada
Bent Hamilton Cycles in d-Dimensional Grid Graphs. Electron. J. Comb. 10 (2003)
Frank Ruskey
Drawing Venn Diagrams. Graph Drawing (2002)
Frank Ruskey, C. Robert Miers, Joe Sawada
The Number of Irreducible Polynomials and Lyndon Words with Given Trace. SIAM J. Discret. Math. 14 (2) (2001)
Wendy J. Myrvold, Frank Ruskey
Ranking and unranking permutations in linear time. Inf. Process. Lett. 79 (6) (2001)
Frank Ruskey, Joe Sawada
A fast algorithm to generate unlabeled necklaces. SODA (2000)
Frank Ruskey, Joe Sawada
Generating Necklaces and Strings with Forbidden Substrings. COCOON (2000)
Thomas Ball, Daniel Hoffman, Frank Ruskey, Richard Webber, Lee J. White
State Generation and Automated Class Testing. Softw. Test. Verification Reliab. 10 (3) (2000)
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) (2000)
Gang Li, Frank Ruskey
The Advantages of Forward Thinking in Generating Rooted and Free Trees. SODA (1999)
Joe Sawada, Frank Ruskey
An Efficient Algorithm for Generating Necklaces with Fixed Density. SODA (1999)
Bette Bultena, Branko Grünbaum, Frank Ruskey
Convex drawings of intersecting families of simple closed curves. CCCG (1999)
Frank Ruskey, Joe Sawada
An Efficient Algorithm for Generating Necklaces with Fixed Density. SIAM J. Comput. 29 (2) (1999)
Colin Ramsay, Ian T. Roberts, Frank Ruskey
Completely separating systems of k-sets. Discret. Math. 183 (1-3) (1998)
Bette Bultena, Frank Ruskey
Venn Diagrams with Few Vertices. Electron. J. Comb. 5 (1998)
Bette Bultena, Frank Ruskey
An Eades-McKay Algorithm for Well-Formed Parentheses Strings. Inf. Process. Lett. 68 (5) (1998)
Andrzej Proskurowski, Frank Ruskey, Malcolm Smith
-ary Strings. SIAM J. Discret. Math. 11 (1) (1998)
Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
Three-Dimensional Graph Drawing. Algorithmica 17 (2) (1997)
Frank Ruskey, Carla D. Savage
A Gray Code for Combinations of a Multiset. Eur. J. Comb. 17 (5) (1996)
Bette Bultena, Frank Ruskey
Transition Restricted Gray Codes. Electron. J. Comb. 3 (1) (1996)
Gara Pruesse, Frank Ruskey
The Prism of the Acyclic Orientation Graph is Hamiltonian. Electron. J. Comb. 2 (1995)
Frank Ruskey, Ming Jiang, Andrew Weston
The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking). Discret. Appl. Math. 57 (1) (1995)
Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
Three-Dimensional Graph Drawing. Graph Drawing (1994)
Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
Volume upper bounds for 3D graph drawing. CASCON (1994)
Frank Ruskey, Carla D. Savage
Gray codes for set partitions and restricted growth tails. Australas. J Comb. 10 (1994)
Ming Jiang, Frank Ruskey
Determining the hamilton-connectedness of certain vertex-transitive graphs. Discret. Math. 133 (1-3) (1994)
Gara Pruesse, Frank Ruskey
Generating Linear Extensions Fast. SIAM J. Comput. 23 (2) (1994)
Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey
On Rotations and the Generation of Binary Trees. J. Algorithms 15 (3) (1993)
Frank Ruskey, Carla D. Savage
. SIAM J. Discret. Math. 6 (1) (1993)
Frank Ruskey
Simple Combinatorial Gray Codes Constructed by Reversing Sublists. ISAAC (1993)
Yasunori Koda, Frank Ruskey
A Gray Code for the Ideals of a Forest Poset. J. Algorithms 15 (2) (1993)
Frank Ruskey, Carla D. Savage, Terry Min Yih Wang
Generating Necklaces. J. Algorithms 13 (3) (1992)
Frank Ruskey
Generating linear extensions of posets by transpositions. J. Comb. Theory, Ser. B 54 (1) (1992)
Dominique Roelants van Baronaigien, Frank Ruskey
Generating permutations with given ups and downs. Discret. Appl. Math. 36 (1) (1992)
Chun Wa Ko, Frank Ruskey
Generating Permutations of a Bag by Interchanges. Inf. Process. Lett. 41 (5) (1992)
Gara Pruesse, Frank Ruskey
Generating the Linear Extensions of Certain Posets by Transpositions. SIAM J. Discret. Math. 4 (3) (1991)
Frank Ruskey, Andrzej Proskurowski
Generating Binary Trees by Transpositions. J. Algorithms 11 (1) (1990)
Bruce L. Bauslaugh, Frank Ruskey
Generating Alternating Permutations Lexicographically. BIT 30 (1) (1990)
Dominique Roelants van Baronaigien, Frank Ruskey
Generating t-ary Trees in A-Order. Inf. Process. Lett. 27 (4) (1988)
Frank Ruskey
Adjacent Interchange Generation of Combinations. J. Algorithms 9 (2) (1988)
Andrzej Proskurowski, Frank Ruskey
Generating Binary Trees by Transpositions. SWAT (1988)
C. W. Ko, Frank Ruskey
Solution of some multi-dimensional lattice path parity difference recurrence relations. Discret. Math. 71 (1) (1988)
T. C. Hu, Yue-Sun Kuo, Frank Ruskey
Some Optimum Algorithms for Scheduling Problems with Changeover Costs. Oper. Res. 35 (1) (1987)
Andrzej Proskurowski, Frank Ruskey
Binary Tree Gray Codes. J. Algorithms 6 (2) (1985)
Frank Ruskey
A simple proof of a formula of Dershowitz and Zaks. Discret. Math. 43 (1) (1983)
Peter Eichhorst, Frank Ruskey
On Unary Stochastic Lindenmayer Systems Inf. Control. 48 (1) (1981)

Frank Ruskey.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frank Ruskey