Frank Ruskey

According to our database1, Frank Ruskey authored at least 96 papers between 1977 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
On prefix normal words and prefix normal forms.
Theor. Comput. Sci., 2017

2016
Combinatorial Gray Code.
Encyclopedia of Algorithms, 2016

2014
New Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves.
Discrete & Computational Geometry, 2014

Normal, Abby Normal, Prefix Normal.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

On Combinatorial Generation of Prefix Normal Words.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
In-place permuting and perfect shuffling using involutions.
Inf. Process. Lett., 2013

Domino Tatami Covering Is NP-Complete.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
De Bruijn Sequences for Fixed-Weight Binary Strings.
SIAM J. Discrete Math., 2012

Nested Recurrence Relations with Conolly-like Solutions.
SIAM J. Discrete Math., 2012

The Feline Josephus Problem.
Theory Comput. Syst., 2012

Minimum Area Polyomino Venn Diagrams.
JoCG, 2012

Counting and computing the Rand and block distances of pairs of set partitions.
J. Discrete Algorithms, 2012

Generating simple convex Venn diagrams.
J. Discrete Algorithms, 2012

Cool-lex order and k-ary Catalan structures.
J. Discrete Algorithms, 2012

Binary bubble languages and cool-lex order.
J. Comb. Theory, Ser. A, 2012

A New Rose : The First Simple Symmetric 11-Venn Diagram
CoRR, 2012

Parallel and sequential in-place permuting and perfect shuffling using involutions
CoRR, 2012

Shorthand Universal Cycles for Permutations.
Algorithmica, 2012

The First Simple Symmetric 11-Venn Diagram.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

An Undecidable Nested Recurrence Relation.
Proceedings of the How the World Computes, 2012

2011
Spherical Venn Diagrams with Involutory Isometries.
Electr. J. Comb., 2011

Monomer-Dimer Tatami Tilings of Rectangular Regions.
Electr. J. Comb., 2011

The Rand and Block Distances of Pairs of Set Partitions.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010
An explicit universal cycle for the (n-1)-permutations of an n-set.
ACM Trans. Algorithms, 2010

Symmetric Monotone Venn Diagrams with Seven Curves.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Faster Generation of Shorthand Universal Cycles for Permutations.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Auspicious Tatami Mat Arrangements.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
The coolest way to generate combinations.
Discret. Math., 2009

Gray codes for column-convex polyominoes and a new class of distributive lattices.
Discret. Math., 2009

Counting Fixed-Height Tatami Tilings.
Electr. J. Comb., 2009

2008
Generating Balanced Parentheses and Binary Trees by Prefix Shifts.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007
Which n-Venn Diagrams Can Be Drawn with Convex k-Gons?
Discrete & Computational Geometry, 2007

An explicit universal cycle for the (n-1)-permutations of an n-set
CoRR, 2007

2006
More Fun with Symmetric Venn Diagrams.
Theory Comput. Syst., 2006

Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes.
Electr. J. Comb., 2006

2005
Towards a General Solution to Drawing Area-Proportional Euler Diagrams.
Electron. Notes Theor. Comput. Sci., 2005

Generating Combinations by Prefix Shifts.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Area-Proportional Drawings of Intersecting Families of Simple Closed Curves.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings.
SIAM J. Discrete Math., 2004

Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Zp with p Prime.
SIAM J. Discrete Math., 2004

Half-Simple Symmetric Venn Diagrams.
Electr. J. Comb., 2004

Efficient Coroutine Generation of Constrained Gray Sequences.
Proceedings of the From Object-Orientation to Formal Methods, 2004

2003
Euclidean strings.
Theor. Comput. Sci., 2003

Generating and characterizing the perfect elimination orderings of a chordal graph.
Theor. Comput. Sci., 2003

Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2).
J. Algorithms, 2003

A CAT algorithm for generating permutations with a fixed number of inversions.
Inf. Process. Lett., 2003

Bent Hamilton Cycles in d-Dimensional Grid Graphs.
Electr. J. Comb., 2003

