default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrank Ruskey
Refine list
refinements active!
zoomed in on 107 of 107 records
view refined list in
export refined list as
showing all 107 records
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2010 – 2019
- 2019
[j70]Veronika Irvine, Stephen Melczer
, Frank Ruskey:
Vertically Constrained Motzkin-Like Paths Inspired by Bobbin Lace. Electron. J. Comb. 26(2): 2 (2019)- 2017
- [j69]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659: 1-13 (2017) - 2016
- [r1]Frank Ruskey:
Combinatorial Gray Code. Encyclopedia of Algorithms 2016: 342-347 - [i9]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Prefix Normal Words and Prefix Normal Forms. CoRR abs/1611.09017 (2016) - 2014
- [j68]Khalegh Mamakani, Frank Ruskey:
New Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves. Discret. Comput. Geom. 52(1): 71-87 (2014) - [c27]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CPM 2014: 60-69 - [c26]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. FUN 2014: 74-88 - [i8]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CoRR abs/1401.6346 (2014) - [i7]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. CoRR abs/1404.2824 (2014) - 2013
- [j67]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) - [c25]Alejandro Erickson, Frank Ruskey:
Domino Tatami Covering Is NP-Complete. IWOCA 2013: 140-149 - [i6]Alejandro Erickson, Frank Ruskey:
Domino Tatami Covering is NP-complete. CoRR abs/1305.6669 (2013) - 2012
- [j66]Alexander E. Holroyd, Frank Ruskey, Aaron Williams:
Shorthand Universal Cycles for Permutations. Algorithmica 64(2): 215-245 (2012) - [j65]Frank Ruskey, Joe Sawada, Aaron Williams:
Binary bubble languages and cool-lex order. J. Comb. Theory A 119(1): 155-169 (2012) - [j64]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) - [j63]Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey:
Generating simple convex Venn diagrams. J. Discrete Algorithms 16: 270-286 (2012) - [j62]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) - [j61]Bette Bultena, Matthew Klimesh, Frank Ruskey:
Minimum Area Polyomino Venn Diagrams. J. Comput. Geom. 3(1): 154-167 (2012) - [j60]Frank Ruskey, Aaron Williams:
The Feline Josephus Problem. Theory Comput. Syst. 50(1): 20-34 (2012) - [j59]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): 206-238 (2012) - [j58]Frank Ruskey, Joe Sawada, Aaron Williams:
De Bruijn Sequences for Fixed-Weight Binary Strings. SIAM J. Discret. Math. 26(2): 605-617 (2012) - [c24]Marcel Celaya, Frank Ruskey:
An Undecidable Nested Recurrence Relation. CiE 2012: 107-117 - [c23]Khalegh Mamakani, Frank Ruskey:
The First Simple Symmetric 11-Venn Diagram. GD 2012: 563-565 - [i5]Marcel Celaya, Frank Ruskey:
An Undecidable Nested Recurrence Relation. CoRR abs/1203.0586 (2012) - [i4]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) - [i3]Khalegh Mamakani, Frank Ruskey:
A New Rose : The First Simple Symmetric 11-Venn Diagram. CoRR abs/1207.6452 (2012) - 2011
- [j57]Alejandro Erickson, Frank Ruskey, Jennifer Woodcock, Mark Schurch:
Monomer-Dimer Tatami Tilings of Rectangular Regions. Electron. J. Comb. 18(1) (2011) - [j56]Frank Ruskey, Mark Weston:
Spherical Venn Diagrams with Involutory Isometries. Electron. J. Comb. 18(1) (2011) - [c22]Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey:
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams. IWOCA 2011: 275-286 - [c21]Frank Ruskey, Jennifer Woodcock:
The Rand and Block Distances of Pairs of Set Partitions. IWOCA 2011: 287-299 - 2010
- [j55]Frank Ruskey, Aaron Williams:
An explicit universal cycle for the (n-1)-permutations of an n-set. ACM Trans. Algorithms 6(3): 45:1-45:12 (2010) - [c20]Alejandro Erickson, Frank Ruskey, Mark Schurch, Jennifer Woodcock:
Auspicious Tatami Mat Arrangements. COCOON 2010: 288-297 - [c19]Alexander E. Holroyd, Frank Ruskey, Aaron Williams:
Faster Generation of Shorthand Universal Cycles for Permutations. COCOON 2010: 298-307 - [c18]Tao Cao, Khalegh Mamakani, Frank Ruskey:
Symmetric Monotone Venn Diagrams with Seven Curves. FUN 2010: 331-342 - [c17]Frank Ruskey, Aaron Williams:
The Feline Josephus Problem. FUN 2010: 343-354 - no results
2000 – 2009
- 2009
- [j54]Frank Ruskey, Jennifer Woodcock:
Counting Fixed-Height Tatami Tilings. Electron. J. Comb. 16(1) (2009) - [j53]Stirling Chow, Frank Ruskey:
Gray codes for column-convex polyominoes and a new class of distributive lattices. Discret. Math. 309(17): 5284-5297 (2009) - [j52]Frank Ruskey, Aaron Williams:
The coolest way to generate combinations. Discret. Math. 309(17): 5305-5320 (2009) - 2008
- [c16]Frank Ruskey, Aaron Williams:
Generating Balanced Parentheses and Binary Trees by Prefix Shifts. CATS 2008: 107-115 - 2007
- [j51]Jeremy Carroll, Frank Ruskey, Mark Weston:
Which n-Venn Diagrams Can Be Drawn with Convex k-Gons? Discret. Comput. Geom. 37(4): 619-628 (2007) - [i2]Frank Ruskey, Aaron Williams:
An explicit universal cycle for the (n-1)-permutations of an n-set. CoRR abs/0710.1842 (2007) - 2006
- [j50]Bradley W. Jackson, Frank Ruskey:
Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes. Electron. J. Comb. 13(1) (2006) - [j49]Frank Ruskey, Mark Weston:
More Fun with Symmetric Venn Diagrams. Theory Comput. Syst. 39(3): 413-423 (2006) - 2005
- [c15]Stirling Chow, Frank Ruskey:
Area-Proportional Drawings of Intersecting Families of Simple Closed Curves. CCCG 2005: 121-124 - [c14]Frank Ruskey, Aaron Williams:
Generating Combinations by Prefix Shifts. COCOON 2005: 570-576 - [i1]Jeremy Carroll, Frank Ruskey, Mark Weston:
Which n-Venn diagrams can be drawn with convex k-gons? CoRR abs/cs/0512001 (2005) - 2004
- [j48]Charles E. Killian, Frank Ruskey, Carla D. Savage, Mark Weston:
Half-Simple Symmetric Venn Diagrams. Electron. J. Comb. 11(1) (2004) - [j47]C. Robert Miers, Frank Ruskey:
Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Zp with p Prime. SIAM J. Discret. Math. 17(4): 675-685 (2004) - [j46]C. Robert Miers, Frank Ruskey:
Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings. SIAM J. Discret. Math. 18(1): 71-82 (2004) - [c13]Donald E. Knuth, Frank Ruskey:
Efficient Coroutine Generation of Constrained Gray Sequences. Essays in Memory of Ole-Johan Dahl 2004: 183-208 - [c12]Stirling Chow, Frank Ruskey:
Towards a General Solution to Drawing Area-Proportional Euler Diagrams. Euler 2004: 3-18 - 2003
- [j45]Frank Ruskey, Joe Sawada:
Bent Hamilton Cycles in d-Dimensional Grid Graphs. Electron. J. Comb. 10 (2003) - [j44]Scott Effler, Frank Ruskey:
A CAT algorithm for generating permutations with a fixed number of inversions. Inf. Process. Lett. 86(2): 107-112 (2003) - [j43]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) - [j42]John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson:
Euclidean strings. Theor. Comput. Sci. 301(1-3): 321-340 (2003) - [j41]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) - [c11]Stirling Chow, Frank Ruskey:
Drawing Area-Proportional Venn and Euler Diagrams. GD 2003: 466-477 - 2002
- [c10]Frank Ruskey:
Drawing Venn Diagrams. GD 2002: 381 - 2001
- [j40]Wendy J. Myrvold, Frank Ruskey:
Ranking and unranking permutations in linear time. Inf. Process. Lett. 79(6): 281-284 (2001) - [j39]Frank Ruskey, C. Robert Miers, Joe Sawada:
The Number of Irreducible Polynomials and Lyndon Words with Given Trace. SIAM J. Discret. Math. 14(2): 240-245 (2001) - 2000
- [j38]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) - [j37]Thomas Ball, Daniel Hoffman, Frank Ruskey, Richard Webber, Lee J. White:
State Generation and Automated Class Testing. Softw. Test. Verification Reliab. 10(3): 149-170 (2000) - [c9]Frank Ruskey, Joe Sawada:
Generating Necklaces and Strings with Forbidden Substrings. COCOON 2000: 330-339 - [c8]Frank Ruskey, Joe Sawada:
A fast algorithm to generate unlabeled necklaces. SODA 2000: 256-262 - no results
1990 – 1999
- 1999
- [j36]Frank Ruskey, Joe Sawada:
An Efficient Algorithm for Generating Necklaces with Fixed Density. SIAM J. Comput. 29(2): 671-684 (1999) - [c7]Bette Bultena, Branko Grünbaum, Frank Ruskey:
Convex drawings of intersecting families of simple closed curves. CCCG 1999 - [c6]Joe Sawada, Frank Ruskey:
An Efficient Algorithm for Generating Necklaces with Fixed Density. SODA 1999: 752-758 - [c5]Gang Li, Frank Ruskey:
The Advantages of Forward Thinking in Generating Rooted and Free Trees. SODA 1999: 939-940 - 1998
- [j35]Bette Bultena, Frank Ruskey:
Venn Diagrams with Few Vertices. Electron. J. Comb. 5 (1998) - [j34]Colin Ramsay, Ian T. Roberts, Frank Ruskey:
Completely separating systems of k-sets. Discret. Math. 183(1-3): 265-275 (1998) - [j33]Bette Bultena, Frank Ruskey:
An Eades-McKay Algorithm for Well-Formed Parentheses Strings. Inf. Process. Lett. 68(5): 255-259 (1998) - [j32]Andrzej Proskurowski, Frank Ruskey, Malcolm Smith:
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings. SIAM J. Discret. Math. 11(1): 94-109 (1998) - 1997
- [j31]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997) - 1996
- [j30]Bette Bultena, Frank Ruskey:
Transition Restricted Gray Codes. Electron. J. Comb. 3(1) (1996) - [j29]Frank Ruskey, Carla D. Savage:
A Gray Code for Combinations of a Multiset. Eur. J. Comb. 17(5): 493-500 (1996) - 1995
- [j28]Gara Pruesse, Frank Ruskey:
The Prism of the Acyclic Orientation Graph is Hamiltonian. Electron. J. Comb. 2 (1995) - [j27]Frank Ruskey, Ming Jiang, Andrew Weston:
The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking). Discret. Appl. Math. 57(1): 75-83 (1995) - 1994
- [j26]Frank Ruskey, Carla D. Savage:
Gray codes for set partitions and restricted growth tails. Australas. J Comb. 10: 85-96 (1994) - [j25]Ming Jiang, Frank Ruskey:
Determining the hamilton-connectedness of certain vertex-transitive graphs. Discret. Math. 133(1-3): 159-169 (1994) - [j24]Gara Pruesse, Frank Ruskey:
Generating Linear Extensions Fast. SIAM J. Comput. 23(2): 373-386 (1994) - [c4]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Volume upper bounds for 3D graph drawing. CASCON 1994: 11 - [c3]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Three-Dimensional Graph Drawing. GD 1994: 1-11 - 1993
- [j23]Yasunori Koda, Frank Ruskey:
A Gray Code for the Ideals of a Forest Poset. J. Algorithms 15(2): 324-340 (1993) - [j22]Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey:
On Rotations and the Generation of Binary Trees. J. Algorithms 15(3): 343-366 (1993) - [j21]Frank Ruskey, Carla D. Savage:
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn. SIAM J. Discret. Math. 6(1): 152-166 (1993) - [c2]Frank Ruskey:
Simple Combinatorial Gray Codes Constructed by Reversing Sublists. ISAAC 1993: 201-208 - 1992
- [j20]Dominique Roelants van Baronaigien, Frank Ruskey:
Generating permutations with given ups and downs. Discret. Appl. Math. 36(1): 57-65 (1992) - [j19]Chun Wa Ko, Frank Ruskey:
Generating Permutations of a Bag by Interchanges. Inf. Process. Lett. 41(5): 263-269 (1992) - [j18]Frank Ruskey, Carla D. Savage, Terry Min Yih Wang:
Generating Necklaces. J. Algorithms 13(3): 414-430 (1992) - [j17]Frank Ruskey:
Generating linear extensions of posets by transpositions. J. Comb. Theory B 54(1): 77-101 (1992) - 1991
- [j16]Gara Pruesse, Frank Ruskey:
Generating the Linear Extensions of Certain Posets by Transpositions. SIAM J. Discret. Math. 4(3): 413-422 (1991) - 1990
- [j15]Bruce L. Bauslaugh, Frank Ruskey:
Generating Alternating Permutations Lexicographically. BIT 30(1): 17-26 (1990) - [j14]Frank Ruskey, Andrzej Proskurowski:
Generating Binary Trees by Transpositions. J. Algorithms 11(1): 68-84 (1990) - no results
1980 – 1989
- 1988
- [j13]C. W. Ko, Frank Ruskey:
Solution of some multi-dimensional lattice path parity difference recurrence relations. Discret. Math. 71(1): 47-56 (1988) - [j12]Dominique Roelants van Baronaigien, Frank Ruskey:
Generating t-ary Trees in A-Order. Inf. Process. Lett. 27(4): 205-213 (1988) - [j11]Frank Ruskey:
Adjacent Interchange Generation of Combinations. J. Algorithms 9(2): 162-180 (1988) - [c1]Andrzej Proskurowski, Frank Ruskey:
Generating Binary Trees by Transpositions. SWAT 1988: 199-207 - 1987
- [j10]T. C. Hu, Yue-Sun Kuo, Frank Ruskey:
Some Optimum Algorithms for Scheduling Problems with Changeover Costs. Oper. Res. 35(1): 94-99 (1987) - 1985
- [j9]Andrzej Proskurowski, Frank Ruskey:
Binary Tree Gray Codes. J. Algorithms 6(2): 225-238 (1985) - 1983
- [j8]Frank Ruskey:
A simple proof of a formula of Dershowitz and Zaks. Discret. Math. 43(1): 117-118 (1983) - 1981
- [j7]Peter Eichhorst, Frank Ruskey:
On Unary Stochastic Lindenmayer Systems. Inf. Control. 48(1): 1-10 (1981) - [j6]Frank Ruskey:
Listing and Counting Subtrees of a Tree. SIAM J. Comput. 10(1): 141-150 (1981) - 1980
- [j5]T. C. Hu, Frank Ruskey:
Circular Cuts in a Network. Math. Oper. Res. 5(3): 422-434 (1980) - [j4]Frank Ruskey:
On the Average Shape of Binary Trees. SIAM J. Algebraic Discret. Methods 1(1): 43-50 (1980) - no results
1970 – 1979
- 1979
- [j3]Ernest J. Cockayne, Frank Ruskey, Andrew G. Thomason:
An Algorithm for the Most Economic Link Addition in a Tree Communication Network. Inf. Process. Lett. 9(4): 171-175 (1979) - 1978
- [j2]Frank Ruskey:
Generating t-ary Trees Lexicographically. SIAM J. Comput. 7(4): 424-439 (1978) - 1977
- [j1]Frank Ruskey, T. C. Hu:
Generating Binary Trees Lexicographically. SIAM J. Comput. 6(4): 745-758 (1977) - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-17 00:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
