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.
Cypher
2018257 citationsNadime Francis, Paolo Guagliardo et al.Edinburgh Research Explorer (University of Edinburgh)profile →
Author Peers
Peers are selected by citation overlap in the author's most active subfields.
citations ·
hero ref
This map shows the geographic impact of Leonid Libkin'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 Leonid Libkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leonid Libkin more than expected).
This network shows the impact of papers produced by Leonid Libkin. 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 Leonid Libkin. The network helps show where Leonid Libkin may publish in the future.
Co-authorship network of co-authors of Leonid Libkin
This figure shows the co-authorship network connecting the top 25 collaborators of Leonid Libkin.
A scholar is included among the top collaborators of Leonid Libkin 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 Leonid Libkin. Leonid Libkin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Console, Marco, Paolo Guagliardo, & Leonid Libkin. (2016). 15th International Conference on Principles of Knowledge Representation and Reasoning (KR2016). Principles of Knowledge Representation and Reasoning.15 indexed citations
4.
Console, Marco, Paolo Guagliardo, & Leonid Libkin. (2016). Approximations and refinements of certain answers via many-valued logics. Edinburgh Research Explorer (University of Edinburgh). 349–358.4 indexed citations
5.
Libkin, Leonid. (2015). How to define certain answers. Edinburgh Research Explorer (University of Edinburgh). 4282–4288.2 indexed citations
6.
Libkin, Leonid. (2015). Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015). National Conference on Artificial Intelligence.194 indexed citations
7.
Libkin, Leonid. (2014). Certain answers as objects and knowledge. Edinburgh Research Explorer. 328–337.7 indexed citations
8.
Barceló, Pablo, Leonid Libkin, & Miguel Romero. (2012). On Low Treewidth Approximations of Conjunctive Queries. Edinburgh Research Explorer (University of Edinburgh). 91–101.1 indexed citations
9.
Libkin, Leonid, Claire David, & Nadime Francis. (2011). A Direct Translation from XPath to Nondeterministic Automata. Edinburgh Research Explorer (University of Edinburgh).
10.
David, Claire, Leonid Libkin, & Filip Murlak. (2010). PODS 2010: PROCEEDINGS OF THE TWENTY-NINTH ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS.2 indexed citations
11.
Libkin, Leonid & Cristina Sirangelo. (2009). Open and Closed World Assumptions in Data Exchange. Edinburgh Research Explorer (University of Edinburgh). 1–6.4 indexed citations
12.
Kolaitis, Phokion G. & Leonid Libkin. (2007). Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. International Conference on Management of Data.9 indexed citations
13.
Grädel, Erich, Phokion G. Kolaitis, Leonid Libkin, et al.. (2005). Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series). Springer eBooks.8 indexed citations
14.
Libkin, Leonid. (2004). Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series). Springer eBooks.146 indexed citations
15.
Dong, Guozhu, Leonid Libkin, Jianwen Su, & Limsoon Wong. (1999). Maintaining Transitive Closure of Graphs in SQL. Journal of Bioresource Management. 51(1). 46.19 indexed citations
16.
Demetrovics, János, et al.. (1992). Normal form relation schemes: a new characterization. SZTAKI Publication Repository (Hungarian Academy of Sciences).4 indexed citations
17.
Demetrovics, János, et al.. (1992). On the interaction between closure operations and choice functions with applications to relational databases. SZTAKI Publication Repository (Hungarian Academy of Sciences).3 indexed citations
18.
Libkin, Leonid. (1992). An elementary proof that upper and lower powerdomain constructions commute.. Bulletin of the European Association for Theoretical Computer Science. 48. 175–177.5 indexed citations
19.
Biskup, Joachim, János Demetrovics, Leonid Libkin, & Ilya Muchnik. (1991). On Relational Database Schemes Having Unique Minimal Key.. Journal of automata, languages and combinatorics. 27. 217–225.6 indexed citations
20.
Gottlob, Georg & Leonid Libkin. (1990). Investigations on Armstrong relations, dependency inference, and excluded functional dependencies.. Acta Cybernetica. 9(4). 385–402.24 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.