This map shows the geographic impact of Jon Sneyers'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 Jon Sneyers with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jon Sneyers more than expected).
This network shows the impact of papers produced by Jon Sneyers. 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 Jon Sneyers. The network helps show where Jon Sneyers may publish in the future.
Co-authorship network of co-authors of Jon Sneyers
This figure shows the co-authorship network connecting the top 25 collaborators of Jon Sneyers.
A scholar is included among the top collaborators of Jon Sneyers 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 Jon Sneyers. Jon Sneyers is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sneyers, Jon, Danny De Schreye, & Thom Frühwirth. (2013). CHRiSM and Probabilistic Argumentation Logic.1 indexed citations
9.
Sneyers, Jon & Thom Frühwirth. (2012). Proceedings of the 9th International Workshop on Constraint Handling Rules (CHR 2012). Lirias (KU Leuven).1 indexed citations
Sneyers, Jon & Danny De Schreye. (2010). APOPCALEAPS: Automatic Music Generation with CHRiSM. Lirias (KU Leuven). 1–8.2 indexed citations
12.
Sneyers, Jon, et al.. (2009). A proposal for a next generation of CHR. Lirias (KU Leuven). 1–17.1 indexed citations
13.
Sneyers, Jon. (2008). Optimizing Compilation and Computational Complexity of Constraint Handling Rules (Optimaliserende compilatie en computationele complexiteit van beperkingsafhandelingsregels).1 indexed citations
14.
Sneyers, Jon, et al.. (2007). Aggregates in CHR.1 indexed citations
15.
Sneyers, Jon, et al.. (2007). Join ordering for constraint handling rules. Lirias (KU Leuven). 107–121.6 indexed citations
16.
Sneyers, Jon, et al.. (2006). Extending CHR with negation as absence. Lirias (KU Leuven). 125–139.10 indexed citations
17.
Sneyers, Jon, et al.. (2006). To CHR¬ or not to CHR¬ : Extending CHR with Negation as Absence. Lirias (KU Leuven).3 indexed citations
18.
Sneyers, Jon, Tom Schrijvers, & Bart Demoen. (2006). Dijkstra's algorithm with Fibonacci heaps: an executable description in CHR. Lirias (KU Leuven). 182–191.21 indexed citations
19.
Sneyers, Jon, Tom Schrijvers, & Bart Demoen. (2005). The computational power and complexity of Constraint Handling Rules. Lirias (KU Leuven). 3–17.8 indexed citations
20.
Sneyers, Jon, Tom Schrijvers, & Bart Demoen. (2005). Guard reasoning for CHR optimization. Lirias (KU Leuven).1 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.