Frank Ruskey

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