Countries citing papers authored by Andrei Kelarev
Since
Specialization
Citations
This map shows the geographic impact of Andrei Kelarev'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 Andrei Kelarev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrei Kelarev more than expected).
This network shows the impact of papers produced by Andrei Kelarev. 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 Andrei Kelarev. The network helps show where Andrei Kelarev may publish in the future.
Co-authorship network of co-authors of Andrei Kelarev
This figure shows the co-authorship network connecting the top 25 collaborators of Andrei Kelarev.
A scholar is included among the top collaborators of Andrei Kelarev 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 Andrei Kelarev. Andrei Kelarev is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Yi, Xun, et al.. (2017). Private Recommendations Generation for Vertically Partitioned Datasets. Journal of the Association for Information Systems. 1–12.4 indexed citations
Abawajy, Jemal, Andrei Kelarev, John Yearwood, & Christopher Turville. (2013). A data mining application of the incidence semirings. Houston journal of mathematics. 39(4). 1083–1093.2 indexed citations
8.
Kelarev, Andrei, Andrew Stranieri, Herbert F. Jelinek, Shamsul Huda, & Jemal Abawajy. (2012). A Decision Tree Approach for Ewing Test Selection to Support the Clinical Assessment of Cardiac Autonomic Neuropathy.
9.
Kelarev, Andrei, et al.. (2012). Improving classifications for cardiac autonomic neuropathy using multi-level ensemble classifiers and feature selection based on random forest. FedUni ResearchOnline (Federation University Australia). 93–101.8 indexed citations
10.
Kelarev, Andrei, et al.. (2011). OPTIMIZATION AND MATRIX CONSTRUCTIONS FOR CLASSIFICATION OF DATA. FedUni ResearchOnline (Federation University Australia). 41. 65–73.1 indexed citations
11.
Kelarev, Andrei, Joseph F. Ryan, & John Yearwood. (2009). An algorithm for the optimization of multiple classifiers in data mining based on graphs. Deakin Research Online (Deakin University). 65–85.3 indexed citations
12.
Yearwood, John, et al.. (2009). Applying clustering and ensemble clustering approaches to phishing profiling. 25–34.22 indexed citations
13.
Kelarev, Andrei. (2006). A polynomial algorithm for codes based on directed graphs. eCite Digital Repository (University of Tasmania). 51. 87–92.2 indexed citations
14.
Kelarev, Andrei, et al.. (2004). A combinatorial property and power graphs of semigroups. Commentationes Mathematicae Universitatis Carolinae. 45(1). 1–7.39 indexed citations
Kelarev, Andrei, et al.. (2002). Non-commutative Modal Rings and Internalized Equality. eCite Digital Repository (University of Tasmania).1 indexed citations
17.
Kelarev, Andrei. (2002). On undirected Cayley graphs. eCite Digital Repository (University of Tasmania). 25. 73–78.43 indexed citations
18.
Dǎscǎlescu, S., Andrei Kelarev, & C. Năstăsescu. (2001). Semigroup gradings of upper triangular matrix rings. eCite Digital Repository (University of Tasmania).1 indexed citations
19.
Kelarev, Andrei, et al.. (1999). ON FINITE PRINCIPAL IDEAL RINGS. eCite Digital Repository (University of Tasmania). 68(1). 77–84.12 indexed citations
20.
Kelarev, Andrei. (1996). Combinatorial Properties of Sequences in Groups and Semirings.. Discrete Mathematics & Theoretical Computer Science. 289–298.14 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.