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.
The DLV system for knowledge representation and reasoning
2006501 citationsNicola Leone, Gerald Pfeifer et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Francesco Scarcello
Since
Specialization
Citations
This map shows the geographic impact of Francesco Scarcello'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 Scarcello with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Francesco Scarcello more than expected).
Fields of papers citing papers by Francesco Scarcello
This network shows the impact of papers produced by Francesco Scarcello. 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 Scarcello. The network helps show where Francesco Scarcello may publish in the future.
Co-authorship network of co-authors of Francesco Scarcello
This figure shows the co-authorship network connecting the top 25 collaborators of Francesco Scarcello.
A scholar is included among the top collaborators of Francesco Scarcello 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 Scarcello. Francesco Scarcello is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Scarcello, Francesco. (2018). From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions.. SEBD.2 indexed citations
3.
Greco, Gianluigi, et al.. (2015). Structural tractability of shapley and Banzhaf values in allocation games. International Conference on Artificial Intelligence. 547–553.6 indexed citations
Greco, Gianluigi, et al.. (2009). On the complexity of compact coalitional games. International Joint Conference on Artificial Intelligence. 147–152.15 indexed citations
6.
Greco, Gianluigi, et al.. (2009). Constrained coalitional games: formal framework, properties, and complexity results. Adaptive Agents and Multi-Agents Systems. 1295–1296.4 indexed citations
7.
Gottlob, Georg, Gianluigi Greco, & Francesco Scarcello. (2005). The complexity of quantified constraint satisfaction problems under structural restrictions. Oxford University Research Archive (ORA) (University of Oxford). 150–155.10 indexed citations
8.
Greco, Gianluigi & Francesco Scarcello. (2004). Constrained pure Nash equilibria in graphical games. European Conference on Artificial Intelligence. 181–185.4 indexed citations
9.
Leone, Nicola, Simona Perri, & Francesco Scarcello. (2004). BackJumping Techniques for Rules Instantiation in the DLV System. 258–266.5 indexed citations
10.
Greco, Gianluigi & Francesco Scarcello. (2003). Non-binary constraints and optimal dual-graph representations. International Joint Conference on Artificial Intelligence. 227–232.2 indexed citations
Gottlob, Georg, Nicola Leone, & Francesco Scarcello. (2002). Hypertree Decompositions and Tractable Queries. Journal of Computer and System Sciences. 64(3). 579–627.197 indexed citations
13.
Scarcello, Francesco. (2001). Robbers, marshals, and guards.1 indexed citations
Gottlob, Georg, Nicola Leone, & Francesco Scarcello. (2000). Advanced Parallel Algorithms far Processing Acyclic Conjunctive Queries, Rules, and Constraints,. Software Engineering and Knowledge Engineering. 167–176.1 indexed citations
16.
Gottlob, Georg, Nicola Leone, & Francesco Scarcello. (1999). A comparison of structural CSP decomposition methods. Oxford University Research Archive (ORA) (University of Oxford). 1. 394–399.24 indexed citations
17.
Eiter, Thomas, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, & Francesco Scarcello. (1998). The KR system dlv: progress report, comparisons and benchmarks. Principles of Knowledge Representation and Reasoning. 406–417.100 indexed citations
18.
Eiter, Thomas, Wolfgang Faber, Georg Gottlob, et al.. (1997). The dlv System: Model Generator and Application Frontends.24 indexed citations
19.
Eiter, Thomas, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, & Francesco Scarcello. (1997). The Architecture of a Disjunctive Deductive Database System.. 141–152.2 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.