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.
A Practical Guide to Averaging Functions
2015336 citationsGleb Beliakov, Tomasa Calvo et al.Studies in fuzziness and soft computingprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Tomasa Calvo'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 Tomasa Calvo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tomasa Calvo more than expected).
This network shows the impact of papers produced by Tomasa Calvo. 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 Tomasa Calvo. The network helps show where Tomasa Calvo may publish in the future.
Co-authorship network of co-authors of Tomasa Calvo
This figure shows the co-authorship network connecting the top 25 collaborators of Tomasa Calvo.
A scholar is included among the top collaborators of Tomasa Calvo 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 Tomasa Calvo. Tomasa Calvo is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Beliakov, Gleb, Tomasa Calvo, & Simon James. (2009). Some results on Lipschitz quasi-arithmetic means. Deakin Research Online (Deakin University). 1370–1375.1 indexed citations
6.
Beliakov, Gleb & Tomasa Calvo. (2007). Constructions of aggregation operators that preserve ordering of the data. Deakin Research Online (Deakin University). 61–66.3 indexed citations
7.
Beliakov, Gleb, et al.. (2006). Pointwise construction of Lipschitz aggregation operators. Deakin Research Online (Deakin University). 595–602.2 indexed citations
8.
Beliakov, Gleb & Tomasa Calvo. (2005). Identification of general and double aggregation operators using monotone smoothing. Deakin Research Online (Deakin University). 937–942.4 indexed citations
9.
Calvo, Tomasa, et al.. (2005). XAO Operators - The interval universe. European Society for Fuzzy Logic and Technology Conference. 189–197.1 indexed citations
10.
Calvo, Tomasa & Radko Mesiar. (2004). Special Issue: Guest editorial [Summer School on Aggregation Operators, Related Techniques and Their Applications AGOP'2003]. Kybernetika. 40(1). 1–2.1 indexed citations
11.
Calvo, Tomasa, et al.. (2003). Construction of aggregation operators: New composition method. Kybernetika. 39(5). 643–650.7 indexed citations
12.
Sicilia, Miguel‐Ángel, et al.. (2003). An inquiry-based method for Choquet integral-based aggregation of interface usability parameters. Kybernetika. 39(5). 601–614.6 indexed citations
13.
Calvo, Tomasa & Radko Mesiar. (2003). Fusion with quantitative weights.. European Society for Fuzzy Logic and Technology Conference. 312–317.2 indexed citations
Calvo, Tomasa & Radko Mesiar. (2001). Stability of aggregation operators.. European Society for Fuzzy Logic and Technology Conference. 475–478.25 indexed citations
17.
Calvo, Tomasa & Ana Pradera. (2001). Some characterizations based on double aggregation operators.. European Society for Fuzzy Logic and Technology Conference. 470–474.1 indexed citations
18.
Calvo, Tomasa & Bernard De Baets. (2000). On a generalization of the absorption equation.. Ghent University Academic Bibliography (Ghent University).11 indexed citations
Calvo, Tomasa & Radko Mesiar. (1999). Distance aggregation operators.. European Society for Fuzzy Logic and Technology Conference. 11(4). 363–365.4 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.