The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frank Ruskey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  61. Generating Balanced Parentheses and Binary Trees by Prefix Shifts. [Citation Graph (, )][DBLP]


  62. Faster Generation of Shorthand Universal Cycles for Permutations. [Citation Graph (, )][DBLP]


  63. Auspicious Tatami Mat Arrangements. [Citation Graph (, )][DBLP]


  64. Symmetric Monotone Venn Diagrams with Seven Curves. [Citation Graph (, )][DBLP]


  65. The Feline Josephus Problem. [Citation Graph (, )][DBLP]


  66. Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes. [Citation Graph (, )][DBLP]


  67. Which n-Venn diagrams can be drawn with convex k-gons? [Citation Graph (, )][DBLP]


  68. Generating permutations with given ups and downs. [Citation Graph (, )][DBLP]


  69. The coolest way to generate combinations. [Citation Graph (, )][DBLP]


  70. Gray codes for column-convex polyominoes and a new class of distributive lattices. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002