This map shows the geographic impact of Jan Ramon'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 Jan Ramon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Ramon more than expected).
This network shows the impact of papers produced by Jan Ramon. 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 Jan Ramon. The network helps show where Jan Ramon may publish in the future.
Co-authorship network of co-authors of Jan Ramon
This figure shows the co-authorship network connecting the top 25 collaborators of Jan Ramon.
A scholar is included among the top collaborators of Jan Ramon 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 Jan Ramon. Jan Ramon is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Schietgat, Leander, Fabrizio Costa, Jan Ramon, & Luc De Raedt. (2009). Maximum common subgraph mining: A fast and effective approach towards feature generation. Lirias (KU Leuven). 1–3.7 indexed citations
9.
Ramon, Jan & Siegfried Nijssen. (2007). General graph refinement with polynomial delay. Lirias (KU Leuven). 1–4.2 indexed citations
10.
Schietgat, Leander, Jan Ramon, & Maurice Bruynooghe. (2007). A polynomial-time metric for outerplanar graphs. Lirias (KU Leuven). 67–70.1 indexed citations
11.
Driessens, Kurt, Jan Ramon, & Tom Croonenborghs. (2006). Transfer learning for reinforcement learning through goal and policy parametrization. Lirias (KU Leuven). 1–4.8 indexed citations
Croonenborghs, Tom, Jan Ramon, Hendrik Blockeel, & Maurice Bruynooghe. (2006). Model-assisted approaches for relational reinforcement learning: Some challenges for the SRL community. Lirias (KU Leuven). 1–8.4 indexed citations
14.
Fierens, Daan, Jan Ramon, Hendrik Blockeel, & Maurice Bruynooghe. (2005). A comparison of approaches for learning first-order logical probability estimation trees. Lirias (KU Leuven). 11–16.3 indexed citations
15.
Ramon, Jan & Kurt Driessens. (2004). On the numeric stability of Gaussian processes regression for relational reinforcement learning. Lirias (KU Leuven). 10–14.14 indexed citations
16.
Croonenborghs, Tom, Jan Ramon, & Maurice Bruynooghe. (2004). Towards Informed Reinforcement Learning. Lirias (KU Leuven). 21–26.6 indexed citations
17.
Raedt, Luc De & Jan Ramon. (2004). Condensed representations for inductive logic programming. Lirias (KU Leuven). 438–446.22 indexed citations
18.
Ramon, Jan, et al.. (2002). Opponent modeling by analysing play. Lirias (KU Leuven). 1–8.9 indexed citations
19.
Blockeel, Hendrik, Maurice Bruynooghe, Sašo Džeroski, Jan Ramon, & Jan Struyf. (2002). Hierarchical multi-classification. Lirias (KU Leuven). 21–35.46 indexed citations
20.
Blockeel, Hendrik, Kurt Driessens, Jan Ramon, et al.. (2001). First order models for the predictive toxicology challenge. Lirias (KU Leuven). 1–12.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.