Frank Ruskey

2.7k citations
84 papers · 1.3k indexed · h-index 21

Impact in

Papers in

Frank Ruskey

82 papers receiving 1.2k citations

Peers

Frank Ruskey
Comparison fields: 5 of 93
  • Discrete Mathematics and Combinatorics 378
  • Computational Theory and Mathematics 681
  • Computer Graphics and Computer-Aided Design 78
  • Artificial Intelligence 643
  • Algebra and Number Theory 88
Replace Jin‐Yi Cai with:
Jin‐Yi Cai United States
Eugene M. Luks United States
Gyula O. H. Katona Hungary
Ronald C. Read Canada
Ehud Friedgut Israel
Carla D. Savage United States
Svatopluk Poljak Czechia
Aviezri S. Fraenkel Israel
J. Spencer United States
Jörg Flum Germany
Frank Ruskey relative to Jin‐Yi Cai United States Jin‐Yi Cai's profile →
Citations per field
00.5×3.7×
Jin‐Yi Cai · 1×
Citations per year

Countries citing papers authored by Frank Ruskey

Since Specialization
Citations

This map shows the geographic impact of Frank Ruskey's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Frank Ruskey with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frank Ruskey more than expected).

Fields of papers citing papers by Frank Ruskey

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Frank Ruskey. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Frank Ruskey. The network helps show where Frank Ruskey may publish in the future.

Co-authorship network

The 25 scholars most cited alongside Frank Ruskey, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Frank Ruskey Line = papers co-authored together Frank Ruskey links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20166
2 20124
3 201119
4 20113
5
The Combinatorics of Certain k-ary Meta-Fibonacci Sequences
20096
6
Generating balanced parentheses and binary trees by prefix shifts
20087
7 20082
8 20036
9 20001
10
The advantages of forward thinking in generating rooted and free trees
199920
11
An efficient algorithm for generating necklaces with fixed density
19992
12
Convex drawings of intersecting families of simple closed curves.
199912
13 19966
14
Gray codes for set partitions and restricted growth tails.
199413
15
Volume upper bounds for 3D graph drawing
19942
16 199318
17 199229
18 199210
19 199125
20 19832

About Frank Ruskey

Frank Ruskey is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Algebra and Number Theory and Artificial Intelligence, having authored 84 papers that have together received 1.3k indexed citations. Recurring topics across this work include Algorithms and Data Compression (28 papers), semigroups and automata theory (26 papers), Advanced Combinatorial Mathematics (23 papers), graph theory and CDMA systems (18 papers), Coding theory and cryptography (16 papers), Advanced Graph Theory Research (11 papers), Computational Geometry and Mesh Generation (9 papers) and DNA and Biological Computing (8 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (378 citations), Computational Theory and Mathematics (681 citations), Computer Graphics and Computer-Aided Design (78 citations), Artificial Intelligence (643 citations) and Algebra and Number Theory (88 citations). Frank Ruskey has collaborated with scholars based in Canada, United States and Australia. Frequent co-authors include Joe Sawada, T. C. Hu, Aaron Williams, Carla D. Savage, Wendy Myrvold, Andrzej Proskurowski, C. Robert Miers, Gang Li, Yuya Koda and M. Serra. Their work appears in journals such as The Electronic Journal of Combinatorics, SIAM Journal on Discrete Mathematics, Journal of Algorithms, Discrete Mathematics and SIAM Journal on Computing.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026