Frank Ruskey

2008
63	EE	Frank Ruskey, Aaron Williams: Generating Balanced Parentheses and Binary Trees by Prefix Shifts. CATS 2008: 107-115
2007
62	EE	Frank Ruskey, Aaron Williams: An explicit universal cycle for the (n-1)-permutations of an n-set CoRR abs/0710.1842: (2007)
61	EE	Jeremy Carroll, Frank Ruskey, Mark Weston: Which n-Venn Diagrams Can Be Drawn with Convex k-Gons? Discrete & Computational Geometry 37(4): 619-628 (2007)
2006
60	EE	Brad Jackson, Frank Ruskey: Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes. Electr. J. Comb. 13(1): (2006)
59	EE	Frank Ruskey, Mark Weston: More Fun with Symmetric Venn Diagrams. Theory Comput. Syst. 39(3): 413-423 (2006)
2005
58	EE	Stirling Chow, Frank Ruskey: Area-Proportional Drawings of Intersecting Families of Simple Closed Curves. CCCG 2005: 121-124
57	EE	Frank Ruskey, Aaron Williams: Generating Combinations by Prefix Shifts. COCOON 2005: 570-576
56	EE	Jeremy Carroll, Frank Ruskey, Mark Weston: Which n-Venn diagrams can be drawn with convex k-gons? CoRR abs/cs/0512001: (2005)
55	EE	Stirling Chow, Frank Ruskey: Towards a General Solution to Drawing Area-Proportional Euler Diagrams. Electr. Notes Theor. Comput. Sci. 134: 3-18 (2005)
2004
54	EE	Donald E. Knuth, Frank Ruskey: Efficient Coroutine Generation of Constrained Gray Sequences. Essays in Memory of Ole-Johan Dahl 2004: 183-208
53	EE	C. Robert Miers, Frank Ruskey: Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over Zp with p Prime. SIAM J. Discrete Math. 17(4): 675-685 (2004)
52	EE	C. Robert Miers, Frank Ruskey: Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings. SIAM J. Discrete Math. 18(1): 71-82 (2004)
2003
51	EE	Stirling Chow, Frank Ruskey: Drawing Area-Proportional Venn and Euler Diagrams. Graph Drawing 2003: 466-477
50	EE	Frank Ruskey, Joe Sawada: Bent Hamilton Cycles in d-Dimensional Grid Graphs. Electr. J. Comb. 10: (2003)
49	EE	Scott Effler, Frank Ruskey: A CAT algorithm for generating permutations with a fixed number of inversions. Inf. Process. Lett. 86(2): 107-112 (2003)
48	EE	Joe Sawada, Frank Ruskey: Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2). J. Algorithms 46(1): 21-26 (2003)
47	EE	John A. Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson: Euclidean strings. Theor. Comput. Sci. 1-3(301): 321-340 (2003)
46	EE	L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada: Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2): 303-317 (2003)
2002
45	EE	Frank Ruskey: Drawing Venn Diagrams. Graph Drawing 2002: 381
2001
44	EE	Wendy J. Myrvold, Frank Ruskey: Ranking and unranking permutations in linear time. Inf. Process. Lett. 79(6): 281-284 (2001)
43	EE	Frank Ruskey, C. Robert Miers, Joe Sawada: The Number of Irreducible Polynomials and Lyndon Words with Given Trace. SIAM J. Discrete Math. 14(2): 240-245 (2001)
2000
42	EE	Frank Ruskey, Joe Sawada: Generating Necklaces and Strings with Forbidden Substrings. COCOON 2000: 330-339
41	EE	Frank Ruskey, Joe Sawada: A fast algorithm to generate unlabeled necklaces. SODA 2000: 256-262
40		Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers: Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). J. Algorithms 37(2): 267-282 (2000)
39		Thomas Ball, Daniel Hoffman, Frank Ruskey, Richard Webber, Lee J. White: State Generation and Automated Class Testing. Softw. Test., Verif. Reliab. 10(3): 149-170 (2000)
1999
38	EE	Bette Bultena, Branko Grünbaum, Frank Ruskey: Convex drawings of intersecting families of simple closed curves. CCCG 1999
37	EE	Joe Sawada, Frank Ruskey: An Efficient Algorithm for Generating Necklaces with Fixed Density. SODA 1999: 752-758
36	EE	Gang Li, Frank Ruskey: The Advantages of Forward Thinking in Generating Rooted and Free Trees. SODA 1999: 939-940
35		Frank Ruskey, Joe Sawada: An Efficient Algorithm for Generating Necklaces with Fixed Density. SIAM J. Comput. 29(2): 671-684 (1999)
1998
34	EE	Colin Ramsay, Ian T. Roberts, Frank Ruskey: Completely separating systems of k-sets. Discrete Mathematics 183(1-3): 265-275 (1998)
33	EE	Bette Bultena, Frank Ruskey: Venn Diagrams with Few Vertices. Electr. J. Comb. 5: (1998)
32	EE	Bette Bultena, Frank Ruskey: An Eades-McKay Algorithm for Well-Formed Parentheses Strings. Inf. Process. Lett. 68(5): 255-259 (1998)
31	EE	Andrzej Proskurowski, Frank Ruskey, Malcolm Smith: Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings. SIAM J. Discrete Math. 11(1): 94-109 (1998)
1997
30		Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997)
1996
29	EE	Bette Bultena, Frank Ruskey: Transition Restricted Gray Codes. Electr. J. Comb. 3(1): (1996)
28	EE	Frank Ruskey, Carla D. Savage: A Gray Code for Combinations of a Multiset. Eur. J. Comb. 17(5): 493-500 (1996)
1995
27	EE	Frank Ruskey, Ming Jiang, Andrew Weston: The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking). Discrete Applied Mathematics 57(1): 75-83 (1995)
26	EE	Gara Pruesse, Frank Ruskey: The Prism of the Acyclic Orientation Graph is Hamiltonian. Electr. J. Comb. 2: (1995)
1994
25	EE	Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Volume upper bounds for 3D graph drawing. CASCON 1994: 11
24		Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey: Three-Dimensional Graph Drawing. Graph Drawing 1994: 1-11
23	EE	Ming Jiang, Frank Ruskey: Determining the hamilton-connectedness of certain vertex-transitive graphs. Discrete Mathematics 133(1-3): 159-169 (1994)
22		Gara Pruesse, Frank Ruskey: Generating Linear Extensions Fast. SIAM J. Comput. 23(2): 373-386 (1994)
1993
21		Frank Ruskey: Simple Combinatorial Gray Codes Constructed by Reversing Sublists. ISAAC 1993: 201-208
20		Yasunori Koda, Frank Ruskey: A Gray Code for the Ideals of a Forest Poset. J. Algorithms 15(2): 324-340 (1993)
19		Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey: On Rotations and the Generation of Binary Trees. J. Algorithms 15(3): 343-366 (1993)
18		Frank Ruskey, Carla D. Savage: Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn. SIAM J. Discrete Math. 6(1): 152-166 (1993)
1992
17		Chun Wa Ko, Frank Ruskey: Generating Permutations of a Bag by Interchanges. Inf. Process. Lett. 41(5): 263-269 (1992)
16		Frank Ruskey, Carla D. Savage, Terry Min Yih Wang: Generating Necklaces. J. Algorithms 13(3): 414-430 (1992)
15	EE	Frank Ruskey: Generating linear extensions of posets by transpositions. J. Comb. Theory, Ser. B 54(1): 77-101 (1992)
1991
14		Gara Pruesse, Frank Ruskey: Generating the Linear Extensions of Certain Posets by Transpositions. SIAM J. Discrete Math. 4(3): 413-422 (1991)
1990
13		Bruce L. Bauslaugh, Frank Ruskey: Generating Alternating Permutations Lexicographically. BIT 30(1): 17-26 (1990)
12		Frank Ruskey, Andrzej Proskurowski: Generating Binary Trees by Transpositions. J. Algorithms 11(1): 68-84 (1990)
1988
11		Andrzej Proskurowski, Frank Ruskey: Generating Binary Trees by Transpositions. SWAT 1988: 199-207
10	EE	C. W. Ko, Frank Ruskey: Solution of some multi-dimensional lattice path parity difference recurrence relations. Discrete Mathematics 71(1): 47-56 (1988)
9		Dominique Roelants van Baronaigien, Frank Ruskey: Generating t-ary Trees in A-Order. Inf. Process. Lett. 27(4): 205-213 (1988)
8		Frank Ruskey: Adjacent Interchange Generation of Combinations. J. Algorithms 9(2): 162-180 (1988)
1985
7		Andrzej Proskurowski, Frank Ruskey: Binary Tree Gray Codes. J. Algorithms 6(2): 225-238 (1985)
1983
6	EE	Frank Ruskey: A simple proof of a formula of Dershowitz and Zaks. Discrete Mathematics 43(1): 117-118 (1983)
1981
5		Peter Eichhorst, Frank Ruskey: On Unary Stochastic Lindenmayer Systems Information and Control 48(1): 1-10 (1981)
4		Frank Ruskey: Listing and Counting Subtrees of a Tree. SIAM J. Comput. 10(1): 141-150 (1981)
1979
3		Ernest J. Cockayne, Frank Ruskey, A. G. Thomason: An Algorithm for the Most Economic Link Addition in a Tree Communication Network. Inf. Process. Lett. 9(4): 171-175 (1979)
1978
2		Frank Ruskey: Generating t-ary Trees Lexicographically. SIAM J. Comput. 7(4): 424-439 (1978)
1977
1		Frank Ruskey, T. C. Hu: Generating Binary Trees Lexicographically. SIAM J. Comput. 6(4): 745-758 (1977)

