A Survey of Venn diagrams F Ruskey, M Weston The Electronic Journal of Combinatorics 1000, DS5: Jun 18, 2005, 2005 | 209* | 2005 |
Combinatorial generation F Ruskey Preliminary working draft. University of Victoria, Victoria, BC, Canada 11, 20, 2003 | 207 | 2003 |
Generating linear extensions fast G Pruesse, F Ruskey SIAM Journal on Computing 23 (2), 373-386, 1994 | 194 | 1994 |
Three-dimensional graph drawing RF Cohen, P Eades, T Lin, F Ruskey Algorithmica 17 (2), 199-208, 1997 | 191 | 1997 |
Ranking and unranking permutations in linear time W Myrvold, F Ruskey Information Processing Letters 79 (6), 281-284, 2001 | 166 | 2001 |
On rotations and the generation of binary trees JM Lucas, DR Vanbaronaigien, F Ruskey Journal of Algorithms 15 (3), 343-366, 1993 | 154 | 1993 |
Generating binary trees lexicographically F Ruskey, TC Hu SIAM Journal on Computing 6 (4), 745-758, 1977 | 151 | 1977 |
Generating necklaces F Ruskey, C Savage, TMY Wang Journal of Algorithms 13 (3), 414-430, 1992 | 135 | 1992 |
Drawing area-proportional Venn and Euler diagrams S Chow, F Ruskey Graph Drawing: 11th International Symposium, GD 2003 Perugia, Italy …, 2004 | 127 | 2004 |
Generating t-ary trees lexicographically F Ruskey SIAM Journal on Computing 7 (4), 424-439, 1978 | 115 | 1978 |
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 | 100 | 2000 |
An efficient algorithm for generating necklaces with fixed density F Ruskey, J Sawada SIAM Journal on Computing 29 (2), 671-684, 1999 | 100 | 1999 |
Generating binary trees by transpositions F Ruskey, A Proskurowski Journal of algorithms 11 (1), 68-84, 1990 | 97 | 1990 |
The advantages of forward thinking in generating rooted and free trees G Li, F Ruskey SODA 1999, 939-940, 1999 | 79 | 1999 |
Simple combinatorial Gray codes constructed by reversing sublists F Ruskey Proc. 4th. ISAAC, Lecture Notes in Comput. Sci. 761, 201-208, 1993 | 76 | 1993 |
The coolest way to generate combinations F Ruskey, A Williams Discrete Mathematics 309 (17), 5305-5320, 2009 | 73 | 2009 |
Binary tree Gray codes A Proskurowski, F Ruskey Journal of Algorithms 6 (2), 225-238, 1985 | 71 | 1985 |
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 | 67 | 1993 |
Generating linear extensions of posets by transpositions F Ruskey Journal of Combinatorial Theory, Series B 54 (1), 77-101, 1992 | 66 | 1992 |
Adjacent interchange generation of combinations F Ruskey Journal of Algorithms 9 (2), 162-180, 1988 | 66 | 1988 |