LISTING AND COUNTING SUBTREE OF A TREERUSKEY F.1981; SIAM. J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 141-150; BIBL. 7 REF.Article

GENERATING T-ARY TREES LEXICOGRAPHICALLYRUSKEY F.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 424-439; BIBL. 7 REF.Article

A SIMPLE PROOF OF A FORMULA OF DERSHOWITZ AND ZAKSRUSKEY F.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 117-118; BIBL. 4 REF.Article

ON UNARY STOCHASTIC LINDENMAYER SYSTEMSEICHHORST P; RUSKEY F.1981; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1981; VOL. 48; NO 1; PP. 1-10; BIBL. 10 REF.Article

Generating linear extensions of posets by transpositionsRUSKEY, F.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 1, pp 77-101, issn 0095-8956Article

Adjacent interchange generation of combinationsRUSKEY, F.Journal of algorithms (Print). 1988, Vol 9, Num 3, pp 162-180, issn 0196-6774Article

An Eades-McKay algorithm for well-formed parentheses stringsBULTENA, B; RUSKEY, F.Information processing letters. 1998, Vol 68, Num 5, pp 255-259, issn 0020-0190Article

A gray code for the ideals of a forest posetKODA, Y; RUSKEY, F.Journal of algorithms (Print). 1993, Vol 15, Num 2, pp 324-340, issn 0196-6774Article

Gray codes from antimatroidsPRUESSE, G; RUSKEY, F.Order (Dordrecht). 1993, Vol 10, Num 3, pp 239-252, issn 0167-8094Article

Binary tree gray codesPROSKUROWSKI, A; RUSKEY, F.Journal of algorithms (Print). 1985, Vol 6, Num 2, pp 225-238, issn 0196-6774Article

Generating permutations of a bag by interchangesCHUN WA KO; RUSKEY, F.Information processing letters. 1992, Vol 41, Num 5, pp 263-269, issn 0020-0190Article

Generating binary trees by transpositionsRUSKEY, F; PROSKUROWSKI, A.Journal of algorithms (Print). 1990, Vol 11, Num 1, pp 68-84, issn 0196-6774Article

An efficient algorithm for generating necklaces with fixed densityRUSKEY, F; SAWADA, J.SIAM journal on computing (Print). 2000, Vol 29, Num 2, pp 671-684, issn 0097-5397Article

Generating linear extensions fastPRUESSE, G; RUSKEY, F.SIAM journal on computing (Print). 1994, Vol 23, Num 2, pp 373-386, issn 0097-5397Article

Hamilton cycles that extend transposition matchings in Cayley graphs of S_nRUSKEY, F; SAVAGE, C.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 1, pp 152-166, issn 0895-4801Article

The number of irreducible polynomials and Lyndon words with given traceRUSKEY, F; MIERS, C. R; SAWADA, J et al.SIAM journal on discrete mathematics (Print). 2001, Vol 14, Num 2, pp 240-245, issn 0895-4801Article

Generating t-ary trees in A-orderVAN BARONAIGIEN, D. R; RUSKEY, F.Information processing letters. 1987, Vol 27, Num 4, pp 205-213, issn 0020-0190Article

Generating necklacesRUSKEY, F; SAVAGE, C; TERRY MIN YIH WANG et al.Journal of algorithms (Print). 1992, Vol 13, Num 3, pp 414-430, issn 0196-6774Article

On rotations and the generation of binary treesLUCAS, J. M; ROELANTS VAN BARONAIGIEN, D; RUSKEY, F et al.Journal of algorithms (Print). 1993, Vol 15, Num 3, pp 343-366, issn 0196-6774Article

Generating necklaces and strings with forbidden substringsRUSKEY, F; SAWADA, J.Lecture notes in computer science. 2000, pp 330-339, issn 0302-9743, isbn 3-540-67787-9Conference Paper