Drawing Area-Proportional Venn and Euler Diagrams.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Drawing Venn Diagrams.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001
The Number of Irreducible Polynomials and Lyndon Words with Given Trace.
SIAM J. Discrete Math., 2001

Ranking and unranking permutations in linear time.
Inf. Process. Lett., 2001

2000
State Generation and Automated Class Testing.
Softw. Test., Verif. Reliab., 2000

Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2).
J. Algorithms, 2000

A fast algorithm to generate unlabeled necklaces.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Generating Necklaces and Strings with Forbidden Substrings.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
An Efficient Algorithm for Generating Necklaces with Fixed Density.
SIAM J. Comput., 1999

The Advantages of Forward Thinking in Generating Rooted and Free Trees.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Convex drawings of intersecting families of simple closed curves.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings.
SIAM J. Discrete Math., 1998

An Eades-McKay Algorithm for Well-Formed Parentheses Strings.
Inf. Process. Lett., 1998

Completely separating systems of k-sets.
Discret. Math., 1998

Venn Diagrams with Few Vertices.
Electr. J. Comb., 1998

1997
Three-Dimensional Graph Drawing.
Algorithmica, 1997

1996
A Gray Code for Combinations of a Multiset.
Eur. J. Comb., 1996

Transition Restricted Gray Codes.
Electr. J. Comb., 1996

1995
The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking).
Discret. Appl. Math., 1995

The Prism of the Acyclic Orientation Graph is Hamiltonian.
Electr. J. Comb., 1995

1994
Generating Linear Extensions Fast.
SIAM J. Comput., 1994

Determining the hamilton-connectedness of certain vertex-transitive graphs.
Discret. Math., 1994

Gray codes for set partitions and restricted growth tails.
Australasian J. Combinatorics, 1994

Volume upper bounds for 3D graph drawing.
Proceedings of the 1994 Conference of the Centre for Advanced Studies on Collaborative Research, October 31, 1994

1993
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn.
SIAM J. Discrete Math., 1993

On Rotations and the Generation of Binary Trees.
J. Algorithms, 1993

A Gray Code for the Ideals of a Forest Poset.
J. Algorithms, 1993

Simple Combinatorial Gray Codes Constructed by Reversing Sublists.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
Generating linear extensions of posets by transpositions.
J. Comb. Theory, Ser. B, 1992

Generating Necklaces.
J. Algorithms, 1992

Generating Permutations of a Bag by Interchanges.
Inf. Process. Lett., 1992

Generating permutations with given ups and downs.
Discret. Appl. Math., 1992

1991
Generating the Linear Extensions of Certain Posets by Transpositions.
SIAM J. Discrete Math., 1991

1990
Generating Binary Trees by Transpositions.
J. Algorithms, 1990

Generating Alternating Permutations Lexicographically.
BIT, 1990

1988
Adjacent Interchange Generation of Combinations.
J. Algorithms, 1988

Generating t-ary Trees in A-Order.
Inf. Process. Lett., 1988

Solution of some multi-dimensional lattice path parity difference recurrence relations.
Discret. Math., 1988

1987
Some Optimum Algorithms for Scheduling Problems with Changeover Costs.
Operations Research, 1987

1985
Binary Tree Gray Codes.
J. Algorithms, 1985

1983
A simple proof of a formula of Dershowitz and Zaks.
Discret. Math., 1983

1981
On Unary Stochastic Lindenmayer Systems
Information and Control, January, 1981

Listing and Counting Subtrees of a Tree.
SIAM J. Comput., 1981

1980
On the Average Shape of Binary Trees.
SIAM J. Matrix Analysis Applications, 1980

Circular Cuts in a Network.
Math. Oper. Res., 1980

1979
An Algorithm for the Most Economic Link Addition in a Tree Communication Network.
Inf. Process. Lett., 1979

1978
Generating t-ary Trees Lexicographically.
SIAM J. Comput., 1978

1977
Generating Binary Trees Lexicographically.
SIAM J. Comput., 1977


  Loading...