Frank Ruskey Explained

Frank Ruskey
Fields:	Combinatorics, computer science
Workplaces:	University of Victoria
Alma Mater:	University of California, San Diego
Doctoral Advisor:	T. C. Hu

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.^[1] Frank Ruskey is the author of the Combinatorial Object Server (COS), a website for information on and generation of combinatorial objects.^[2]

Selected publications

• Lucas. J.M.. Vanbaronaigien, D.R. . Ruskey, F. . On Rotations and the Generation of Binary Trees. Journal of Algorithms. November 1993. 15. 3. 343–366. 10.1006/jagm.1993.1045 . 10.1.1.51.8866.
• Pruesse. Gara. Ruskey, Frank . Generating Linear Extensions Fast. SIAM Journal on Computing. April 1994. 23. 2. 373–386. 10.1137/s0097539791202647 . 10.1.1.52.3057.
• Ruskey. F.. Hu, T. C.. T. C. Hu . Generating Binary Trees Lexicographically. SIAM Journal on Computing. 1977. 6. 4. 745–758. 10.1137/0206055 .
• Ruskey. Frank. Weston, Mark. A Survey of Venn Diagrams. The Electronic Journal of Combinatorics. June 2005. 10.37236/26. 1 October 2011. https://web.archive.org/web/20111011075509/http://www.combinatorics.org/Surveys/ds5/VennEJC.html. 11 October 2011. dead. free.

External links

• Frank Ruskey's homepage
• Combinatorial Object Server
• Combinatorial Generation unpublished book on combinatorics

Notes and References

1. Web site: Frank Ruskey. Department of Computer Science. University of Victoria. 15 February 2019.
2. Web site: The Combinatorial Object Server++. combos.org. 2019-05-30.