Frank Ruskey | Academic Influence

Frank Ruskey's AcademicInfluence.com Rankings

Frank Ruskey

Computer Science

#3519

World Rank

#3692

Historical Rank

computer-science Degrees

Frank Ruskey

Mathematics

#3755

World Rank

#5478

Historical Rank

Combinatorics

#104

World Rank

#112

Historical Rank

Graph Theory

#117

World Rank

#125

Historical Rank

Measure Theory

#3370

World Rank

#3980

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Frank Ruskey's Degrees

Bachelors Mathematics University of Victoria

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Frank Ruskey Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Frank Ruskey is a combinatorialist and computer scientist, and professor at the University of Victoria. His research involves algorithms for exhaustively listing discrete structures, combinatorial Gray codes, Venn and Euler diagrams, combinatorics on words, and enumerative combinatorics. Frank Ruskey is the author of the Combinatorial Object Server , a website for information on and generation of combinatorial objects.

(See a Problem?)

Frank Ruskey's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Generating Linear Extensions Fast (1994) (140)
Generating Binary Trees Lexicographically (1977) (137)
Ranking and unranking permutations in linear time (2001) (128)
On Rotations and the Generation of Binary Trees (1993) (123)
Drawing Area-Proportional Venn and Euler Diagrams (2003) (121)
Generating Necklaces (1992) (94)
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) (2000) (82)
An efficient algorithm for generating necklaces with fixed density (1999) (80)
Generating Binary Trees by Transpositions (1988) (69)
Generating t-ary Trees in A-Order (1988) (58)
The advantages of forward thinking in generating rooted and free trees (1999) (58)
Generating t-ary Trees Lexicographically (1978) (58)
Simple Combinatorial Gray Codes Constructed by Reversing Sublists (1993) (57)
The coolest way to generate combinations (2009) (55)
Generating linear extensions of posets by transpositions (1992) (53)
Adjacent Interchange Generation of Combinations (1988) (50)
Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn (1993) (48)
Generating the Linear Extensions of Certain Posets by Transpositions (1991) (45)
An explicit universal cycle for the (n-1)-permutations of an n-set (2007) (43)
State generation and automated class testing (2000) (41)
Binary Tree Gray Codes (1985) (40)
A Gray Code for the Ideals of a Forest Poset (1993) (40)
Binary bubble languages and cool-lex order (2012) (39)
Generating and characterizing the perfect elimination orderings of a chordal graph (2003) (38)
Gray codes from antimatroids (1993) (36)
Bent Hamilton Cycles in d-Dimensional Grid Graphs (2003) (35)
De Bruijn Sequences for Fixed-Weight Binary Strings (2012) (34)
Shorthand Universal Cycles for Permutations (2012) (33)
Towards a General Solution to Drawing Area-Proportional Euler Diagrams (2005) (33)
Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes (2005) (31)
The Search for Simple Symmetric Venn Diagrams (2006) (30)
A CAT algorithm for generating permutations with a fixed number of inversions (2003) (28)
Listing and Counting Subtrees of a Tree (1981) (27)
The Number of Irreducible Polynomials and Lyndon Words with Given Trace (2001) (26)
Generating Necklaces and Strings with Forbidden Substrings (2000) (25)
Convex drawings of intersecting families of simple closed curves (1999) (24)
Some Optimum Algorithms for Scheduling Problems with Changeover Costs (1987) (23)
Determining the hamilton-connectedness of certain vertex-transitive graphs (1994) (23)
On the Average Shape of Binary Trees (1980) (22)
An Eades-McKay Algorithm for Well-Formed Parentheses Strings (1998) (21)
Generating Permutations of a Bag by Interchanges (1992) (21)
Alley CATs in search of good homesFrank (1994) (19)
Generating Combinations by Prefix Shifts (2005) (19)
Three-dimensional graph drawing (1994) (19)
Generating permutations with given ups and downs (1992) (18)
On Prefix Normal Words and Prefix Normal Forms (2016) (18)
Nested Recurrence Relations with Conolly-like Solutions (2015) (17)
Gray codes for set partitions and restricted growth tails (1994) (17)
In-place permuting and perfect shuffling using involutions (2012) (17)
The Combinatorics of Certain k-ary Meta-Fibonacci Sequences (2009) (17)
Completely separating systems of k-sets (1998) (17)
Generating alternating permutations lexicographically (1990) (16)
Transition Restricted Gray Codes (1996) (16)
Generating Balanced Parentheses and Binary Trees by Prefix Shifts (2008) (16)
On Combinatorial Generation of Prefix Normal Words (2014) (14)
Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2) (2003) (14)
Circular Cuts in a Network (1980) (13)
Faster Generation of Shorthand Universal Cycles for Permutations (2010) (13)
Counting Fixed-Height Tatami Tilings (2009) (13)
Euclidean strings (2003) (12)
Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings (1998) (12)
Microwave Emission Characteristics of Natural Materials and the Environment (A Summary of Six Years Research). (1971) (12)
Generating simple convex Venn diagrams (2012) (12)
Developing a mathematical model for bobbin lace (2014) (12)
Transposition generation of alternating permutations (1989) (11)
Venn Diagrams with Few Vertices (1998) (11)
Hamilton Cycles Which Extend Transposition Matchings in Cayley Graphs of S N (1993) (11)
The Prism of the Acyclic Orientation Graph is Hamiltonian (1995) (10)
Solution of some multi-dimensional lattice path parity difference recurrence relations (1988) (10)
Monomer-Dimer Tatami Tilings of Rectangular Regions (2011) (10)
Complete k-ary trees and generalized meta-Fibonacci sequences (2006) (9)
Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams (2011) (9)
A Gray Code for Combinations of a Multiset (1996) (9)
Efficient Coroutine Generation of Constrained Gray Sequences (2004) (9)
Normal, Abby Normal, Prefix Normal (2014) (9)
Generating Functions for the Digital Sum and Other Digit Counting Sequences (2009) (9)
The Feline Josephus Problem (2011) (9)
Hamming distance from irreducible polynomials over F _ 2 (2007) (9)
A fast algorithm to generate unlabeled necklaces (2000) (8)
Combinatorial Gray Code (2016) (8)
Cool-lex order and k-ary Catalan structures (2012) (8)
New Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves (2014) (8)
Symmetric Monotone Venn Diagrams with Seven Curves (2010) (7)
Half-Simple Symmetric Venn Diagrams (2004) (7)
The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking) (1995) (7)
Minimum Area Venn Diagrams Whose Curves Are Polyominoes (2006) (6)
Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings (2004) (6)
Volume upper bounds for 3D graph drawing (1994) (6)
More Fun with Symmetric Venn Diagrams (2006) (5)
Which n-Venn Diagrams Can Be Drawn with Convex k-Gons? (2005) (5)
Domino Tatami Covering is NP-complete (2013) (5)
Vertically Constrained Motzkin-Like Paths Inspired by Bobbin Lace (2018) (4)
Enumerating maximal tatami mat coverings of square grids with $v$ vertical dominoes (2013) (4)
Teaching the art of computer programming (TAOCP) (2011) (4)
Gray codes for column-convex polyominoes and a new class of distributive lattices (2009) (4)
Spherical Venn Diagrams with Involutory Isometries (2011) (4)
Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Zp with p Prime (2004) (3)
Minimum Area Polyomino Venn Diagrams (2012) (3)
On Unary Stochastic Lindenmayer Systems (1981) (3)
High-resolution seismic reflection techniques for mapping coal seams from the surface. Technical progress report (1976) (3)
All Simple Venn Diagrams are Hamiltonian (2015) (3)
An Undecidable Nested Recurrence Relation (2012) (2)
FIXED-DENSITY DE BRUIJN SEQUENCES (2011) (2)
A simple proof of a formula of Dershowitz and Zaks (1983) (2)
A New Rose : The First Simple Symmetric 11-Venn Diagram (2012) (2)
Auspicious Tatami Mat Arrangements (2010) (2)
Shallow 3-D seismics for environmental searches and tunnel detection; some ideas for research (1993) (2)
Experimental determination of test pad performance (1968) (2)
Fast Generation of All Perfect Elimination Orderings of a Chordal Graph (2002) (2)
Three-Dimensional Graph Drawing 1 (1997) (1)
Hazard evasion program for mine planning. [Oil and gas wells] (1972) (1)
Seismic and resistivity techniques for locating abandoned coal mine workings (1982) (1)
The Rand and Block Distances of Pairs of Set Partitions (2011) (1)
Algorithmic solution of two combinatorial problems. (1978) (1)
An Algorithm for the Most Economic Link Addition in a Tree Communication Network (1979) (1)
Drawing Venn Diagrams (2002) (1)
Generating Tatami Coverings Efficiently (2014) (1)
Hazard-evasion program for mine planning (1975) (0)
Simple Spherical Venn diagrams with Isometry Groups of Order Eight (2012) (0)
The First Simple Symmetric 11-Venn Diagram (2012) (0)
TheSearch forSimple SymmetricVennDiagrams (2007) (0)
Area-Proportional Drawings of Intersecting Families of Simple Closed Curves (2005) (0)
State Generation and Automated Class Testing : a Case Study (1998) (0)
Isoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions (2012) (0)
Chapter 7 Classification of Chemical Compound Pharmacophore Structures (2000) (0)
Shorthand Universal Cycles for Permutations (2011) (0)
Counting strings over Z 2 d with Given Elementary Symmetric Function Evaluations (2013) (0)
Integration of remote sensing and surface geophysics in the detection of faults (1977) (0)
C O ] 9 S ep 2 01 5 NESTED RECURRENCE RELATIONS WITH CONOLLY-LIKE SOLUTIONS (0)
The Feline Josephus Problem (2011) (0)
Counting and computing the Rand and block distances of pairs of set partitions (2012) (0)
Hazard evasion program for mine planning. Technical progress report (1972) (0)
Motzkin Paths with Vertical Edges (2014) (0)
Sequences That Satisfy a(n¡a(n)) = 0 (2005) (0)
New Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves (2014) (0)
Morphic Words and Nested Recurrence Relations (2013) (0)
Hamming distance from irreducible polynomials over $\mathbb {F}_2$ (2007) (0)

This paper list is powered by the following services:

Other Resources About Frank Ruskey

en.wikipedia.org

What Schools Are Affiliated With Frank Ruskey?

Frank Ruskey is affiliated with the following schools:

Image Attributions

Image Source for Frank Ruskey