Frank Ruskey
Frank Ruskey
Computer Science, University of Victoria
Verified email at cs.uvic.ca - Homepage
Title
Cited by
Cited by
Year
A Survey of Venn diagrams
F Ruskey, M Weston
The Electronic Journal of Combinatorics 1000, DS5: Jun 18, 2005, 2005
187*2005
Generating linear extensions fast
G Pruesse, F Ruskey
SIAM Journal on Computing 23 (2), 373-386, 1994
1751994
Three-dimensional graph drawing
RF Cohen, P Eades, T Lin, F Ruskey
Algorithmica 17 (2), 199-208, 1997
1701997
Combinatorial generation
F Ruskey
Preliminary working draft. University of Victoria, Victoria, BC, Canada 11, 20, 2003
1492003
On rotations and the generation of binary trees
JM Lucas, DR van Baronaigien, F Ruskey
J. Algorithms 15 (3), 343-366, 1993
1331993
Ranking and unranking permutations in linear time
W Myrvold, F Ruskey
Information Processing Letters 79 (6), 281-284, 2001
1312001
Generating binary trees lexicographically
F Ruskey, TC Hu
SIAM Journal on Computing 6 (4), 745-758, 1977
1291977
Drawing area-proportional Venn and Euler diagrams
S Chow, F Ruskey
International Symposium on Graph Drawing, 466-477, 2003
1152003
Generating necklaces
F Ruskey, C Savage, TMY Wang
Journal of Algorithms 13 (3), 414-430, 1992
1141992
Generating t-ary trees lexicographically
F Ruskey
SIAM Journal on Computing 7 (4), 424-439, 1978
1081978
Algorithms and complexity for annotated sequence analysis
PA Evans
921999
Generating binary trees by transpositions
F Ruskey, A Proskurowski
Journal of algorithms 11 (1), 68-84, 1990
881990
Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2)
K Cattell, F Ruskey, J Sawada, M Serra, CR Miers
Journal of Algorithms 37 (2), 267-282, 2000
832000
An efficient algorithm for generating necklaces with fixed density
F Ruskey, J Sawada
SIAM Journal on Computing 29 (2), 671-684, 1999
781999
Simple combinatorial Gray codes constructed by reversing sublists
F Ruskey
Proc. 4th. ISAAC, Lecture Notes in Comput. Sci. 761, 201-208, 1993
731993
The advantages of forward thinking in generating rooted and free trees
G Li, F Ruskey
SODA 1999, 939-940, 1999
721999
Binary tree Gray codes
A Proskurowski, F Ruskey
Journal of Algorithms 6 (2), 225-238, 1985
621985
Adjacent interchange generation of combinations
F Ruskey
Journal of Algorithms 9 (2), 162-180, 1988
581988
Generating t-ary trees in A-order
DR Van Baronaigien, F Ruskey
Information Processing Letters 27 (4), 205-213, 1988
561988
Hamilton cycles that extend transposition matchings in Cayley graphs of S_n
F Ruskey, C Savage
SIAM Journal on Discrete Mathematics 6 (1), 152-166, 1993
551993
The system can't perform the operation now. Try again later.
Articles 1–20