Search results for "Frank Ruskey"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Frank Ruskey, Joe Sawada, Aaron Williams	Binary bubble languages and cool-lex order.	J. Comb. Theory, Ser. A	2012	DBLP DOI BibTeX RDF
1	Marcel Celaya, Frank Ruskey	An Undecidable Nested Recurrence Relation	CoRR	2012	DBLP BibTeX RDF
1	Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey	Parallel and sequential in-place permuting and perfect shuffling using involutions	CoRR	2012	DBLP BibTeX RDF
1	Alejandro Erickson, Abraham Isgur, Bradley W. Jackson, Frank Ruskey, Stephen M. Tanny	Nested Recurrence Relations with Conolly-like Solutions.	SIAM J. Discrete Math.	2012	DBLP DOI BibTeX RDF
1	Frank Ruskey, Aaron Williams	The Feline Josephus Problem.	Theory Comput. Syst.	2012	DBLP DOI BibTeX RDF
1	Alejandro Erickson, Frank Ruskey, Jennifer Woodcock, Mark Schurch	Monomer-Dimer Tatami Tilings of Rectangular Regions.	Electr. J. Comb.	2011	DBLP BibTeX RDF
1	Frank Ruskey, Mark Weston	Spherical Venn Diagrams with Involutory Isometries.	Electr. J. Comb.	2011	DBLP BibTeX RDF
1	Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey	Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams.	IWOCA	2011	DBLP DOI BibTeX RDF
1	Frank Ruskey, Jennifer Woodcock	The Rand and Block Distances of Pairs of Set Partitions.	IWOCA	2011	DBLP DOI BibTeX RDF
1	Frank Ruskey, Aaron Williams	An explicit universal cycle for the (n-1)-permutations of an n-set.	ACM Transactions on Algorithms	2010	DBLP DOI BibTeX RDF
1	Tao Cao, Khalegh Mamakani, Frank Ruskey	Symmetric Monotone Venn Diagrams with Seven Curves.	FUN	2010	DBLP DOI BibTeX RDF
1	Frank Ruskey, Aaron Williams	The Feline Josephus Problem.	FUN	2010	DBLP DOI BibTeX RDF
1	Alejandro Erickson, Frank Ruskey, Mark Schurch, Jennifer Woodcock	Auspicious Tatami Mat Arrangements.	COCOON	2010	DBLP DOI BibTeX RDF
1	Alexander E. Holroyd, Frank Ruskey, Aaron Williams	Faster Generation of Shorthand Universal Cycles for Permutations.	COCOON	2010	DBLP DOI BibTeX RDF
1	Frank Ruskey, Aaron Williams	The coolest way to generate combinations.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Stirling Chow, Frank Ruskey	Gray codes for column-convex polyominoes and a new class of distributive lattices.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Frank Ruskey, Jennifer Woodcock	Counting Fixed-Height Tatami Tilings.	Electr. J. Comb.	2009	DBLP BibTeX RDF
1	Frank Ruskey, Aaron Williams	Generating Balanced Parentheses and Binary Trees by Prefix Shifts.	CATS	2008	DBLP BibTeX RDF
1	Jeremy Carroll, Frank Ruskey, Mark Weston	Which n-Venn Diagrams Can Be Drawn with Convex k-Gons?	Discrete & Computational Geometry	2007	DBLP DOI BibTeX RDF
1	Frank Ruskey, Aaron Williams	An explicit universal cycle for the (n-1)-permutations of an n-set	CoRR	2007	DBLP BibTeX RDF
1	Bradley W. Jackson, Frank Ruskey	Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes.	Electr. J. Comb.	2006	DBLP BibTeX RDF
1	Frank Ruskey, Mark Weston	More Fun with Symmetric Venn Diagrams.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
1	Stirling Chow, Frank Ruskey	Towards a General Solution to Drawing Area-Proportional Euler Diagrams.	Electr. Notes Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
1	Jeremy Carroll, Frank Ruskey, Mark Weston	Which n-Venn diagrams can be drawn with convex k-gons?	CoRR	2005	DBLP BibTeX RDF
1	Stirling Chow, Frank Ruskey	Area-Proportional Drawings of Intersecting Families of Simple Closed Curves.	CCCG	2005	DBLP BibTeX RDF
1	Frank Ruskey, Aaron Williams	Generating Combinations by Prefix Shifts.	COCOON	2005	DBLP DOI BibTeX RDF
1	Charles E. Killian, Frank Ruskey, Carla D. Savage, Mark Weston	Half-Simple Symmetric Venn Diagrams.	Electr. J. Comb.	2004	DBLP BibTeX RDF
1	C. Robert Miers, Frank Ruskey	Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings.	SIAM J. Discrete Math.	2004	DBLP DOI BibTeX RDF
1	C. Robert Miers, Frank Ruskey	Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Zp with p Prime.	SIAM J. Discrete Math.	2004	DBLP DOI BibTeX RDF
1	Donald E. Knuth, Frank Ruskey	Efficient Coroutine Generation of Constrained Gray Sequences.	Essays in Memory of Ole-Johan Dahl	2004	DBLP DOI BibTeX RDF
1	Scott Effler, Frank Ruskey	A CAT algorithm for generating permutations with a fixed number of inversions.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
1	L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada	Generating and characterizing the perfect elimination orderings of a chordal graph.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson	Euclidean strings.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Frank Ruskey, Joe Sawada	Bent Hamilton Cycles in d-Dimensional Grid Graphs.	Electr. J. Comb.	2003	DBLP BibTeX RDF
1	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	2003	DBLP DOI BibTeX RDF
1	Stirling Chow, Frank Ruskey	Drawing Area-Proportional Venn and Euler Diagrams.	Graph Drawing	2003	DBLP DOI BibTeX RDF
1	Frank Ruskey	Drawing Venn Diagrams.	Graph Drawing	2002	DBLP DOI BibTeX RDF
1	Wendy J. Myrvold, Frank Ruskey	Ranking and unranking permutations in linear time.	Inf. Process. Lett.	2001	DBLP DOI BibTeX RDF
1	Frank Ruskey, C. Robert Miers, Joe Sawada	The Number of Irreducible Polynomials and Lyndon Words with Given Trace.	SIAM J. Discrete Math.	2001	DBLP DOI BibTeX RDF
1	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	2000	DBLP DOI BibTeX RDF
1	Thomas Ball, Daniel Hoffman, Frank Ruskey, Richard Webber, Lee J. White	State Generation and Automated Class Testing.	Softw. Test., Verif. Reliab.	2000	DBLP DOI BibTeX RDF
1	Frank Ruskey, Joe Sawada	A fast algorithm to generate unlabeled necklaces.	SODA	2000	DBLP DOI BibTeX RDF
1	Frank Ruskey, Joe Sawada	Generating Necklaces and Strings with Forbidden Substrings.	COCOON	2000	DBLP DOI BibTeX RDF
1	Frank Ruskey, Joe Sawada	An Efficient Algorithm for Generating Necklaces with Fixed Density.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Gang Li, Frank Ruskey	The Advantages of Forward Thinking in Generating Rooted and Free Trees.	SODA	1999	DBLP DOI BibTeX RDF
1	Joe Sawada, Frank Ruskey	An Efficient Algorithm for Generating Necklaces with Fixed Density.	SODA	1999	DBLP DOI BibTeX RDF
1	Bette Bultena, Branko Grünbaum, Frank Ruskey	Convex drawings of intersecting families of simple closed curves.	CCCG	1999	DBLP BibTeX RDF
1	Bette Bultena, Frank Ruskey	An Eades-McKay Algorithm for Well-Formed Parentheses Strings.	Inf. Process. Lett.	1998	DBLP DOI BibTeX RDF
1	Colin Ramsay, Ian T. Roberts, Frank Ruskey	Completely separating systems of k-sets.	Discrete Mathematics	1998	DBLP DOI BibTeX RDF
1	Bette Bultena, Frank Ruskey	Venn Diagrams with Few Vertices.	Electr. J. Comb.	1998	DBLP BibTeX RDF
1	Andrzej Proskurowski, Frank Ruskey, Malcolm Smith	Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings.	SIAM J. Discrete Math.	1998	DBLP DOI BibTeX RDF
1	Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey	Three-Dimensional Graph Drawing.	Algorithmica	1997	DBLP DOI BibTeX RDF
1	Frank Ruskey, Carla D. Savage	A Gray Code for Combinations of a Multiset.	Eur. J. Comb.	1996	DBLP DOI BibTeX RDF
1	Bette Bultena, Frank Ruskey	Transition Restricted Gray Codes.	Electr. J. Comb.	1996	DBLP BibTeX RDF
1	Gara Pruesse, Frank Ruskey	The Prism of the Acyclic Orientation Graph is Hamiltonian.	Electr. J. Comb.	1995	DBLP BibTeX RDF
1	Frank Ruskey, Ming Jiang 0008, Andrew Weston	The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking).	Discrete Applied Mathematics	1995	DBLP DOI BibTeX RDF
1	Ming Jiang 0008, Frank Ruskey	Determining the hamilton-connectedness of certain vertex-transitive graphs.	Discrete Mathematics	1994	DBLP DOI BibTeX RDF
1	Gara Pruesse, Frank Ruskey	Generating Linear Extensions Fast.	SIAM J. Comput.	1994	DBLP DOI BibTeX RDF
1	Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey	Volume upper bounds for 3D graph drawing.	CASCON	1994	DBLP DOI BibTeX RDF
1	Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey	Three-Dimensional Graph Drawing.	Graph Drawing	1994	DBLP DOI BibTeX RDF
1	Yasunori Koda, Frank Ruskey	A Gray Code for the Ideals of a Forest Poset.	J. Algorithms	1993	DBLP DOI BibTeX RDF
1	Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey	On Rotations and the Generation of Binary Trees.	J. Algorithms	1993	DBLP DOI BibTeX RDF
1	Frank Ruskey, Carla D. Savage	Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn.	SIAM J. Discrete Math.	1993	DBLP DOI BibTeX RDF
1	Frank Ruskey	Simple Combinatorial Gray Codes Constructed by Reversing Sublists.	ISAAC	1993	DBLP DOI BibTeX RDF
1	Frank Ruskey	Generating linear extensions of posets by transpositions.	J. Comb. Theory, Ser. B	1992	DBLP DOI BibTeX RDF
1	Chun Wa Ko, Frank Ruskey	Generating Permutations of a Bag by Interchanges.	Inf. Process. Lett.	1992	DBLP DOI BibTeX RDF
1	Frank Ruskey, Carla D. Savage, Terry Min Yih Wang	Generating Necklaces.	J. Algorithms	1992	DBLP DOI BibTeX RDF
1	Dominique Roelants van Baronaigien, Frank Ruskey	Generating permutations with given ups and downs.	Discrete Applied Mathematics	1992	DBLP DOI BibTeX RDF
1	Gara Pruesse, Frank Ruskey	Generating the Linear Extensions of Certain Posets by Transpositions.	SIAM J. Discrete Math.	1991	DBLP DOI BibTeX RDF
1	Frank Ruskey, Andrzej Proskurowski	Generating Binary Trees by Transpositions.	J. Algorithms	1990	DBLP DOI BibTeX RDF
1	Bruce L. Bauslaugh, Frank Ruskey	Generating Alternating Permutations Lexicographically.	BIT	1990	DBLP BibTeX RDF
1	Dominique Roelants van Baronaigien, Frank Ruskey	Generating t-ary Trees in A-Order.	Inf. Process. Lett.	1988	DBLP DOI BibTeX RDF
1	C. W. Ko, Frank Ruskey	Solution of some multi-dimensional lattice path parity difference recurrence relations.	Discrete Mathematics	1988	DBLP DOI BibTeX RDF
1	Frank Ruskey	Adjacent Interchange Generation of Combinations.	J. Algorithms	1988	DBLP DOI BibTeX RDF
1	Andrzej Proskurowski, Frank Ruskey	Generating Binary Trees by Transpositions.	SWAT	1988	DBLP DOI BibTeX RDF
1	Andrzej Proskurowski, Frank Ruskey	Binary Tree Gray Codes.	J. Algorithms	1985	DBLP DOI BibTeX RDF
1	Frank Ruskey	A simple proof of a formula of Dershowitz and Zaks.	Discrete Mathematics	1983	DBLP DOI BibTeX RDF
1	Peter Eichhorst, Frank Ruskey	On Unary Stochastic Lindenmayer Systems	Information and Control	1981	DBLP DOI BibTeX RDF
1	Frank Ruskey	Listing and Counting Subtrees of a Tree.	SIAM J. Comput.	1981	DBLP DOI BibTeX RDF
1	Ernest J. Cockayne, Frank Ruskey, A. G. Thomason	An Algorithm for the Most Economic Link Addition in a Tree Communication Network.	Inf. Process. Lett.	1979	DBLP DOI BibTeX RDF
1	Frank Ruskey	Generating t-ary Trees Lexicographically.	SIAM J. Comput.	1978	DBLP DOI BibTeX RDF
1	Frank Ruskey, T. C. Hu	Generating Binary Trees Lexicographically.	SIAM J. Comput.	1977	DBLP DOI BibTeX RDF

Publications of "Frank Ruskey" ( http://dblp.L3S.de/Authors/Frank_Ruskey )