Coauthor Index

1	Thomas Ball	[39]
2	Dominique Roelants van Baronaigien	[9] [19]
3	Bruce L. Bauslaugh	[13]
4	Bette Bultena	[29] [32] [33] [38]
5	Jeremy Carroll	[56] [61]
6	Kevin Cattell	[40]
7	L. Sunil Chandran	[46]
8	Stirling Chow	[51] [55] [58]
9	Ernest J. Cockayne	[3]
10	Robert F. Cohen	[24] [25] [30]
11	Peter Eades	[24] [25] [30]
12	Scott Effler	[49]
13	Peter Eichhorst	[5]
14	John A. Ellis	[47]
15	Branko Grünbaum	[38]
16	Daniel Hoffman	[39]
17	T. C. Hu	[1]
18	Louis Ibarra	[46]
19	Brad Jackson	[60]
20	Ming Jiang	[23] [27]
21	Donald E. Knuth	[54]
22	C. W. Ko	[10]
23	Chun Wa Ko	[17]
24	Yasunori Koda	[20]
25	Gang Li	[36]
26	Tao Lin	[24] [25] [30]
27	Joan M. Lucas	[19]
28	C. Robert Miers	[40] [43] [52] [53]
29	Wendy J. Myrvold	[44]
30	Andrzej Proskurowski	[7] [11] [12] [31]
31	Gara Pruesse	[14] [22] [26]
32	Colin Ramsay	[34]
33	Ian T. Roberts	[34]
34	Carla D. Savage	[16] [18] [28]
35	Joe Sawada	[35] [37] [40] [41] [42] [43] [46] [47] [48] [50]
36	Micaela Serra	[40]
37	Jamie Simpson	[47]
38	Malcolm Smith	[31]
39	A. G. Thomason	[3]
40	Terry Min Yih Wang	[16]
41	Richard Webber	[39]
42	Andrew Weston	[27]
43	Mark Weston	[56] [59] [61]
44	Lee J. White	[39]
45	Aaron Williams	[57] [62] [63]

Colors in the list of coauthors