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.
This map shows the geographic impact of Carsten Lutz'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 Carsten Lutz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Carsten Lutz more than expected).
This network shows the impact of papers produced by Carsten Lutz. 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 Carsten Lutz. The network helps show where Carsten Lutz may publish in the future.
Co-authorship network of co-authors of Carsten Lutz
This figure shows the co-authorship network connecting the top 25 collaborators of Carsten Lutz.
A scholar is included among the top collaborators of Carsten Lutz 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 Carsten Lutz. Carsten Lutz is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Konev, Boris, Carsten Lutz, Frank Wolter, & Michael Zakharyaschev. (2015). Conservative rewritability of description logic TBoxes: first results. BIROn (Birkbeck, University of London).
6.
Lutz, Carsten, et al.. (2014). Finite model reasoning in horn description logics. ORCA Online Research @Cardiff (Cardiff University). 288–297.12 indexed citations
7.
Jung, Jean Christoph & Carsten Lutz. (2013). Ontology-Based Access to Probabilistic Data.. Description Logics. 258–270.1 indexed citations
8.
Lutz, Carsten, İnanç Seylan, & Frank Wolter. (2012). An automata-theoretic approach to uniform interpolation and approximation in the description logic EL. Principles of Knowledge Representation and Reasoning. 286–296.34 indexed citations
9.
Lutz, Carsten, Robert Piro, & Frank Wolter. (2010). Enriching EL-Concepts with Greatest Fixpoints. European Conference on Artificial Intelligence. 41–46.9 indexed citations
10.
Kontchakov, Roman, Carsten Lutz, David Toman, Frank Wolter, & Michael Zakharyaschev. (2010). The combined approach to query answering in DL-Lite. BIROn (Birkbeck, University of London). 247–257.88 indexed citations
11.
Lutz, Carsten, Robert Piro, & Frank Wolter. (2010). EL-Concepts go Second-Order: Greatest Fixpoints and Simulation Quantifiers.. Description Logics.2 indexed citations
12.
Lutz, Carsten, David Toman, & Frank Wolter. (2009). Conjunctive query answering in the description logic EL using a relational database system. International Joint Conference on Artificial Intelligence. 2070–2075.106 indexed citations
13.
Konev, Boris, Carsten Lutz, Dirk Walther, & Frank Wolter. (2008). Logical Difference and Module Extraction with CEX and MEX.. Description Logics.7 indexed citations
14.
Krisnadhi, Adila Alfa & Carsten Lutz. (2007). Data Complexity in the EL family of DLs.. Description Logics.11 indexed citations
15.
Lutz, Carsten, Franz Baader, Enrico Franconi, et al.. (2006). Reasoning Support for Ontology Design.. IRIS Research product catalog (Sapienza University of Rome).8 indexed citations
16.
Lutz, Carsten, Frank Wolter, & Michael Zakharyaschev. (2003). Resasoning about Concepts and Similarity.. Description Logics.2 indexed citations
17.
Lutz, Carsten, Carlos Areces, Ian Horrocks, & Ulrike Sattler. (2003). Keys, nominate, and concrete domains. International Joint Conference on Artificial Intelligence. 349–354.10 indexed citations
18.
Lutz, Carsten & Ulrike Sattler. (2002). A Proposal for Describing Services with DLs. Research Explorer (The University of Manchester). 22(2). 143–4.23 indexed citations
19.
Lutz, Carsten & Ulrike Sattler. (2000). The Complexity of Reasoning with Boolean Modal Logic. Research Explorer (The University of Manchester). 329–348.39 indexed citations
20.
Lutz, Carsten & Ralf Möller. (1997). Defined Topological Relations in Description Logics.. Description Logics.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.