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 Frank van Harmelen
Since
Specialization
Citations
This map shows the geographic impact of Frank van Harmelen'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 Frank van Harmelen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frank van Harmelen more than expected).
Fields of papers citing papers by Frank van Harmelen
This network shows the impact of papers produced by Frank van Harmelen. 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 Frank van Harmelen. The network helps show where Frank van Harmelen may publish in the future.
Co-authorship network of co-authors of Frank van Harmelen
This figure shows the co-authorship network connecting the top 25 collaborators of Frank van Harmelen.
A scholar is included among the top collaborators of Frank van Harmelen 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 Frank van Harmelen. Frank van Harmelen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hoekstra, Rinke, et al.. (2017). . VU Research Portal.4 indexed citations
3.
Kaminka, Gal A., et al.. (2016). ECAI 2016: 22nd European Conference on Artificial Intelligence, 29 August - 2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016). IOS Press eBooks.8 indexed citations
4.
Meroño-Peñuela, Albert, Stefan Schlobach, & Frank van Harmelen. (2013). Semantic Web for the Humanities. Lecture notes in computer science. 7882. 645–649.1 indexed citations
Fensel, Dieter, et al.. (2007). Peer-2-Peer enabled Semantic Web for Knowledge Management.
8.
Klein, Michel, et al.. (2006). Thesaurus-based Retrieval of Case Law. VU Research Portal. 61–70.7 indexed citations
9.
McIlraith, Sheila A., Dimitris Plexousakis, & Frank van Harmelen. (2005). The Semantic Web - Iswc 2004: Third International Semantic Web Conference, Hiroshima, Japan, November 7-11, 2004. Proceedings (Lecture Notes in Computer Science). Springer eBooks.8 indexed citations
Fensel, Dieter, Frank van Harmelen, Jos Akkermans, et al.. (2000). OnToKnowledge: Ontology-based Tools for Knowledge Management.. Digital Academic REpository of VU University Amsterdam (Vrije Universiteit Amsterdam).1 indexed citations
15.
Harmelen, Frank van, et al.. (1996). The Mincer Metaphor for Problem-Solving Methods: Making Assumptions for Reasons of Efficiency. UvA-DARE (University of Amsterdam).1 indexed citations
16.
Schreiber, A.T., et al.. (1995). The KACTUS View on the 'O' word. UvA-DARE (University of Amsterdam). 159–168.55 indexed citations
17.
Harmelen, Frank van, et al.. (1992). (ML)2: A Formal Language for KADS Models.. European Conference on Artificial Intelligence. 582–586.
18.
Khan, Rasel Ahmed, et al.. (1989). The architecture of Socrates.. Digital Commons - University of South Florida (University of South Florida).
19.
Bundy, Alan, et al.. (1989). A rational reconstruction and extension of recursion analysis. Edinburgh Research Explorer. 359–365.24 indexed citations
20.
Harmelen, Frank van. (1988). A Classification of Meta-level Architectures.. MIT Press eBooks. 103–122.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.