Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Dana Richards'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 Dana Richards with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dana Richards more than expected).
This network shows the impact of papers produced by Dana Richards. 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 Dana Richards. The network helps show where Dana Richards may publish in the future.
Co-authorship network of co-authors of Dana Richards
This figure shows the co-authorship network connecting the top 25 collaborators of Dana Richards.
A scholar is included among the top collaborators of Dana Richards based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Dana Richards. Dana Richards is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Richards, Dana, et al.. (2014). Let the Games Continue. Scientific American. 311(4). 90–95.1 indexed citations
4.
Liestman, Arthur L., Dana Richards, & Ladislav Stacho. (2009). Broadcasting from multiple originators. Discrete Applied Mathematics. 157(13). 2886–2891.1 indexed citations
5.
Gardner, Martin & Dana Richards. (2006). The colossal book of short puzzles and problems : combinatorics, probability, algebra, geometry, topology, chess, logic, cryptarithms, wordplay, physics and other topics of recreational mathematics. W.W. Norton eBooks.
6.
Richards, Dana, et al.. (2004). Structural and Syntactic Fault Correction Algorithms in Rule-Based System,” International Journal of Computing and Information Sciences.2 indexed citations
Farley, Arthur M., Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, & Dana Richards. (2000). MULTI-SOURCE SPANNING TREE PROBLEMS. Journal of Interconnection Networks. 1(1). 61–71.1 indexed citations
11.
Gargano, Luisa, Arthur L. Liestman, Joseph G. Peters, & Dana Richards. (1994). Reliable broadcasting. Discrete Applied Mathematics. 53(1-3). 135–148.7 indexed citations
Cohoon, James P., Worthy N. Martin, & Dana Richards. (1991). A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes.. 244–248.45 indexed citations
14.
Cohoon, James P., Srinidhi Hegde, Worthy N. Martin, & Dana Richards. (1991). Distributed genetic algorithms for the floorplan design problem. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10(4). 483–492.132 indexed citations
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.