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 Francesco Ricca
Since
Specialization
Citations
This map shows the geographic impact of Francesco Ricca'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 Francesco Ricca with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Francesco Ricca more than expected).
This network shows the impact of papers produced by Francesco Ricca. 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 Francesco Ricca. The network helps show where Francesco Ricca may publish in the future.
Co-authorship network of co-authors of Francesco Ricca
This figure shows the co-authorship network connecting the top 25 collaborators of Francesco Ricca.
A scholar is included among the top collaborators of Francesco Ricca 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 Francesco Ricca. Francesco Ricca is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Gebser, Martin, Marco Maratea, & Francesco Ricca. (2015). The Design of the Sixth Answer Set Programming Competition - - Report -.. 531–544.7 indexed citations
11.
Alviano, Mario, Carmine Dodaro, & Francesco Ricca. (2015). A MaxSAT algorithm using cardinality constraints of bounded size. CINECA IRIS Institutial Research Information System (University of Genoa). 2677–2683.27 indexed citations
12.
Alviano, Mario, Carmine Dodaro, & Francesco Ricca. (2015). Reduct-based Stability Check Using Literal Assumptions. International Conference on Logic Programming.3 indexed citations
13.
Grasso, Giovanni, et al.. (2012). JASP: a framework for integrating answer set programming with Java. Principles of Knowledge Representation and Reasoning. 541–551.6 indexed citations
14.
Grasso, Giovanni, et al.. (2012). Datalog Development Tools - (Extended Abstract).. 81–85.
15.
Dodaro, Carmine, Mario Alviano, Wolfgang Faber, et al.. (2011). The Birth of a WASP: Preliminary Report on a New ASP Solver.. 99–113.5 indexed citations
16.
Perri, Simona, et al.. (2008). Efficient Parallel ASP Instantiation via Dynamic Rewriting. International Conference on Lightning Protection.1 indexed citations
17.
Garro, Alfredo, Luigi Palopoli, & Francesco Ricca. (2006). Exploiting agents in e-learning and skills management context. AI Communications. 19(2). 137–154.17 indexed citations
18.
Ricca, Francesco, Wolfgang Faber, & Nicola Leone. (2006). A backjumping technique for disjunctive logic programming. AI Communications. 19(2). 155–172.18 indexed citations
19.
Faber, Wolfgang, Nicola Leone, & Francesco Ricca. (2005). Heuristics for hard ASP programs. International Joint Conference on Artificial Intelligence. 11(6). 1562–1563.
20.
Ricca, Francesco. (2003). The DLV Java Wrapper.. 263–274.16 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.