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 Giovanni Amendola
Since
Specialization
Citations
This map shows the geographic impact of Giovanni Amendola'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 Giovanni Amendola with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Giovanni Amendola more than expected).
Fields of papers citing papers by Giovanni Amendola
This network shows the impact of papers produced by Giovanni Amendola. 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 Giovanni Amendola. The network helps show where Giovanni Amendola may publish in the future.
Co-authorship network of co-authors of Giovanni Amendola
This figure shows the co-authorship network connecting the top 25 collaborators of Giovanni Amendola.
A scholar is included among the top collaborators of Giovanni Amendola 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 Giovanni Amendola. Giovanni Amendola is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Amendola, Giovanni, Carmine Dodaro, Wolfgang Faber, & Francesco Ricca. (2021). Paracoherent answer set computation. Artificial Intelligence. 299. 103519–103519.2 indexed citations
2.
Amendola, Giovanni, et al.. (2018). A Generator of Hard 2QBF Formulas and ASP Programs.. Principles of Knowledge Representation and Reasoning. 52–56.4 indexed citations
Amendola, Giovanni, Francesco Ricca, & Mirosław Truszczyński. (2018). Random Models of Very Hard 2QBF and Disjunctive Programs: An Overview. UKnowledge (University of Kentucky). 2243(4). 1.2 indexed citations
5.
Amendola, Giovanni & Leonid Libkin. (2018). Explainable Certain Answers. Edinburgh Research Explorer. 1683–1690.
Alviano, Mario, Giovanni Amendola, & Rafael Peñaloza. (2017). Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA.. National Conference on Artificial Intelligence.92 indexed citations
Alviano, Mario, Giovanni Amendola, & Rafael Peñaloza. (2017). Minimal Undefinedness for Fuzzy Answer Sets. Proceedings of the AAAI Conference on Artificial Intelligence. 31(1).1 indexed citations
14.
Amendola, Giovanni, et al.. (2016). Modeling and reasoning about NTU games via answer set programming. International Joint Conference on Artificial Intelligence. 38–45.12 indexed citations
Amendola, Giovanni, Carmine Dodaro, & Francesco Ricca. (2016). ASPQ: An ASP-Based 2QBF Solver. Edinburgh Research Explorer (University of Edinburgh). 1719. 49–54.2 indexed citations
17.
Amendola, Giovanni. (2014). Dealing with Incoherence in ASP: Split Semi-Equilibrium Semantics.. 1334. 23–32.3 indexed citations
18.
Amendola, Giovanni, et al.. (2008). The Economics of Next Generation Access Networks and Regulatory Governance: Towards Geographic Patterns of Regulation. Munich Personal RePEc Archive (Ludwig Maximilian University of Munich). 1(69). 85–108.9 indexed citations
19.
Amendola, Giovanni, et al.. (2007). The Economics of Next Generation Access Networks and Regulatory Governance in Europe: One Size Does Not Fit All. SSRN Electronic Journal.3 indexed citations
20.
Amendola, Giovanni. (1953). Etica e biografia.
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.