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 Peter Eades'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 Peter Eades with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Eades more than expected).
This network shows the impact of papers produced by Peter Eades. 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 Peter Eades. The network helps show where Peter Eades may publish in the future.
Co-authorship network of co-authors of Peter Eades
This figure shows the co-authorship network connecting the top 25 collaborators of Peter Eades.
A scholar is included among the top collaborators of Peter Eades 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 Peter Eades. Peter Eades is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Eades, Peter, Seok-Hee Hong, Naoki Katoh, et al.. (2012). Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract).. 339–345.1 indexed citations
6.
Huang, Weidong, Seok-Hee Hong, & Peter Eades. (2006). Predicting Graph Reading Performance: A Cognitive Approach. eCite Digital Repository (University of Tasmania).15 indexed citations
7.
Huang, Weidong, Seok‐Hee Hong, & Peter Eades. (2006). How People Read Sociograms: A Questionnaire Study. eCite Digital Repository (University of Tasmania).15 indexed citations
8.
Mutzel, Petra & Peter Eades. (2001). Graphs in Software Visualization - Introduction. 285–294.2 indexed citations
9.
Nascimento, Hugo Alexandre Dantas do, et al.. (2000). A Multi-agent Approach using A-Teams for Graph Drawing.. Information Systems. 39–42.2 indexed citations
Eades, Peter, et al.. (1996). Two minimum dominating sets with minimum intersection in chordal graphs. Nordic journal of computing. 3(3). 220–237.5 indexed citations
Eades, Peter & Xuemin Lin. (1995). A Heuristic for the Feedback Arc Set Problem. The Australasian Journal of Combinatorics. 12. 15–26.12 indexed citations
15.
Staples, John, Peter Eades, Naoki Katoh, & Alistair Moffat. (1995). Proceedings of the 6th International Symposium on Algorithms and Computation.8 indexed citations
16.
Cohen, Robert, Peter Eades, Tao Lin, & Frank Ruskey. (1994). Volume upper bounds for 3D graph drawing. Conference of the Centre for Advanced Studies on Collaborative Research. 11.2 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.