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.
Countries citing papers authored by Roberto Tamassia
Since
Specialization
Citations
This map shows the geographic impact of Roberto Tamassia'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 Roberto Tamassia with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Roberto Tamassia more than expected).
Fields of papers citing papers by Roberto Tamassia
This network shows the impact of papers produced by Roberto Tamassia. 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 Roberto Tamassia. The network helps show where Roberto Tamassia may publish in the future.
Co-authorship network of co-authors of Roberto Tamassia
This figure shows the co-authorship network connecting the top 25 collaborators of Roberto Tamassia.
A scholar is included among the top collaborators of Roberto Tamassia 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 Roberto Tamassia. Roberto Tamassia is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ghosh, Esha, Olga Ohrimenko, Dimitrios Papadopoulos, Roberto Tamassia, & Nikos Triandopoulos. (2016). Zero-Knowledge Accumulators and Set Algebra. Lecture notes in computer science. 10032. 67.1 indexed citations
3.
Goodrich, Michael T., Roberto Tamassia, & Michael H. Goldwasser. (2013). Data Structures and Algorithms in Python. CERN Document Server (European Organization for Nuclear Research).13 indexed citations
4.
Goodrich, Michael T., Roberto Tamassia, & Michael H. Goldwasser. (2010). Data Structures and Algorithms in Java 6th Edition International Student Version.1 indexed citations
5.
Tamassia, Roberto. (2007). Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications).36 indexed citations
6.
Goodrich, Michael T., J. Z. Sun, & Roberto Tamassia. (2004). Efficient tree-based revocation in groups of low-state devices.
7.
Tamassia, Roberto, et al.. (2001). JDSL: The data structures library in java. 26(4). 21–31.3 indexed citations
8.
Devillers, Olivier, et al.. (1997). Checking the Convexity of Polytopes and the Planarity of Subdivisions. HAL (Le Centre pour la Communication Scientifique Directe).1 indexed citations
9.
Battista, Giuseppe Di & Roberto Tamassia. (1996). Guest Editors' Introduction to the Special Issue on Graph Drwaing.. Algorithmica. 16. 1–3.2 indexed citations
10.
Liotta, Giuseppe, Roberto Tamassia, Ioannis G. Tollis, & Paola Vocca. (1996). Area Requirement of Gabriel Drawings. 135–146.6 indexed citations
11.
Chiang, Yi‐Jen, Michael T. Goodrich, Edward F. Grove, et al.. (1995). External-memory graph algorithms. Symposium on Discrete Algorithms. 139–149.152 indexed citations
12.
Goodrich, Michael T., et al.. (1995). External-Memory Graph Algorithms. Max Planck Institute for Plasma Physics. 139–149.46 indexed citations
13.
Cohen, Robert, et al.. (1993). Dynamic algorithms for optimization problems in bounded tree-width graphs.. 99–112.6 indexed citations
Kanevsky, Arkady, Roberto Tamassia, Giuseppe Di Battista, & Jianer Chen. (1991). On-Line Maintenance of the Four-Connected Components of a Graph* (Extended Abstract). 793–801.1 indexed citations
Tamassia, Roberto. (1985). New Layout Techniques for Entity-Relationship Diagrams. 304–311.10 indexed citations
19.
Tamassia, Roberto & Ioannis G. Tollis. (1985). Plane Representations of Graphs and Visibility between Parallel Segments.. IDEALS (University of Illinois Urbana-Champaign). 86. 21770.2 indexed citations
20.
Tamassia, Roberto, Carlo Batini, & Maurizio Talamo. (1983). An algorithm for automatic layout of entity-relationship diagrams. 421–439.12 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.